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,400 | 14,706,203 | 2,185 | Devices, systems, methods, and computer-readable mediums for arbitrating bus transactions on a communications bus based on health information are disclosed. Health information of master devices can be used to adjust priorities of bus transactions from master devices to meet quality of service requirements of the master devices. In one embodiment, a bus interconnect is provided and configured to communicate bus transactions from any of a plurality of master devices to slave device(s) coupled the bus interconnect. The bus interconnect is further configured to map health information for each of the plurality of master devices into virtual priority space. The bus interconnect is further configured to translate the virtual priority space into a physical priority level for each of the plurality of master devices. The bus interconnect is further configured to arbitrate bus transactions for the plurality of master devices based on physical priority level for the plurality of master devices. | 1. A bus interconnect configured to:
determine health information for a plurality of master devices; map the health information for each of the plurality of master devices into a virtual priority space; translate the virtual priority space into a physical priority level for each of the plurality of master devices; and arbitrate bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 2. The bus interconnect of claim 1 configured to receive the bus transactions from the plurality of master devices. 3. The bus interconnect of claim 1, further comprising at least one arbiter configured to arbitrate the bus transactions based on the physical priority level. 4. The bus interconnect of claim 1, further configured to allocate relative priorities of the plurality of master devices based on an assignment of a master device class among a plurality of master device classes to the plurality of master devices. 5. The bus interconnect of claim 4, wherein the master device class is comprised of at least one of a hard real time class, a low latency class, a soft real time class, and a best effort class. 6. The bus interconnect of claim 1 configured to receive the health information from at least one master device among the plurality of master devices. 7. The bus interconnect of claim 1, wherein the health information for at least one master device among the plurality of master devices is comprised of a plurality of health information segments corresponding to a plurality of address segments in an address map for the at least one master device. 8. The bus interconnect of claim 1 further comprising at least one book keeping element configured to derive the health information for at least one of the plurality of master devices. 9. The bus interconnect of claim 8, wherein the at least one book keeping element is configured to derive the health information for the at least one of the plurality of master devices based on a credit/debit option. 10. The bus interconnect of claim 8, wherein the at least one book keeping element is configured to derive the health information for the at least one of the plurality of master devices based on an averaging bandwidth threshold option. 11. The bus interconnect of claim 8, wherein the at least one book keeping element (BKE) is clocked independently from a bus interconnect clock signal. 12. The bus interconnect of claim 1 configured to arbitrate the bus transactions based on at least one arbitration priority policy selected from the group consisting of a round-robin arbitration priority policy, a round-robin with re-ordering arbitration priority policy, and a fixed arbitration priority policy. 13. The bus interconnect of claim 1, further comprising a priority usage monitor configured to monitor the frequency of priority usage of the plurality of master devices. 14. The bus interconnect of claim 13, wherein the priority usage monitor is configured to determine capacity requirements for arbitrating the bus transactions. 15. The bus interconnect of claim 14 configured to decrease a frequency of a bus interconnect clock signal if the capacity requirements are less than a threshold related to available capacity for arbitrating the bus transactions. 16. The bus interconnect of claim 15 wherein the threshold is ninety percent (90%) of the available capacity for arbitrating the bus transactions. 17. The bus interconnect of claim 14 configured to increase a frequency of a bus interconnect clock signal if the capacity requirements are more than a threshold related to available capacity for arbitrating the bus transactions. 18. The bus interconnect of claim 17 wherein the threshold is ninety percent (90%) of the available capacity for arbitrating the bus transactions. 19. The bus interconnect of claim 1 integrated into a semiconductor die. 20. The bus interconnect of claim 1, further comprising a device selected from the group consisting of a set top box, an entertainment unit, a navigation device, a communications device, a fixed location data unit, a mobile location data unit, a mobile phone, a cellular phone, a computer, a portable computer, a desktop computer, a personal digital assistant (PDA), a monitor, a computer monitor, a television, a tuner, a radio, a satellite radio, a music player, a digital music player, a portable music player, a digital video player, a video player, a digital video disc (DVD) player, and a portable digital video player, into which the bus interconnect is integrated. 21. A bus interconnect, comprising:
a means for determining health information for a plurality of master devices; a means for mapping the health information for each of the plurality of master devices into a virtual priority space; a means for translating the virtual priority space into a physical priority level for each of the plurality of master devices; and a means for arbitrating bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 22. A method of arbitrating bus transactions in a bus interconnect, comprising:
determining health information for a plurality of master devices; mapping the health information for each of the plurality of master devices into a virtual priority space; translating the virtual priority space into a physical priority level for each of the plurality of master devices; and arbitrating bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 23. A computer-readable medium having stored thereon computer executable instructions to cause a bus interconnect to:
determine health information for a plurality of master devices; map the health information for each of the plurality of master devices into a virtual priority space; translate the virtual priority space into a physical priority level for each of the plurality of master devices; and arbitrate bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 24. A book keeping element configured to:
determine a service contract for a master device; compare the service contract to a service threshold; and encode health information regarding the master device based on the comparison of a service characteristic to the service contract. 25. The book keeping element of claim 24, wherein the service characteristic is selected from the group consisting of a bandwidth and a latency. 26. The book keeping element of claim 24, wherein the service contract is selected from the group consisting of a fixed bandwidth contract, an average latency contract, a variable bandwidth contract, and a dynamic contract. | Devices, systems, methods, and computer-readable mediums for arbitrating bus transactions on a communications bus based on health information are disclosed. Health information of master devices can be used to adjust priorities of bus transactions from master devices to meet quality of service requirements of the master devices. In one embodiment, a bus interconnect is provided and configured to communicate bus transactions from any of a plurality of master devices to slave device(s) coupled the bus interconnect. The bus interconnect is further configured to map health information for each of the plurality of master devices into virtual priority space. The bus interconnect is further configured to translate the virtual priority space into a physical priority level for each of the plurality of master devices. The bus interconnect is further configured to arbitrate bus transactions for the plurality of master devices based on physical priority level for the plurality of master devices.1. A bus interconnect configured to:
determine health information for a plurality of master devices; map the health information for each of the plurality of master devices into a virtual priority space; translate the virtual priority space into a physical priority level for each of the plurality of master devices; and arbitrate bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 2. The bus interconnect of claim 1 configured to receive the bus transactions from the plurality of master devices. 3. The bus interconnect of claim 1, further comprising at least one arbiter configured to arbitrate the bus transactions based on the physical priority level. 4. The bus interconnect of claim 1, further configured to allocate relative priorities of the plurality of master devices based on an assignment of a master device class among a plurality of master device classes to the plurality of master devices. 5. The bus interconnect of claim 4, wherein the master device class is comprised of at least one of a hard real time class, a low latency class, a soft real time class, and a best effort class. 6. The bus interconnect of claim 1 configured to receive the health information from at least one master device among the plurality of master devices. 7. The bus interconnect of claim 1, wherein the health information for at least one master device among the plurality of master devices is comprised of a plurality of health information segments corresponding to a plurality of address segments in an address map for the at least one master device. 8. The bus interconnect of claim 1 further comprising at least one book keeping element configured to derive the health information for at least one of the plurality of master devices. 9. The bus interconnect of claim 8, wherein the at least one book keeping element is configured to derive the health information for the at least one of the plurality of master devices based on a credit/debit option. 10. The bus interconnect of claim 8, wherein the at least one book keeping element is configured to derive the health information for the at least one of the plurality of master devices based on an averaging bandwidth threshold option. 11. The bus interconnect of claim 8, wherein the at least one book keeping element (BKE) is clocked independently from a bus interconnect clock signal. 12. The bus interconnect of claim 1 configured to arbitrate the bus transactions based on at least one arbitration priority policy selected from the group consisting of a round-robin arbitration priority policy, a round-robin with re-ordering arbitration priority policy, and a fixed arbitration priority policy. 13. The bus interconnect of claim 1, further comprising a priority usage monitor configured to monitor the frequency of priority usage of the plurality of master devices. 14. The bus interconnect of claim 13, wherein the priority usage monitor is configured to determine capacity requirements for arbitrating the bus transactions. 15. The bus interconnect of claim 14 configured to decrease a frequency of a bus interconnect clock signal if the capacity requirements are less than a threshold related to available capacity for arbitrating the bus transactions. 16. The bus interconnect of claim 15 wherein the threshold is ninety percent (90%) of the available capacity for arbitrating the bus transactions. 17. The bus interconnect of claim 14 configured to increase a frequency of a bus interconnect clock signal if the capacity requirements are more than a threshold related to available capacity for arbitrating the bus transactions. 18. The bus interconnect of claim 17 wherein the threshold is ninety percent (90%) of the available capacity for arbitrating the bus transactions. 19. The bus interconnect of claim 1 integrated into a semiconductor die. 20. The bus interconnect of claim 1, further comprising a device selected from the group consisting of a set top box, an entertainment unit, a navigation device, a communications device, a fixed location data unit, a mobile location data unit, a mobile phone, a cellular phone, a computer, a portable computer, a desktop computer, a personal digital assistant (PDA), a monitor, a computer monitor, a television, a tuner, a radio, a satellite radio, a music player, a digital music player, a portable music player, a digital video player, a video player, a digital video disc (DVD) player, and a portable digital video player, into which the bus interconnect is integrated. 21. A bus interconnect, comprising:
a means for determining health information for a plurality of master devices; a means for mapping the health information for each of the plurality of master devices into a virtual priority space; a means for translating the virtual priority space into a physical priority level for each of the plurality of master devices; and a means for arbitrating bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 22. A method of arbitrating bus transactions in a bus interconnect, comprising:
determining health information for a plurality of master devices; mapping the health information for each of the plurality of master devices into a virtual priority space; translating the virtual priority space into a physical priority level for each of the plurality of master devices; and arbitrating bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 23. A computer-readable medium having stored thereon computer executable instructions to cause a bus interconnect to:
determine health information for a plurality of master devices; map the health information for each of the plurality of master devices into a virtual priority space; translate the virtual priority space into a physical priority level for each of the plurality of master devices; and arbitrate bus transactions for the plurality of master devices based on the physical priority level for each of the plurality of master devices. 24. A book keeping element configured to:
determine a service contract for a master device; compare the service contract to a service threshold; and encode health information regarding the master device based on the comparison of a service characteristic to the service contract. 25. The book keeping element of claim 24, wherein the service characteristic is selected from the group consisting of a bandwidth and a latency. 26. The book keeping element of claim 24, wherein the service contract is selected from the group consisting of a fixed bandwidth contract, an average latency contract, a variable bandwidth contract, and a dynamic contract. | 2,100 |
4,401 | 13,653,995 | 2,163 | Validation rules are specified for validating data included in fields of elements of a dataset. Cells are rendered in a two-dimensional grid that includes: one or more subsets of the cells extending in a direction along a first axis, each associated with a respective field, and multiple subsets of the cells extending in a direction along a second axis, one or more of the subsets associated with a respective validation rule. Validation rules are applied to at least one element based on user input received from at least some of the cells. Some cells, associated with a field and a validation rule, can each include: an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and/or an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field. | 1. A computing system for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the computing system including:
a user interface module configured to render a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
a processing module configured to apply validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. 2. The system of claim 1, wherein applying validation rules to data included in a first field of a first element includes:
determining any selected validation rules associated with cells from a subset of cells extending in the direction along the first axis associated with the first field of the first element, based on any input received in the input elements of the cells; and determining validation results for the data included in the first field of the first element based on the selected validation rules. 3. The system of claim 1 wherein the one or more subsets of the cells extending in a direction along the first axis are rows of cells. 4. The system of claim 1 wherein the multiple subsets of the cells extending in a direction along the second axis are columns of cells. 5. The system of claim 1 wherein the input element is configured to receive input specifying one or more validation rule parameters. 6. The system of claim 1 wherein one or more of the validation rules when evaluated yield a validation result of set of at least two validation results, the validation results including a result of valid and a result of invalid. 7. The system of claim 6 wherein the indicator for indicating feedback included in at least some of the cells is configured to apply shading to a cell if the validation result is a result of invalid. 8. The system of claim 5 wherein the input element is further configured to determine a correctness of each of the validation rule parameters. 9. The system of claim 8 wherein the at least some cells associated with a field and a validation rule each include a second indicator for displaying a result of determining a correctness of the validation rule parameters associated with the cell. 10. The system of claim 1 wherein the indicator for indicating feedback includes a numeric indicator which is configured to display a number of invalid results, the number of invalid results determined by applying the associated validation rule to data included in the associated field for all of the elements of the dataset. 11. The system of claim 1 wherein the dataset includes one or more tables of a database and the elements of the dataset include database records. 12. The system of claim 1 wherein one or more of the validation rules are user defined. 13. The system of claim 1 wherein one or more of the validation rules are predefined. 14. The system of claim 1 wherein one or more of the multiple subsets of the cells extending in the direction along the second axis of the two-dimensional grid includes a first cell associated with a first validation rule and a second cell associated with a second validation rule, the second validation rule different from the first validation rule. 15. The system of claim 1 wherein one or more of the multiple subsets of the cells extending in the direction along the second axis of the two-dimensional grid includes a subset of cells that include an input element for receiving a value to replace an existing value in a corresponding field in response to a result of invalid for one of the validation rules applied to the existing value. 16. The system of claim 1 wherein one or more of the multiple subsets of the cells extending in the direction along the second axis of the two-dimensional grid includes a subset of cells that include an input element for receiving an excluded value, such that the excluded value appearing in a corresponding field results in preventing validation rules from being applied to the existing value. 17. A computing system for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the computing system including:
means for rendering a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
means for applying validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. 18. A method for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the method including:
rendering, by a user interface module, a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
applying, by at least one processor, validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. 19. A computer program, stored on a computer-readable storage medium, for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the computer program including instructions for causing a computer system to:
render a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
apply validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. | Validation rules are specified for validating data included in fields of elements of a dataset. Cells are rendered in a two-dimensional grid that includes: one or more subsets of the cells extending in a direction along a first axis, each associated with a respective field, and multiple subsets of the cells extending in a direction along a second axis, one or more of the subsets associated with a respective validation rule. Validation rules are applied to at least one element based on user input received from at least some of the cells. Some cells, associated with a field and a validation rule, can each include: an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and/or an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field.1. A computing system for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the computing system including:
a user interface module configured to render a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
a processing module configured to apply validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. 2. The system of claim 1, wherein applying validation rules to data included in a first field of a first element includes:
determining any selected validation rules associated with cells from a subset of cells extending in the direction along the first axis associated with the first field of the first element, based on any input received in the input elements of the cells; and determining validation results for the data included in the first field of the first element based on the selected validation rules. 3. The system of claim 1 wherein the one or more subsets of the cells extending in a direction along the first axis are rows of cells. 4. The system of claim 1 wherein the multiple subsets of the cells extending in a direction along the second axis are columns of cells. 5. The system of claim 1 wherein the input element is configured to receive input specifying one or more validation rule parameters. 6. The system of claim 1 wherein one or more of the validation rules when evaluated yield a validation result of set of at least two validation results, the validation results including a result of valid and a result of invalid. 7. The system of claim 6 wherein the indicator for indicating feedback included in at least some of the cells is configured to apply shading to a cell if the validation result is a result of invalid. 8. The system of claim 5 wherein the input element is further configured to determine a correctness of each of the validation rule parameters. 9. The system of claim 8 wherein the at least some cells associated with a field and a validation rule each include a second indicator for displaying a result of determining a correctness of the validation rule parameters associated with the cell. 10. The system of claim 1 wherein the indicator for indicating feedback includes a numeric indicator which is configured to display a number of invalid results, the number of invalid results determined by applying the associated validation rule to data included in the associated field for all of the elements of the dataset. 11. The system of claim 1 wherein the dataset includes one or more tables of a database and the elements of the dataset include database records. 12. The system of claim 1 wherein one or more of the validation rules are user defined. 13. The system of claim 1 wherein one or more of the validation rules are predefined. 14. The system of claim 1 wherein one or more of the multiple subsets of the cells extending in the direction along the second axis of the two-dimensional grid includes a first cell associated with a first validation rule and a second cell associated with a second validation rule, the second validation rule different from the first validation rule. 15. The system of claim 1 wherein one or more of the multiple subsets of the cells extending in the direction along the second axis of the two-dimensional grid includes a subset of cells that include an input element for receiving a value to replace an existing value in a corresponding field in response to a result of invalid for one of the validation rules applied to the existing value. 16. The system of claim 1 wherein one or more of the multiple subsets of the cells extending in the direction along the second axis of the two-dimensional grid includes a subset of cells that include an input element for receiving an excluded value, such that the excluded value appearing in a corresponding field results in preventing validation rules from being applied to the existing value. 17. A computing system for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the computing system including:
means for rendering a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
means for applying validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. 18. A method for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the method including:
rendering, by a user interface module, a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
applying, by at least one processor, validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. 19. A computer program, stored on a computer-readable storage medium, for specifying one or more validation rules for validating data included in one or more fields of each element of a plurality of elements of a dataset, the computer program including instructions for causing a computer system to:
render a plurality of cells arranged in a two-dimensional grid having a first axis and a second axis, the two-dimensional grid including
one or more subsets of the cells extending in a direction along the first axis of the two-dimensional grid, each subset of the one or more subsets associated with a respective field of an element of the plurality of elements of the dataset, and
multiple subsets of the cells extending in a direction along the second axis of the two-dimensional grid, one or more of the multiple subsets associated with a respective validation rule; and
apply validation rules to at least one element of the dataset based on user input received from at least some of the cells; wherein at least some cells, associated with a field and a validation rule, each include
an input element for receiving input determining whether or not the associated validation rule is applied to the associated field, and
an indicator for indicating feedback associated with a validation result based on applying the associated validation rule to data included in the associated field of the element. | 2,100 |
4,402 | 12,955,768 | 2,165 | Embodiments relate to systems and methods for generating interpolated input data sets using reduced input source objects. A database can store operational data, such as financial, climate or other information. A user can input or access a set of target data, representing output the user wishes to be generated from an interpolated set of input data based on an interpolation function. Thus, the average air temperature of a region may be known for the last ten years, along with other inputs such as water temperature, wind speed, etc. The target data can include an expected average temperature for the current year. The interpolation engine can receive the target temperature, and interpolate other climate inputs that will produce the target output temperature. The interpolation engine can also reduce the number of predetermined data objects or the dimensions of input data sets to generate interpolated inputs based on more compact inputs. | 1. A method of generating a set of interpolated input data based on reduced data sets, comprising:
receiving a set of predetermined input data as part of a set of combined input data; receiving a set of target output data to be generated according to the set of combined input data; generating a set of reduced predetermined input data from the set of predetermined input data; and generating a set of interpolated input data based on the set of reduced predetermined input data and the set of target output data, the set of interpolated data being generated to conformally map the set of combined input data to the set of target output data. 2. The method of claim 1, wherein the set of predetermined input data has at least two dimensions. 3. The method of claim 2, wherein the set of reduced predetermined input data has a smaller number of data objects than the set of predetermined input in at least one of the at least two dimensions. 4. The method of claim 3, wherein the set of reduced predetermined input data has at least one less dimension than the set of predetermined input data. 5. The method of claim 1, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises—
generating at least one set of interpolated input data based on the set of predetermined input data,
generating at least one set of interpolated input data based on reduced predetermined input data, and
selecting the reduced predetermined input data for inclusion in the set of reduced predetermined input data when the at least one interpolated input data based on the reduced predetermined input data is within a series output margin of the at least one set of interpolated input data based on the set of predetermined input data. 6. The method of claim 5, wherein generating the set of interpolated input data based on the set of dimensionally reduced predetermined input data and the set of target output data comprises generating a set of series of interpolated input data, each series of the set of series of interpolated input data being based on different reduced predetermined input data. 7. The method of claim 6, further comprising selecting a series of interpolated input data having a least smallest series output margin as at least part of the set of reduced predetermined input data. 8. The method of claim 1, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises receiving user input selecting at least one of a number of data objects to be reduced in the set of predetermined input data or one or more dimensions to be reduced in the set of predetermined input data. 9. The method of claim 1, wherein the set of combined input data comprises at least one of a set of financial data, a set of medical data, a set of demographic data, a set of engineering data, a set of network operations data, or a set of geographic data. 10. The method of claim 1, wherein at least one of the set of target output data or the set of predetermined input data are accessed from the database management system remote to a client machine operated by a user. 11. A system for generating a set of interpolated input data, comprising:
an interface to a database storing a set of target data; and a processor, communicating with the database, the processor being configured to—
receive a set of predetermined input data as part of a set of combined input data,
receive the set of target output data to be generated according to the set of combined input data,
generate a set of reduced predetermined input data from the set of predetermined input data, and
generate a set of interpolated input data based on the set of reduced predetermined input data and the set of target output data, the set of interpolated data being generated to conformally map the set of combined input data to the set of target output data. 12. The system of claim 11, wherein the set of predetermined input data has at least two dimensions. 13. The system of claim 12, wherein the set of reduced predetermined input data has a smaller number of data objects than the set of predetermined input in at least one of the at least two dimensions. 14. The system of claim 13, wherein the set of reduced predetermined input data has at least one less dimension than the set of predetermined input data. 15. The system of claim 11, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises—
generating at least one set of interpolated input data based on the set of predetermined input data,
generating at least one set of interpolated input data based on reduced predetermined input data, and
selecting the reduced predetermined input data for inclusion in the set of reduced predetermined input data when the at least one interpolated input data based on the reduced predetermined input data is within a series output margin of the at least one set of interpolated input data based on the set of predetermined input data. 16. The system of claim 15, wherein generating the set of interpolated input data based on the set of dimensionally reduced predetermined input data and the set of target output data comprises generating a set of series of interpolated input data, each series of the set of series of interpolated input data being based on different reduced predetermined input data. 17. The system of claim 16, wherein the processor is further configured to select a series of interpolated input data having a least smallest series output margin as at least part of the set of reduced predetermined input data. 18. The system of claim 11, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises receiving user input selecting at least one of a number of data objects to be reduced in the set of predetermined input data or one or more dimensions to be reduced in the set of predetermined input data. 19. The system of claim 11, wherein the set of combined input data comprises at least one of a set of financial data, a set of medical data, a set of demographic data, a set of engineering data, a set of network operations data, or a set of geographic data. 20. The system of claim 11, wherein at least one of the set of target output data or the set of predetermined input data are accessed from a database management system remote to a client machine operated by a user. | Embodiments relate to systems and methods for generating interpolated input data sets using reduced input source objects. A database can store operational data, such as financial, climate or other information. A user can input or access a set of target data, representing output the user wishes to be generated from an interpolated set of input data based on an interpolation function. Thus, the average air temperature of a region may be known for the last ten years, along with other inputs such as water temperature, wind speed, etc. The target data can include an expected average temperature for the current year. The interpolation engine can receive the target temperature, and interpolate other climate inputs that will produce the target output temperature. The interpolation engine can also reduce the number of predetermined data objects or the dimensions of input data sets to generate interpolated inputs based on more compact inputs.1. A method of generating a set of interpolated input data based on reduced data sets, comprising:
receiving a set of predetermined input data as part of a set of combined input data; receiving a set of target output data to be generated according to the set of combined input data; generating a set of reduced predetermined input data from the set of predetermined input data; and generating a set of interpolated input data based on the set of reduced predetermined input data and the set of target output data, the set of interpolated data being generated to conformally map the set of combined input data to the set of target output data. 2. The method of claim 1, wherein the set of predetermined input data has at least two dimensions. 3. The method of claim 2, wherein the set of reduced predetermined input data has a smaller number of data objects than the set of predetermined input in at least one of the at least two dimensions. 4. The method of claim 3, wherein the set of reduced predetermined input data has at least one less dimension than the set of predetermined input data. 5. The method of claim 1, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises—
generating at least one set of interpolated input data based on the set of predetermined input data,
generating at least one set of interpolated input data based on reduced predetermined input data, and
selecting the reduced predetermined input data for inclusion in the set of reduced predetermined input data when the at least one interpolated input data based on the reduced predetermined input data is within a series output margin of the at least one set of interpolated input data based on the set of predetermined input data. 6. The method of claim 5, wherein generating the set of interpolated input data based on the set of dimensionally reduced predetermined input data and the set of target output data comprises generating a set of series of interpolated input data, each series of the set of series of interpolated input data being based on different reduced predetermined input data. 7. The method of claim 6, further comprising selecting a series of interpolated input data having a least smallest series output margin as at least part of the set of reduced predetermined input data. 8. The method of claim 1, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises receiving user input selecting at least one of a number of data objects to be reduced in the set of predetermined input data or one or more dimensions to be reduced in the set of predetermined input data. 9. The method of claim 1, wherein the set of combined input data comprises at least one of a set of financial data, a set of medical data, a set of demographic data, a set of engineering data, a set of network operations data, or a set of geographic data. 10. The method of claim 1, wherein at least one of the set of target output data or the set of predetermined input data are accessed from the database management system remote to a client machine operated by a user. 11. A system for generating a set of interpolated input data, comprising:
an interface to a database storing a set of target data; and a processor, communicating with the database, the processor being configured to—
receive a set of predetermined input data as part of a set of combined input data,
receive the set of target output data to be generated according to the set of combined input data,
generate a set of reduced predetermined input data from the set of predetermined input data, and
generate a set of interpolated input data based on the set of reduced predetermined input data and the set of target output data, the set of interpolated data being generated to conformally map the set of combined input data to the set of target output data. 12. The system of claim 11, wherein the set of predetermined input data has at least two dimensions. 13. The system of claim 12, wherein the set of reduced predetermined input data has a smaller number of data objects than the set of predetermined input in at least one of the at least two dimensions. 14. The system of claim 13, wherein the set of reduced predetermined input data has at least one less dimension than the set of predetermined input data. 15. The system of claim 11, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises—
generating at least one set of interpolated input data based on the set of predetermined input data,
generating at least one set of interpolated input data based on reduced predetermined input data, and
selecting the reduced predetermined input data for inclusion in the set of reduced predetermined input data when the at least one interpolated input data based on the reduced predetermined input data is within a series output margin of the at least one set of interpolated input data based on the set of predetermined input data. 16. The system of claim 15, wherein generating the set of interpolated input data based on the set of dimensionally reduced predetermined input data and the set of target output data comprises generating a set of series of interpolated input data, each series of the set of series of interpolated input data being based on different reduced predetermined input data. 17. The system of claim 16, wherein the processor is further configured to select a series of interpolated input data having a least smallest series output margin as at least part of the set of reduced predetermined input data. 18. The system of claim 11, wherein generating the set of reduced predetermined input data from the set of predetermined input data comprises receiving user input selecting at least one of a number of data objects to be reduced in the set of predetermined input data or one or more dimensions to be reduced in the set of predetermined input data. 19. The system of claim 11, wherein the set of combined input data comprises at least one of a set of financial data, a set of medical data, a set of demographic data, a set of engineering data, a set of network operations data, or a set of geographic data. 20. The system of claim 11, wherein at least one of the set of target output data or the set of predetermined input data are accessed from a database management system remote to a client machine operated by a user. | 2,100 |
4,403 | 13,886,461 | 2,168 | A data validation procedure may be propagated to a server machine and to a client machine to perform the same data checking in the respective machines. The data validation procedure may be converted and expressed in a specification language that is suitable for the server machine. Likewise, the data validation procedure may be converted and expressed in a specification language that is suitable for the client machine. | 1. A method for validating data comprising:
a computer system receiving a first data validation procedure expressed in a first specification language; the computer system converting the first data validation procedure that is expressed in the first specification language to a second data validation procedure expressed in a second specification language different from the first specification language; the computer system causing the second data validation procedure to be executed on a server system; and the computer system causing the first data validation procedure to be executed on a client system. 2. The method of claim 1 wherein causing the first data validation procedure to be executed on a client system includes sending an interpreter engine and a representation of the first data validation procedure to the client system, wherein the interpreter engine executes on the client system to interpret the first data validation procedure. 3. The method of claim 2 wherein the interpreter engine and the first data validation procedure are sent to the client system in a web page. 4. The method of claim 1 wherein causing the first data validation procedure to be executed on a client system includes:
converting the first data validation procedure to a data validation procedure expressed in a third specification language different from the first specification language; and
sending the third data validation procedure to the client system,
wherein the client system can execute the third data validation procedure. 5. The method of claim 4 wherein the third data validation procedure is sent to the client system in a web page. 6. The method of claim 5 wherein the third data validation procedure is computer executable program code. 7. The method of claim 1 wherein the server system includes the computer system. 8. The method of claim 1 wherein the second specification language is either an interpreted language or a compiled language. 9. A computer system comprising:
a data processing unit; and a memory having stored therein executable program code, which when executed by the data processing unit, causes the data processing unit to:
receive a first data validation procedure expressed in a first specification language;
convert the first data validation procedure that is expressed in the first specification language to a second data validation procedure expressed in a second specification language different from the first specification language;
cause the second data validation procedure to be executed on a server system; and
cause the first data validation procedure to be executed on a client system. 10. The computer system of claim 9 wherein the executable program code, which when executed by the data processing unit, further causes the data processing unit to send an interpreter engine and the first data validation procedure to the client system, wherein the interpreter engine executes on the client system to interpret the first data validation procedure. 11. The computer system of claim 10 wherein the interpreter engine and the first data validation procedure are sent to the client system in a web page. 12. The computer system of claim 9 wherein the executable program code, which when executed by the data processing unit, further causes the data processing unit to:
convert the first data validation procedure to a data validation procedure expressed in a third specification language different from the first specification language; and
send the third data validation procedure to the client system,
wherein the client system can execute the third data validation procedure. 13. The computer system of claim 12 wherein the third data validation procedure is sent to the client system in a web page. 14. The computer system of claim 13 wherein the third data validation procedure is computer executable program code. 15. The computer system of claim 9 wherein the server system includes the computer system. 16. The computer system of claim 9 wherein the second specification language is either an interpreted language or a compiled language. 17. A non-transitory computer-readable storage medium having stored thereon executable program code, which when executed by a computer system, causes the computer system to perform steps of:
receiving a first data validation procedure expressed in a first specification language; converting the first data validation procedure that is expressed in the first specification language to a second data validation procedure expressed in a second specification language different from the first specification language; causing the second data validation procedure to be executed on a server system; and causing the first data validation procedure to be executed on a client system. 18. The non-transitory computer-readable storage medium of claim 17 wherein the executable program code, which when executed by the computer system, further causes the computer system to perform a step of sending an interpreter engine and the first data validation procedure to the client system, wherein the interpreter engine executes on the client system to interpret the first data validation procedure. 19. The non-transitory computer-readable storage medium of claim 18 wherein the interpreter engine and the first data validation procedure are sent to the client system in a web page. 20. The non-transitory computer-readable storage medium of claim 17 wherein the server system includes the computer system. | A data validation procedure may be propagated to a server machine and to a client machine to perform the same data checking in the respective machines. The data validation procedure may be converted and expressed in a specification language that is suitable for the server machine. Likewise, the data validation procedure may be converted and expressed in a specification language that is suitable for the client machine.1. A method for validating data comprising:
a computer system receiving a first data validation procedure expressed in a first specification language; the computer system converting the first data validation procedure that is expressed in the first specification language to a second data validation procedure expressed in a second specification language different from the first specification language; the computer system causing the second data validation procedure to be executed on a server system; and the computer system causing the first data validation procedure to be executed on a client system. 2. The method of claim 1 wherein causing the first data validation procedure to be executed on a client system includes sending an interpreter engine and a representation of the first data validation procedure to the client system, wherein the interpreter engine executes on the client system to interpret the first data validation procedure. 3. The method of claim 2 wherein the interpreter engine and the first data validation procedure are sent to the client system in a web page. 4. The method of claim 1 wherein causing the first data validation procedure to be executed on a client system includes:
converting the first data validation procedure to a data validation procedure expressed in a third specification language different from the first specification language; and
sending the third data validation procedure to the client system,
wherein the client system can execute the third data validation procedure. 5. The method of claim 4 wherein the third data validation procedure is sent to the client system in a web page. 6. The method of claim 5 wherein the third data validation procedure is computer executable program code. 7. The method of claim 1 wherein the server system includes the computer system. 8. The method of claim 1 wherein the second specification language is either an interpreted language or a compiled language. 9. A computer system comprising:
a data processing unit; and a memory having stored therein executable program code, which when executed by the data processing unit, causes the data processing unit to:
receive a first data validation procedure expressed in a first specification language;
convert the first data validation procedure that is expressed in the first specification language to a second data validation procedure expressed in a second specification language different from the first specification language;
cause the second data validation procedure to be executed on a server system; and
cause the first data validation procedure to be executed on a client system. 10. The computer system of claim 9 wherein the executable program code, which when executed by the data processing unit, further causes the data processing unit to send an interpreter engine and the first data validation procedure to the client system, wherein the interpreter engine executes on the client system to interpret the first data validation procedure. 11. The computer system of claim 10 wherein the interpreter engine and the first data validation procedure are sent to the client system in a web page. 12. The computer system of claim 9 wherein the executable program code, which when executed by the data processing unit, further causes the data processing unit to:
convert the first data validation procedure to a data validation procedure expressed in a third specification language different from the first specification language; and
send the third data validation procedure to the client system,
wherein the client system can execute the third data validation procedure. 13. The computer system of claim 12 wherein the third data validation procedure is sent to the client system in a web page. 14. The computer system of claim 13 wherein the third data validation procedure is computer executable program code. 15. The computer system of claim 9 wherein the server system includes the computer system. 16. The computer system of claim 9 wherein the second specification language is either an interpreted language or a compiled language. 17. A non-transitory computer-readable storage medium having stored thereon executable program code, which when executed by a computer system, causes the computer system to perform steps of:
receiving a first data validation procedure expressed in a first specification language; converting the first data validation procedure that is expressed in the first specification language to a second data validation procedure expressed in a second specification language different from the first specification language; causing the second data validation procedure to be executed on a server system; and causing the first data validation procedure to be executed on a client system. 18. The non-transitory computer-readable storage medium of claim 17 wherein the executable program code, which when executed by the computer system, further causes the computer system to perform a step of sending an interpreter engine and the first data validation procedure to the client system, wherein the interpreter engine executes on the client system to interpret the first data validation procedure. 19. The non-transitory computer-readable storage medium of claim 18 wherein the interpreter engine and the first data validation procedure are sent to the client system in a web page. 20. The non-transitory computer-readable storage medium of claim 17 wherein the server system includes the computer system. | 2,100 |
4,404 | 14,869,399 | 2,165 | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy. | 1. A method executed by one or more computing devices for determining allied product information for products corresponding to product records stored in a computer-readable catalog data structure including categories, the product records having attributes associated therewith, the method comprising:
identifying, by at least one of the one or more computing devices, at least one first attribute of at least one first product record in a first category; identifying, by at least one of the one or more computing devices, at least one second attribute of at least one second product record in a second category; determining, by at least one of the one or more computing devices, a number of the at least one first attribute and the at least one second attribute that are common; resolving, by at least one of the one or more computing devices, a relationship in the catalog data structure between the at least one first product record and the at least one second product record; and determining, by at least one of the one or more computing devices, whether the at least one first product record and the at least one second product record correspond to allied products based on the number of the at least one first attribute and the at least one second attribute that are common and said resolving step; transforming, by at least one of the one or more computing devices, the catalog data structure by adding allied product data to set at least one product corresponding to the at least one first product record in the first category as allied with at least one product corresponding to the at least one second product record in the second category based at least in part on the results of the comparing step; and saving, by at least one of the one or more computing devices, allied product data in the catalog data structure. 2. The method of claim 1, wherein the number of the at least one first attribute and the at least one second attribute that are common is determined by counting a threshold number of the at least one first attribute and the at least one second attribute that are common. 3. The method of claim 1, wherein the at least one first product record is a set of product records in the first category and wherein the at least one second product record is a set of product records in the second category. 4. The method of claim 1, wherein the at least one first attribute and the at least one second attribute comprise non-intrinsic attributes. 5. A computer system for determining allied product information for products corresponding to product records stored in a computer-readable catalog structure including categories, the product records having attributes associated therewith, the system comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
identify at least one first attribute of at least one first product record in a first category;
identify at least one second attribute of at least one second product record in a second category;
determine a number of the at least one first attribute and the at least one second attribute that are common;
resolve a relationship in the catalog data structure between the at least one first product record and the at least one second product record; and
determine whether the at least one first product record and the at least one second product record correspond to allied products based on the number of the at least one first attribute and the at least one second attribute that are common and the resolved relationship;
transform the catalog data structure by adding allied product data to set at least one product corresponding to the at least one first product record in the first category as allied with at least one product corresponding to the at least one second product record in the second category based at least in part on the results of the comparing step; and
save allied product data in the catalog data structure. 6. The system of claim 5, wherein the number of the at least one first attribute and the at least one second attribute that are common is determined by counting a threshold number of the at least one first attribute and the at least one second attribute that are common. 7. The system of claim 5, wherein the at least one first product record is a set of product records in the first category and wherein the at least one second product record is a set of product records in the second category. 8. The system of claim 5, wherein the at least one first attribute and the at least one second attribute comprise non-intrinsic attributes. | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy.1. A method executed by one or more computing devices for determining allied product information for products corresponding to product records stored in a computer-readable catalog data structure including categories, the product records having attributes associated therewith, the method comprising:
identifying, by at least one of the one or more computing devices, at least one first attribute of at least one first product record in a first category; identifying, by at least one of the one or more computing devices, at least one second attribute of at least one second product record in a second category; determining, by at least one of the one or more computing devices, a number of the at least one first attribute and the at least one second attribute that are common; resolving, by at least one of the one or more computing devices, a relationship in the catalog data structure between the at least one first product record and the at least one second product record; and determining, by at least one of the one or more computing devices, whether the at least one first product record and the at least one second product record correspond to allied products based on the number of the at least one first attribute and the at least one second attribute that are common and said resolving step; transforming, by at least one of the one or more computing devices, the catalog data structure by adding allied product data to set at least one product corresponding to the at least one first product record in the first category as allied with at least one product corresponding to the at least one second product record in the second category based at least in part on the results of the comparing step; and saving, by at least one of the one or more computing devices, allied product data in the catalog data structure. 2. The method of claim 1, wherein the number of the at least one first attribute and the at least one second attribute that are common is determined by counting a threshold number of the at least one first attribute and the at least one second attribute that are common. 3. The method of claim 1, wherein the at least one first product record is a set of product records in the first category and wherein the at least one second product record is a set of product records in the second category. 4. The method of claim 1, wherein the at least one first attribute and the at least one second attribute comprise non-intrinsic attributes. 5. A computer system for determining allied product information for products corresponding to product records stored in a computer-readable catalog structure including categories, the product records having attributes associated therewith, the system comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
identify at least one first attribute of at least one first product record in a first category;
identify at least one second attribute of at least one second product record in a second category;
determine a number of the at least one first attribute and the at least one second attribute that are common;
resolve a relationship in the catalog data structure between the at least one first product record and the at least one second product record; and
determine whether the at least one first product record and the at least one second product record correspond to allied products based on the number of the at least one first attribute and the at least one second attribute that are common and the resolved relationship;
transform the catalog data structure by adding allied product data to set at least one product corresponding to the at least one first product record in the first category as allied with at least one product corresponding to the at least one second product record in the second category based at least in part on the results of the comparing step; and
save allied product data in the catalog data structure. 6. The system of claim 5, wherein the number of the at least one first attribute and the at least one second attribute that are common is determined by counting a threshold number of the at least one first attribute and the at least one second attribute that are common. 7. The system of claim 5, wherein the at least one first product record is a set of product records in the first category and wherein the at least one second product record is a set of product records in the second category. 8. The system of claim 5, wherein the at least one first attribute and the at least one second attribute comprise non-intrinsic attributes. | 2,100 |
4,405 | 14,240,198 | 2,192 | A computing system and a method of handling a system management request. The computing system includes a virtual high-privilege mode in a trusted domain managed by the virtual machine monitor. The virtual high-privilege mode handles the system management request. | 1. A computing system comprising:
a processor; a virtual machine monitor to manage a trusted domain; and a virtual high-privilege mode in the trusted domain to handle a system management request. 2. The system of claim 1, wherein the virtual high-privilege mode is a virtual system management interrupt mode to handle a system management request. 3. The system of claim 1, wherein the processor does not enter a system management mode. 4. The system of claim 1, wherein the virtual high-privilege mode is a virtual appliance. 5. The system of claim 1, wherein the virtual machine monitor or the privileged domain includes the virtual high-privilege mode. 6. The system of claim 1, wherein the system management request is one of received by the virtual basic input output system (vBIOS), provided to the virtual high-privilege mode in a Windows management instrumentation (WMI) wrapper, and provided to the virtual high-privilege mode by a remote procedure call (RPC). 7. A method of handling system management requests in a computing system comprising:
managing, by a virtual machine monitor, a trusted domain for a virtual high-privilege mode to receive a system management request; preventing the system management request from initiating a system management mode; and handling the system management request in a virtual high-privilege mode environment. 8. The method of claim 7, further comprising changing a system configuration. 9. The method of claim 8, wherein the virtual machine monitor changes the system configuration not available to a guest domain. 10. The method of claim 7, further comprising issuing a system management interrupt from a guest domain. 11. The method of claim 10, wherein the domain is a guest domain or privileged domain. 12. A computer readable medium comprising code that if executed by a processor causes a computing system to:
manage a trusted domain with a virtual machine monitor; receive a system management request by a virtual high-privilege mode environment in the trusted domain; prevent the system management request from initiating a system management mode; and handling the system management request in the virtual high-privilege mode environment. 13. The computer readable medium of claim 12 further comprising code that if executed causes a computing device to:
change a system configuration not available to a guest domain. 14. The computer readable medium of claim 12 further comprising code that if executed causes a computing device to:
forward the system management request from a virtual basis input output system (vBIOS) to a virtual high-privilege mode. 15. The computer readable medium of claim 12 further comprising code that if executed causes a computing device to:
generate a domain to issue the system management request; wherein the domain is a guest domain or privileged domain. | A computing system and a method of handling a system management request. The computing system includes a virtual high-privilege mode in a trusted domain managed by the virtual machine monitor. The virtual high-privilege mode handles the system management request.1. A computing system comprising:
a processor; a virtual machine monitor to manage a trusted domain; and a virtual high-privilege mode in the trusted domain to handle a system management request. 2. The system of claim 1, wherein the virtual high-privilege mode is a virtual system management interrupt mode to handle a system management request. 3. The system of claim 1, wherein the processor does not enter a system management mode. 4. The system of claim 1, wherein the virtual high-privilege mode is a virtual appliance. 5. The system of claim 1, wherein the virtual machine monitor or the privileged domain includes the virtual high-privilege mode. 6. The system of claim 1, wherein the system management request is one of received by the virtual basic input output system (vBIOS), provided to the virtual high-privilege mode in a Windows management instrumentation (WMI) wrapper, and provided to the virtual high-privilege mode by a remote procedure call (RPC). 7. A method of handling system management requests in a computing system comprising:
managing, by a virtual machine monitor, a trusted domain for a virtual high-privilege mode to receive a system management request; preventing the system management request from initiating a system management mode; and handling the system management request in a virtual high-privilege mode environment. 8. The method of claim 7, further comprising changing a system configuration. 9. The method of claim 8, wherein the virtual machine monitor changes the system configuration not available to a guest domain. 10. The method of claim 7, further comprising issuing a system management interrupt from a guest domain. 11. The method of claim 10, wherein the domain is a guest domain or privileged domain. 12. A computer readable medium comprising code that if executed by a processor causes a computing system to:
manage a trusted domain with a virtual machine monitor; receive a system management request by a virtual high-privilege mode environment in the trusted domain; prevent the system management request from initiating a system management mode; and handling the system management request in the virtual high-privilege mode environment. 13. The computer readable medium of claim 12 further comprising code that if executed causes a computing device to:
change a system configuration not available to a guest domain. 14. The computer readable medium of claim 12 further comprising code that if executed causes a computing device to:
forward the system management request from a virtual basis input output system (vBIOS) to a virtual high-privilege mode. 15. The computer readable medium of claim 12 further comprising code that if executed causes a computing device to:
generate a domain to issue the system management request; wherein the domain is a guest domain or privileged domain. | 2,100 |
4,406 | 13,237,865 | 2,164 | A system, computer-implemented method, and computer program product for performing integrated transactional and data warehouse business intelligence analysis using a correlated report constructed from data correlations between current transactional data and historical data from a data warehouse. The method commences by retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a particular business intelligence attribute, then receiving from a storage system, results of a query to a data warehouse, the results comprising a historical business intelligence value of the same business intelligence attribute. Modules within the system (e.g., a business intelligence application) perform processing to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report and transmit the correlated report for displaying on a single surface. | 1. A computer-implemented method for performing integrated transactional and data warehouse business intelligence analysis, the method comprising:
retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a first business intelligence attribute; receiving, from a storage system, a result set of a query to a data warehouse, the result set comprising a historical business intelligence value of the first business intelligence attribute; processing, in an application server, a business intelligence application, the business intelligence application to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report; and displaying the correlated report on a single surface. 2. The method of claim 1, further comprising:
reformatting the correlated report to display at least one trend line, the trend line comprising at least one point being the OLTP business intelligence value, and at least one point being the historical business intelligence value. 3. The method of claim 1, further comprising:
reformatting the correlated report to display on a mobile device. 4. The method of claim 3, further comprising:
transmitting the reformatted correlated report to the mobile device. 5. The method of claim 1, further comprising:
caching the result set in a cache; and using the cache to access at least one of, the OLTP business intelligence value, and the historical business intelligence value. 6. The method of claim 1, wherein receiving from a storage system comprises receiving from at least one of, a relational database, a cloud, and a storage device. 7. The method of claim 1, further comprising:
processing, in an application server, a business intelligence application, the business intelligence application to combine a second OLTP business intelligence value with a second historical business intelligence value to form a correlated report. 8. A computer system for performing integrated transactional and data warehouse business intelligence analysis, the computer system comprising:
a computer processor to execute a set of program code instructions; and a memory to hold the program code instructions, in which the program code instructions comprises program code, to perform retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a first business intelligence attribute; to perform receiving, from a storage system, a result set of a query to a data warehouse, the result set comprising a historical business intelligence value of the first business intelligence attribute; to perform processing, in an application server, a business intelligence application, the business intelligence application to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report; and to perform displaying the correlated report on a single surface. 9. The computer system of claim 8, further comprising:
to perform reformatting the correlated report to display at least one trend line, the trend line comprising at least one point being the OLTP business intelligence value, and at least one point being the historical business intelligence value. 10. The computer system of claim 8, further comprising program code:
to perform reformatting the correlated report to display on a mobile device. 11. The computer system of claim 10, further comprising program code:
to perform transmitting the reformatted correlated report to the mobile device. 12. The computer system of claim 8, further comprising program code:
to perform caching the result set in a cache; and to use the cache to access at least one of, the OLTP business intelligence value, and the historical business intelligence value. 13. The computer system of claim 8, wherein receiving from a storage system comprises receiving from at least one of, a relational database, a cloud, and a storage device. 14. The computer system of claim 8, further comprising program code:
to perform processing, in an application server, a business intelligence application, the business intelligence application to combine a second OLTP business intelligence value with a second historical business intelligence value to form a correlated report. 15. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a method to implement integrated transactional and data warehouse business intelligence analysis, the method comprising:
retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a first business intelligence attribute; receiving, from a storage system, a result set of a query to a data warehouse, the result set comprising a historical business intelligence value of the first business intelligence attribute; processing, in an application server, a business intelligence application, the business intelligence application to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report; and displaying the correlated report on a single surface. 16. The computer program product of claim 15, further comprising:
instructions for reformatting the correlated report to display at least one trend line, the trend line comprising at least one point being the OLTP business intelligence value, and at least one point being the historical business intelligence value. 17. The computer program product of claim 15, further comprising:
instructions for reformatting the correlated report to display on a mobile device. 18. The computer program product of claim 17, further comprising:
instructions for transmitting the reformatted correlated report to the mobile device. 19. The computer program product of claim 15, further comprising:
instructions for caching the result set in a cache; and instructions for using the cache to access at least one of, the OLTP business intelligence value, and the historical business intelligence value. 20. The computer program product of claim 15, wherein receiving from a storage system comprises receiving from at least one of, a relational database, a cloud, and a storage device. | A system, computer-implemented method, and computer program product for performing integrated transactional and data warehouse business intelligence analysis using a correlated report constructed from data correlations between current transactional data and historical data from a data warehouse. The method commences by retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a particular business intelligence attribute, then receiving from a storage system, results of a query to a data warehouse, the results comprising a historical business intelligence value of the same business intelligence attribute. Modules within the system (e.g., a business intelligence application) perform processing to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report and transmit the correlated report for displaying on a single surface.1. A computer-implemented method for performing integrated transactional and data warehouse business intelligence analysis, the method comprising:
retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a first business intelligence attribute; receiving, from a storage system, a result set of a query to a data warehouse, the result set comprising a historical business intelligence value of the first business intelligence attribute; processing, in an application server, a business intelligence application, the business intelligence application to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report; and displaying the correlated report on a single surface. 2. The method of claim 1, further comprising:
reformatting the correlated report to display at least one trend line, the trend line comprising at least one point being the OLTP business intelligence value, and at least one point being the historical business intelligence value. 3. The method of claim 1, further comprising:
reformatting the correlated report to display on a mobile device. 4. The method of claim 3, further comprising:
transmitting the reformatted correlated report to the mobile device. 5. The method of claim 1, further comprising:
caching the result set in a cache; and using the cache to access at least one of, the OLTP business intelligence value, and the historical business intelligence value. 6. The method of claim 1, wherein receiving from a storage system comprises receiving from at least one of, a relational database, a cloud, and a storage device. 7. The method of claim 1, further comprising:
processing, in an application server, a business intelligence application, the business intelligence application to combine a second OLTP business intelligence value with a second historical business intelligence value to form a correlated report. 8. A computer system for performing integrated transactional and data warehouse business intelligence analysis, the computer system comprising:
a computer processor to execute a set of program code instructions; and a memory to hold the program code instructions, in which the program code instructions comprises program code, to perform retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a first business intelligence attribute; to perform receiving, from a storage system, a result set of a query to a data warehouse, the result set comprising a historical business intelligence value of the first business intelligence attribute; to perform processing, in an application server, a business intelligence application, the business intelligence application to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report; and to perform displaying the correlated report on a single surface. 9. The computer system of claim 8, further comprising:
to perform reformatting the correlated report to display at least one trend line, the trend line comprising at least one point being the OLTP business intelligence value, and at least one point being the historical business intelligence value. 10. The computer system of claim 8, further comprising program code:
to perform reformatting the correlated report to display on a mobile device. 11. The computer system of claim 10, further comprising program code:
to perform transmitting the reformatted correlated report to the mobile device. 12. The computer system of claim 8, further comprising program code:
to perform caching the result set in a cache; and to use the cache to access at least one of, the OLTP business intelligence value, and the historical business intelligence value. 13. The computer system of claim 8, wherein receiving from a storage system comprises receiving from at least one of, a relational database, a cloud, and a storage device. 14. The computer system of claim 8, further comprising program code:
to perform processing, in an application server, a business intelligence application, the business intelligence application to combine a second OLTP business intelligence value with a second historical business intelligence value to form a correlated report. 15. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a method to implement integrated transactional and data warehouse business intelligence analysis, the method comprising:
retrieving a transactional data record from an online transactional processing (OLTP) system, the transactional data record comprising at least one OLTP business intelligence value of a first business intelligence attribute; receiving, from a storage system, a result set of a query to a data warehouse, the result set comprising a historical business intelligence value of the first business intelligence attribute; processing, in an application server, a business intelligence application, the business intelligence application to combine the OLTP business intelligence value with the historical business intelligence value to form a correlated report; and displaying the correlated report on a single surface. 16. The computer program product of claim 15, further comprising:
instructions for reformatting the correlated report to display at least one trend line, the trend line comprising at least one point being the OLTP business intelligence value, and at least one point being the historical business intelligence value. 17. The computer program product of claim 15, further comprising:
instructions for reformatting the correlated report to display on a mobile device. 18. The computer program product of claim 17, further comprising:
instructions for transmitting the reformatted correlated report to the mobile device. 19. The computer program product of claim 15, further comprising:
instructions for caching the result set in a cache; and instructions for using the cache to access at least one of, the OLTP business intelligence value, and the historical business intelligence value. 20. The computer program product of claim 15, wherein receiving from a storage system comprises receiving from at least one of, a relational database, a cloud, and a storage device. | 2,100 |
4,407 | 13,861,678 | 2,145 | A method and apparatus for analyzing nonconformances. A volume in an aircraft is identified. The nonconformances within the volume of the aircraft are identified. Graphical indicators are displayed indicating the nonconformances within the volume in a graphical user interface on a display device. | 1. A method for processing nonconformances, the method comprising:
identifying a volume in an aircraft; identifying the nonconformances within the volume of the aircraft; and displaying graphical indicators indicating the nonconformances within the volume in a graphical user interface on a display device. 2. The method of claim 1 further comprising:
displaying the graphical indicators to indicate a presence of a cluster of the nonconformances within the volume. 3. The method of claim 1, wherein the step of identifying the volume in the aircraft comprises:
displaying sections of the aircraft in the graphical user interface on the display device, wherein the sections correspond to sections as manufactured for assembly of the aircraft and wherein the sections are selectable; detecting a selection of a section from the sections displayed in the graphical user interface; identifying the volume in a model of the aircraft corresponding to the section selected from the sections displayed in the graphical user interface; and displaying the volume in the model identified for the section selected in the graphical user interface. 4. The method of claim 1, wherein the volume is selected from one of all of the aircraft and a section of the aircraft as manufactured for assembly of the aircraft. 5. The method of claim 1 further comprising:
identifying parts in the volume; and
displaying the parts in the graphical user interface with the nonconformances. 6. The method of claim 5, wherein the parts are all of the parts in volume. 7. The method of claim 5, wherein identifying the parts in the volume comprises:
identifying a state of assembly of the aircraft; and identifying the parts as ones present in the aircraft for the state of assembly of the aircraft. 8. The method of claim 7, wherein the state of assembly is a current state of assembly. 9. The method of claim 1, wherein the volume is a first volume and the aircraft is a first aircraft and further comprising:
identifying a number of volumes for a number of aircraft in addition to the first volume for the first aircraft. 10. The method of claim 1 further comprising:
managing assembly of the aircraft based on the nonconformances displayed within the volume of the aircraft displayed in the graphical user interface. 11. The method of claim 1, wherein a graphical indicator in the graphical indicators is selected from at least one of a color, cross hatching, an icon, highlighting, animation, or a font. 12. The method of claim 1 further comprising:
determining whether an area of interest is present for the aircraft from density information for the nonconformances. 13. The method of claim 12 further comprising:
displaying the graphical indicators indicating the nonconformances within the volume in the graphical user interface on the display device such that the graphical indicators indicate a presence of the area of interest. 14. The method of claim 12 further comprising:
displaying positions for the aircraft; and
displaying a graphical indicator indicating the position of the aircraft where the area of interest is present. 15. The method of claim 12, wherein determining whether the area of interest is present for the aircraft from the density information for the nonconformances comprises:
identifying nonconformance records for other aircraft; comparing the nonconformances in the aircraft with other nonconformances in other aircraft to form a comparison; and determining whether the area of interest is present from the comparison. 16. A method for processing nonconformances, the method comprising:
identifying a volume in an object; identifying the nonconformances within the volume of the object; and displaying graphical indicators indicating the nonconformances within the volume in a graphical user interface on a display device. 17. The method of claim 16 further comprising:
displaying the graphical indicators to indicate a presence of a cluster of the nonconformances within the volume. 18. An apparatus comprising:
an object manager configured to identify a volume in an aircraft; identify nonconformances within the volume of the aircraft; and display graphical indicators indicating the nonconformances within the volume in a graphical user interface on a display device. 19. The apparatus of claim 18, wherein the object manager is further configured to display the graphical indicators to indicate a presence of a cluster of the nonconformances within the volume. 20. The apparatus of claim 18, wherein in being configured to identify the volume in the aircraft, the object manager is configured to display sections of the aircraft in the graphical user interface on the display device, wherein the sections correspond to sections as manufactured for assembly of the aircraft and wherein the sections are selectable; detect a selection of a section from the sections displayed in the graphical user interface; identify the volume in a model of the aircraft corresponding to the section selected from the sections displayed in the graphical user interface; and display the volume in the model identified for the section selected in the graphical user interface. | A method and apparatus for analyzing nonconformances. A volume in an aircraft is identified. The nonconformances within the volume of the aircraft are identified. Graphical indicators are displayed indicating the nonconformances within the volume in a graphical user interface on a display device.1. A method for processing nonconformances, the method comprising:
identifying a volume in an aircraft; identifying the nonconformances within the volume of the aircraft; and displaying graphical indicators indicating the nonconformances within the volume in a graphical user interface on a display device. 2. The method of claim 1 further comprising:
displaying the graphical indicators to indicate a presence of a cluster of the nonconformances within the volume. 3. The method of claim 1, wherein the step of identifying the volume in the aircraft comprises:
displaying sections of the aircraft in the graphical user interface on the display device, wherein the sections correspond to sections as manufactured for assembly of the aircraft and wherein the sections are selectable; detecting a selection of a section from the sections displayed in the graphical user interface; identifying the volume in a model of the aircraft corresponding to the section selected from the sections displayed in the graphical user interface; and displaying the volume in the model identified for the section selected in the graphical user interface. 4. The method of claim 1, wherein the volume is selected from one of all of the aircraft and a section of the aircraft as manufactured for assembly of the aircraft. 5. The method of claim 1 further comprising:
identifying parts in the volume; and
displaying the parts in the graphical user interface with the nonconformances. 6. The method of claim 5, wherein the parts are all of the parts in volume. 7. The method of claim 5, wherein identifying the parts in the volume comprises:
identifying a state of assembly of the aircraft; and identifying the parts as ones present in the aircraft for the state of assembly of the aircraft. 8. The method of claim 7, wherein the state of assembly is a current state of assembly. 9. The method of claim 1, wherein the volume is a first volume and the aircraft is a first aircraft and further comprising:
identifying a number of volumes for a number of aircraft in addition to the first volume for the first aircraft. 10. The method of claim 1 further comprising:
managing assembly of the aircraft based on the nonconformances displayed within the volume of the aircraft displayed in the graphical user interface. 11. The method of claim 1, wherein a graphical indicator in the graphical indicators is selected from at least one of a color, cross hatching, an icon, highlighting, animation, or a font. 12. The method of claim 1 further comprising:
determining whether an area of interest is present for the aircraft from density information for the nonconformances. 13. The method of claim 12 further comprising:
displaying the graphical indicators indicating the nonconformances within the volume in the graphical user interface on the display device such that the graphical indicators indicate a presence of the area of interest. 14. The method of claim 12 further comprising:
displaying positions for the aircraft; and
displaying a graphical indicator indicating the position of the aircraft where the area of interest is present. 15. The method of claim 12, wherein determining whether the area of interest is present for the aircraft from the density information for the nonconformances comprises:
identifying nonconformance records for other aircraft; comparing the nonconformances in the aircraft with other nonconformances in other aircraft to form a comparison; and determining whether the area of interest is present from the comparison. 16. A method for processing nonconformances, the method comprising:
identifying a volume in an object; identifying the nonconformances within the volume of the object; and displaying graphical indicators indicating the nonconformances within the volume in a graphical user interface on a display device. 17. The method of claim 16 further comprising:
displaying the graphical indicators to indicate a presence of a cluster of the nonconformances within the volume. 18. An apparatus comprising:
an object manager configured to identify a volume in an aircraft; identify nonconformances within the volume of the aircraft; and display graphical indicators indicating the nonconformances within the volume in a graphical user interface on a display device. 19. The apparatus of claim 18, wherein the object manager is further configured to display the graphical indicators to indicate a presence of a cluster of the nonconformances within the volume. 20. The apparatus of claim 18, wherein in being configured to identify the volume in the aircraft, the object manager is configured to display sections of the aircraft in the graphical user interface on the display device, wherein the sections correspond to sections as manufactured for assembly of the aircraft and wherein the sections are selectable; detect a selection of a section from the sections displayed in the graphical user interface; identify the volume in a model of the aircraft corresponding to the section selected from the sections displayed in the graphical user interface; and display the volume in the model identified for the section selected in the graphical user interface. | 2,100 |
4,408 | 14,853,289 | 2,176 | A method of creating a surgical operative note during a specific surgical procedure on a patient. The method includes creating surgical checklists for a plurality of surgical procedures before initiation of the surgical procedure, creating an index of image specific annotations for the specific surgical procedure before initiation of the surgical procedure, obtaining an electronic template, inserting one of the surgical checklists into the template associated with the specific surgical procedure on the patient, obtaining an image of the patient, inserting the image of the patient into the electronic template, using a voice command to associate at least one of the image specific annotations with the image of the patient in the electronic template, and inserting the at least one of the image specific annotations into the electronic template adjacent the image. | 1. A method of creating a surgical operative note during a specific surgical procedure on a patient, the method comprising:
creating a surgical checklist for a plurality of surgical procedures before initiation of the surgical procedure; creating an index of image specific annotations for the specific surgical procedure before initiation of the surgical procedure; obtaining an electronic template; inserting one of the surgical checklists into the electronic template associated with the specific surgical procedure on the patient; obtaining an image of the patient; inserting the image of the patient into the electronic template; and using a voice command to associate at least one of the image specific annotations with the image of the patient in the electronic template and inserting the at least one of the image specific annotations into the electronic template adjacent the image. 2. The method of creating the surgical operative note of claim 1, further including:
dictating information related to the specific surgical procedure during the specific surgical procedure; transferring the dictated information into free text; and directly inserting the free text into the electronic template at a location in the electronic template spaced from the at least one of the image specific annotations; wherein directly inserting the free text into the electronic template occurs during the specific surgical procedure. 3. The method of creating the surgical operative note of claim 1, further including:
adding a digital signature to the electronic template. 4. The method of creating the surgical operative note of claim 1, further including:
adding at least one billing code to the electronic template corresponding to the specific surgical procedure. 5. The method of creating the surgical operative note of claim 4, wherein:
the at least one billing code is automatically added to the electronic template during the step of inserting the at least one of the image specific annotations into the electronic template adjacent the image. 6. The method of creating the surgical operative note of claim 2, further including:
adding at least one billing code to the electronic template corresponding to the specific surgical procedure, wherein the at least one billing code is automatically added to the electronic template during the step of directly inserting the free text into the electronic template. 7. A method of creating a surgical operative note during a specific surgical procedure on a patient, the method comprising:
creating surgical information before initiation of the surgical procedure; creating an index of image specific annotations for the specific surgical procedure before initiation of the surgical procedure; obtaining an electronic template; inserting the surgical information into the electronic template; obtaining an image of the patient; inserting the image of the patient into the electronic template; using a voice command to associate at least one of the image specific annotations with the image of the patient in the electronic template and inserting the at least one of the image specific annotations into the electronic template adjacent the image; dictating information related to the specific surgical procedure during the specific surgical procedure; transferring the information into free text; and directly inserting the free text into the electronic template at a location in the electronic template spaced from the at least one of the image specific annotations; wherein directly inserting the free text into the electronic template occurs during the specific surgical procedure. 8. The method of creating the surgical operative note of claim 7, further including:
adding a digital signature to the electronic template. 9. The method of creating the surgical operative note of claim 7, wherein:
the surgical information includes at least one of a checklist of steps to take for the specific surgical procedure and a description of the specific surgical procedure. 10. The method of creating the surgical operative note of claim 7, further including:
adding at least one billing code to the electronic template corresponding to the specific surgical procedure. 11. The method of creating the surgical operative note of claim 10, wherein:
the at least one billing code is automatically added to the electronic template during the step of inserting the at least one of the image specific annotations into the electronic template adjacent the image. 12. The method of creating the surgical operative note of claim 10, wherein:
the at least one billing code is automatically added to the electronic template during the step of directly inserting the free text into the electronic template. | A method of creating a surgical operative note during a specific surgical procedure on a patient. The method includes creating surgical checklists for a plurality of surgical procedures before initiation of the surgical procedure, creating an index of image specific annotations for the specific surgical procedure before initiation of the surgical procedure, obtaining an electronic template, inserting one of the surgical checklists into the template associated with the specific surgical procedure on the patient, obtaining an image of the patient, inserting the image of the patient into the electronic template, using a voice command to associate at least one of the image specific annotations with the image of the patient in the electronic template, and inserting the at least one of the image specific annotations into the electronic template adjacent the image.1. A method of creating a surgical operative note during a specific surgical procedure on a patient, the method comprising:
creating a surgical checklist for a plurality of surgical procedures before initiation of the surgical procedure; creating an index of image specific annotations for the specific surgical procedure before initiation of the surgical procedure; obtaining an electronic template; inserting one of the surgical checklists into the electronic template associated with the specific surgical procedure on the patient; obtaining an image of the patient; inserting the image of the patient into the electronic template; and using a voice command to associate at least one of the image specific annotations with the image of the patient in the electronic template and inserting the at least one of the image specific annotations into the electronic template adjacent the image. 2. The method of creating the surgical operative note of claim 1, further including:
dictating information related to the specific surgical procedure during the specific surgical procedure; transferring the dictated information into free text; and directly inserting the free text into the electronic template at a location in the electronic template spaced from the at least one of the image specific annotations; wherein directly inserting the free text into the electronic template occurs during the specific surgical procedure. 3. The method of creating the surgical operative note of claim 1, further including:
adding a digital signature to the electronic template. 4. The method of creating the surgical operative note of claim 1, further including:
adding at least one billing code to the electronic template corresponding to the specific surgical procedure. 5. The method of creating the surgical operative note of claim 4, wherein:
the at least one billing code is automatically added to the electronic template during the step of inserting the at least one of the image specific annotations into the electronic template adjacent the image. 6. The method of creating the surgical operative note of claim 2, further including:
adding at least one billing code to the electronic template corresponding to the specific surgical procedure, wherein the at least one billing code is automatically added to the electronic template during the step of directly inserting the free text into the electronic template. 7. A method of creating a surgical operative note during a specific surgical procedure on a patient, the method comprising:
creating surgical information before initiation of the surgical procedure; creating an index of image specific annotations for the specific surgical procedure before initiation of the surgical procedure; obtaining an electronic template; inserting the surgical information into the electronic template; obtaining an image of the patient; inserting the image of the patient into the electronic template; using a voice command to associate at least one of the image specific annotations with the image of the patient in the electronic template and inserting the at least one of the image specific annotations into the electronic template adjacent the image; dictating information related to the specific surgical procedure during the specific surgical procedure; transferring the information into free text; and directly inserting the free text into the electronic template at a location in the electronic template spaced from the at least one of the image specific annotations; wherein directly inserting the free text into the electronic template occurs during the specific surgical procedure. 8. The method of creating the surgical operative note of claim 7, further including:
adding a digital signature to the electronic template. 9. The method of creating the surgical operative note of claim 7, wherein:
the surgical information includes at least one of a checklist of steps to take for the specific surgical procedure and a description of the specific surgical procedure. 10. The method of creating the surgical operative note of claim 7, further including:
adding at least one billing code to the electronic template corresponding to the specific surgical procedure. 11. The method of creating the surgical operative note of claim 10, wherein:
the at least one billing code is automatically added to the electronic template during the step of inserting the at least one of the image specific annotations into the electronic template adjacent the image. 12. The method of creating the surgical operative note of claim 10, wherein:
the at least one billing code is automatically added to the electronic template during the step of directly inserting the free text into the electronic template. | 2,100 |
4,409 | 13,132,224 | 2,141 | Technologies are generally described for devices, methods, and programs for reducing key input errors. An example device includes a detector to determine characteristics of a detected input and an arbiter to reject the detected input that has characteristics of an input error. | 1. A device, comprising:
a detector to determine characteristics of a detected touch input; and an arbiter to reject the detected touch input that has characteristics of a key input error. 2. The device of claim 1, wherein the characteristics of a key input error include a simultaneous multi-touch input that does not include a touch input of a special function key. 3. The device of claim 1, wherein the characteristics of a key input error include a simultaneous multi-touch input that does not include a touch input of at least one of a “shift” key, a “control” key, an “alt” key, or a “function” key. 4. The device of claim 1, wherein the characteristics of a key input error include a continuous key input for a duration that exceeds a predetermined threshold limit. 5. The device of claim 1, wherein the characteristics of a key input error includes a continuous key input of a non-special function key for a duration that exceeds a predetermined threshold limit. 6. A computer-readable medium that stores one or more executable instructions that, when executed, cause one or more processors to:
receive a designation of a special function input; determine whether a simultaneous multi-touch input includes the special function input; and deny entry of a function or feature corresponding to the simultaneous multi-touch input when the determination is negative. 7. The computer-readable medium of claim 6, wherein the computer-readable medium and the one or more processors are hosted on a client device that is communicatively coupled to a standard keyboard of which the special function input is a key. 8. The computer-readable medium of claim 6, wherein the computer-readable medium and the one or more processors are hosted on a client device that includes a touch keyboard of which the special function input is a key. 9. The computer-readable medium of claim 6,
wherein the computer-readable medium and the one or more processors are hosted on a client device that includes a virtual keyboard, and wherein further the multi-touch input includes a simultaneous input from two or more keys on the virtual keyboard. 10. The computer-readable medium of claim 8, wherein the special function input includes at least one of a “shift” key, a “control” key, an “alt” key, or a “function” key. 11. The computer-readable medium of claim 8, wherein the special function input includes a user-designated combination of keys. 12. The computer-readable medium of claim 6, wherein the computer-readable medium and the one or more processors are hosted on a client device that includes:
a virtual keyboard of which the special function input is a key, and a touch input display. 13. The computer-readable medium of claim 6,
wherein the computer-readable medium and the one or more processors are hosted on a client device that includes a virtual keyboard and a touch input display, and wherein further the multi-touch input includes an input from either of the virtual keyboard and the touch input display simultaneous with at least one other input from either of the virtual keyboard and the touch input display. 14. The computer-readable medium of claim 13, wherein the special function input includes at least one of a “shift” key, a “control” key, an “alt” key, or a “function” key. 15. The computer-readable medium of claim 13, wherein the special function input includes a user-designated combination of touch inputs. 16. A device, comprising:
a key input user interface to receive a key input from a user; a detector to measure time from a detected start of the key input from the user; an arbiter to reject a function corresponding to the key input from the user when an end of the key input has not been detected within a predetermined threshold amount of time. 17. The device of claim 16,
wherein the key input user interface is a virtual keyboard, and wherein further the key input corresponds to physical contact with any key on the virtual keyboard that is not designated as a special function key. 18. The device of claim 16,
wherein the key input user interface is a standard keyboard, and wherein further the key input corresponds to physical contact with any key on the standard keyboard that is not designated as a special function key. 19. The device of claim 17, wherein the special function key may be at least one of the “shift” key, the “control” key, the “alt” key, or the “function” key. 20. A computer-readable medium that stores one or more executable instructions that, when executed, cause one or more processors to:
detect a touch input; time the touch input; and reject the touch input after a predetermined amount of time has elapsed and an end to the touch input has not been detected. 21. The computer-readable medium of claim 20, wherein the special function key may be at least one of the “shift” key, the “control” key, the “alt” key, or the “function” key. | Technologies are generally described for devices, methods, and programs for reducing key input errors. An example device includes a detector to determine characteristics of a detected input and an arbiter to reject the detected input that has characteristics of an input error.1. A device, comprising:
a detector to determine characteristics of a detected touch input; and an arbiter to reject the detected touch input that has characteristics of a key input error. 2. The device of claim 1, wherein the characteristics of a key input error include a simultaneous multi-touch input that does not include a touch input of a special function key. 3. The device of claim 1, wherein the characteristics of a key input error include a simultaneous multi-touch input that does not include a touch input of at least one of a “shift” key, a “control” key, an “alt” key, or a “function” key. 4. The device of claim 1, wherein the characteristics of a key input error include a continuous key input for a duration that exceeds a predetermined threshold limit. 5. The device of claim 1, wherein the characteristics of a key input error includes a continuous key input of a non-special function key for a duration that exceeds a predetermined threshold limit. 6. A computer-readable medium that stores one or more executable instructions that, when executed, cause one or more processors to:
receive a designation of a special function input; determine whether a simultaneous multi-touch input includes the special function input; and deny entry of a function or feature corresponding to the simultaneous multi-touch input when the determination is negative. 7. The computer-readable medium of claim 6, wherein the computer-readable medium and the one or more processors are hosted on a client device that is communicatively coupled to a standard keyboard of which the special function input is a key. 8. The computer-readable medium of claim 6, wherein the computer-readable medium and the one or more processors are hosted on a client device that includes a touch keyboard of which the special function input is a key. 9. The computer-readable medium of claim 6,
wherein the computer-readable medium and the one or more processors are hosted on a client device that includes a virtual keyboard, and wherein further the multi-touch input includes a simultaneous input from two or more keys on the virtual keyboard. 10. The computer-readable medium of claim 8, wherein the special function input includes at least one of a “shift” key, a “control” key, an “alt” key, or a “function” key. 11. The computer-readable medium of claim 8, wherein the special function input includes a user-designated combination of keys. 12. The computer-readable medium of claim 6, wherein the computer-readable medium and the one or more processors are hosted on a client device that includes:
a virtual keyboard of which the special function input is a key, and a touch input display. 13. The computer-readable medium of claim 6,
wherein the computer-readable medium and the one or more processors are hosted on a client device that includes a virtual keyboard and a touch input display, and wherein further the multi-touch input includes an input from either of the virtual keyboard and the touch input display simultaneous with at least one other input from either of the virtual keyboard and the touch input display. 14. The computer-readable medium of claim 13, wherein the special function input includes at least one of a “shift” key, a “control” key, an “alt” key, or a “function” key. 15. The computer-readable medium of claim 13, wherein the special function input includes a user-designated combination of touch inputs. 16. A device, comprising:
a key input user interface to receive a key input from a user; a detector to measure time from a detected start of the key input from the user; an arbiter to reject a function corresponding to the key input from the user when an end of the key input has not been detected within a predetermined threshold amount of time. 17. The device of claim 16,
wherein the key input user interface is a virtual keyboard, and wherein further the key input corresponds to physical contact with any key on the virtual keyboard that is not designated as a special function key. 18. The device of claim 16,
wherein the key input user interface is a standard keyboard, and wherein further the key input corresponds to physical contact with any key on the standard keyboard that is not designated as a special function key. 19. The device of claim 17, wherein the special function key may be at least one of the “shift” key, the “control” key, the “alt” key, or the “function” key. 20. A computer-readable medium that stores one or more executable instructions that, when executed, cause one or more processors to:
detect a touch input; time the touch input; and reject the touch input after a predetermined amount of time has elapsed and an end to the touch input has not been detected. 21. The computer-readable medium of claim 20, wherein the special function key may be at least one of the “shift” key, the “control” key, the “alt” key, or the “function” key. | 2,100 |
4,410 | 14,072,106 | 2,193 | Methods and apparatus, including computer program products, for mobile application development and deployment. A method includes, in a server residing in a network, receiving an application description file from a design system communicatively linked to the server, the application description file capable of targeting multiple application platforms and representing a workflow of an application for user equipment communicatively linked to the server, generating from the received application description file an application envelope comprising at least a subset of the application description file, and sending the application envelope to a client application residing in the user equipment, the client application interpreting contents of the application envelope. | 1. A method comprising:
in a server residing in a network, receiving an application description file from a design system communicatively linked to the server, the application description file capable of targeting multiple application platforms and representing a workflow of an application for user equipment communicatively linked to the server; generating from the received application description file an application envelope comprising at least a subset of the application description file; and sending the application envelope to a client application residing in the user equipment, the client application interpreting contents of the application envelope. 2. The method of claim 1 wherein the application envelope is extended markup language (XML) packed into JavaScript Object Notation (JSON). 3. The method of claim 1 wherein the client application interpreting contents of the application envelope further comprises interacting with a user of the user equipment. 4. The method of claim 1 wherein the application description file includes XPath expressions that enable a developer to dynamically define one or more of data default values, values and data of combo-boxes, styles, chart creations, global variables, validation rules as assertions, control behavior, workflow path choices, database queries, HTTP request parameters and URLs of HTTP requests based on XML data contained in either the workflow document or in external data sources. 5. The method of claim 4 wherein the chart creations comprise data selected, styles applied and an actual iteration over the data. 6. The method of claim 1 wherein a developer specifies that the workflow includes certain persistent variables or Extensible Markup Language (XML) data that is stored on the user equipment persistently across sessions. 7. The method of claim 1 wherein the client application executes the workflow in the user equipment independent of the server when no new XML, chart or image is accessed for a next page and communicates with the server when data is exchanged between the client application and the server. 8. The method of claim 1 wherein the application envelope further comprises one or more of a unique identification (ID) of the workflow, version information about the server and protocol version, data for the application, one or more charts rendered by the server and saved as images, a pointer to a first or next page in the workflow to tell the client application what to do next, status information and a list of available workflows if the client application has requested such a directory from the server. 9. The method of claim 1 further comprising receiving an envelope from the client, the envelope comprising one or more of version information about a protocol version and a client version, a globally unique identifier (GUID), an operating system (OS) version, a manufacturer, a screen resolution, a tablet or smartphone indicator, a username/password, a user language, event information about a last event that happened on the client, data for the application, and request information from client to the server to handle special cases. 10. The method of claim 9 wherein the envelope is encoded in JavaScript Object Notation (JSON). 11. The method of claim 1 wherein data for the application comprises one or more Extensible Markup Language (XML) files containing user input and modifications to the one or more XML files that was originally sent from the server to the client. 12. The method of claim 11 wherein XML elements and attributes in the one or more XML files are temporary. 13. The method of claim 11 wherein the application envelope ensures that XML elements and attributes in the one or more XML files exist. 14. The method of claim 11 wherein one or more XML elements and attributes in the one or more XML files are dynamically calculated. 15. The method of claim 1 wherein receiving the application description file further comprises receiving XML files/images. 16. The method of claim 11 further comprising loading one or more XML Schema Definition (XSD) documents to define a data structure of workflow XML data. 17. The method of claim 1 wherein generating the application envelope comprises removing one or more of username/password information, chart settings, uniform resource locators (URLs) for data sources and FlowForce job settings. 18. The method of claim 1 wherein the application envelope comprises:
interpretedable user interface elements for the targeted application platforms;
interpretedable workflow definitions representing the application in the server and the application platforms; and
user equipment. 19. The method of claim 1 wherein the client application is a mobile application in the user equipment. 20. The method of claim 1 wherein the client application is a HyperText Markup Language (HTML) browser in the user equipment. 21. The method of claim 1 wherein the workflow definitions comprise a group selected from loading and saving of data files, executing workflow jobs on a separate workflow server (FlowForce), branches in the workflow via XPath expressions, event handling within a page and in the workflow between pages), and grouping of pages. 22. The method of claim 1 wherein the targeted application platforms are selected from the group consisting of Android, iOS, RIM, Windows, Linux and Unix. 23. The method of claim 1 wherein the client application residing in the user equipment and the application description file residing in the server comprise layout characteristics of the user equipment. 24. The method of claim 1 wherein the user equipment is selected from the group consisting of a smartphone, a tablet computer, a hybrid smartphone/tablet computer, a personal data assistant (PDA), a netbook computer, a laptop computer, a personal computer a desktop computer, servers, wearable computers, and Google Project Glass. 25. The method of claim 1 wherein the client application and the server execute portions of the workflow. 26. The method of claim 1 wherein the server generates an application file specifically targeted at capabilities of the user equipment reported to the server by the client application. 27. The method of claim 1 wherein the server renders charts and images for the client application in response to the workflow and to events sent from the client application. 28. The method of claim 1 wherein the workflow includes conditional program logic that uses XML Path Language (XPath) to select. 29. The method of claim 1 wherein the server updates databases or further communicates with a workflow server responsive to receiving the envelope from the client application. 30. A method comprising:
in a design system residing in a network, generating an application description file, the application description file capable of targeting multiple application platforms and representing a workflow of an application for user equipment communicatively linked to a server; generating from the application description file an application envelope comprising at least a subset of the application description file; and debugging a design of the application envelope. 31. The method of claim 30 wherein debugging the design of the application envelope comprises:
executing the application envelope in the design system; and
displaying a trace of each of the steps in the workflow, the trace comprising a location of each step in the workflow and page source corresponding to the location. 32. The method of claim 30 wherein debugging the design of the application envelope comprises:
sending the application envelope to the server;
executing the application envelope in the server; and
displaying a trace of each of the steps in the workflow, the trace comprising a location of each step in the workflow and page source corresponding to the location. 33. The method of claim 30 wherein debugging the design of the application envelope comprises:
sending the application envelope to a client application on residing in the user equipment;
executing the client application; and
displaying a trace of each of the steps in the workflow, the trace comprising a location of each step in the workflow and page source corresponding to the location. | Methods and apparatus, including computer program products, for mobile application development and deployment. A method includes, in a server residing in a network, receiving an application description file from a design system communicatively linked to the server, the application description file capable of targeting multiple application platforms and representing a workflow of an application for user equipment communicatively linked to the server, generating from the received application description file an application envelope comprising at least a subset of the application description file, and sending the application envelope to a client application residing in the user equipment, the client application interpreting contents of the application envelope.1. A method comprising:
in a server residing in a network, receiving an application description file from a design system communicatively linked to the server, the application description file capable of targeting multiple application platforms and representing a workflow of an application for user equipment communicatively linked to the server; generating from the received application description file an application envelope comprising at least a subset of the application description file; and sending the application envelope to a client application residing in the user equipment, the client application interpreting contents of the application envelope. 2. The method of claim 1 wherein the application envelope is extended markup language (XML) packed into JavaScript Object Notation (JSON). 3. The method of claim 1 wherein the client application interpreting contents of the application envelope further comprises interacting with a user of the user equipment. 4. The method of claim 1 wherein the application description file includes XPath expressions that enable a developer to dynamically define one or more of data default values, values and data of combo-boxes, styles, chart creations, global variables, validation rules as assertions, control behavior, workflow path choices, database queries, HTTP request parameters and URLs of HTTP requests based on XML data contained in either the workflow document or in external data sources. 5. The method of claim 4 wherein the chart creations comprise data selected, styles applied and an actual iteration over the data. 6. The method of claim 1 wherein a developer specifies that the workflow includes certain persistent variables or Extensible Markup Language (XML) data that is stored on the user equipment persistently across sessions. 7. The method of claim 1 wherein the client application executes the workflow in the user equipment independent of the server when no new XML, chart or image is accessed for a next page and communicates with the server when data is exchanged between the client application and the server. 8. The method of claim 1 wherein the application envelope further comprises one or more of a unique identification (ID) of the workflow, version information about the server and protocol version, data for the application, one or more charts rendered by the server and saved as images, a pointer to a first or next page in the workflow to tell the client application what to do next, status information and a list of available workflows if the client application has requested such a directory from the server. 9. The method of claim 1 further comprising receiving an envelope from the client, the envelope comprising one or more of version information about a protocol version and a client version, a globally unique identifier (GUID), an operating system (OS) version, a manufacturer, a screen resolution, a tablet or smartphone indicator, a username/password, a user language, event information about a last event that happened on the client, data for the application, and request information from client to the server to handle special cases. 10. The method of claim 9 wherein the envelope is encoded in JavaScript Object Notation (JSON). 11. The method of claim 1 wherein data for the application comprises one or more Extensible Markup Language (XML) files containing user input and modifications to the one or more XML files that was originally sent from the server to the client. 12. The method of claim 11 wherein XML elements and attributes in the one or more XML files are temporary. 13. The method of claim 11 wherein the application envelope ensures that XML elements and attributes in the one or more XML files exist. 14. The method of claim 11 wherein one or more XML elements and attributes in the one or more XML files are dynamically calculated. 15. The method of claim 1 wherein receiving the application description file further comprises receiving XML files/images. 16. The method of claim 11 further comprising loading one or more XML Schema Definition (XSD) documents to define a data structure of workflow XML data. 17. The method of claim 1 wherein generating the application envelope comprises removing one or more of username/password information, chart settings, uniform resource locators (URLs) for data sources and FlowForce job settings. 18. The method of claim 1 wherein the application envelope comprises:
interpretedable user interface elements for the targeted application platforms;
interpretedable workflow definitions representing the application in the server and the application platforms; and
user equipment. 19. The method of claim 1 wherein the client application is a mobile application in the user equipment. 20. The method of claim 1 wherein the client application is a HyperText Markup Language (HTML) browser in the user equipment. 21. The method of claim 1 wherein the workflow definitions comprise a group selected from loading and saving of data files, executing workflow jobs on a separate workflow server (FlowForce), branches in the workflow via XPath expressions, event handling within a page and in the workflow between pages), and grouping of pages. 22. The method of claim 1 wherein the targeted application platforms are selected from the group consisting of Android, iOS, RIM, Windows, Linux and Unix. 23. The method of claim 1 wherein the client application residing in the user equipment and the application description file residing in the server comprise layout characteristics of the user equipment. 24. The method of claim 1 wherein the user equipment is selected from the group consisting of a smartphone, a tablet computer, a hybrid smartphone/tablet computer, a personal data assistant (PDA), a netbook computer, a laptop computer, a personal computer a desktop computer, servers, wearable computers, and Google Project Glass. 25. The method of claim 1 wherein the client application and the server execute portions of the workflow. 26. The method of claim 1 wherein the server generates an application file specifically targeted at capabilities of the user equipment reported to the server by the client application. 27. The method of claim 1 wherein the server renders charts and images for the client application in response to the workflow and to events sent from the client application. 28. The method of claim 1 wherein the workflow includes conditional program logic that uses XML Path Language (XPath) to select. 29. The method of claim 1 wherein the server updates databases or further communicates with a workflow server responsive to receiving the envelope from the client application. 30. A method comprising:
in a design system residing in a network, generating an application description file, the application description file capable of targeting multiple application platforms and representing a workflow of an application for user equipment communicatively linked to a server; generating from the application description file an application envelope comprising at least a subset of the application description file; and debugging a design of the application envelope. 31. The method of claim 30 wherein debugging the design of the application envelope comprises:
executing the application envelope in the design system; and
displaying a trace of each of the steps in the workflow, the trace comprising a location of each step in the workflow and page source corresponding to the location. 32. The method of claim 30 wherein debugging the design of the application envelope comprises:
sending the application envelope to the server;
executing the application envelope in the server; and
displaying a trace of each of the steps in the workflow, the trace comprising a location of each step in the workflow and page source corresponding to the location. 33. The method of claim 30 wherein debugging the design of the application envelope comprises:
sending the application envelope to a client application on residing in the user equipment;
executing the client application; and
displaying a trace of each of the steps in the workflow, the trace comprising a location of each step in the workflow and page source corresponding to the location. | 2,100 |
4,411 | 13,229,554 | 2,179 | A content user experience is described. In one or more implementations, a user interface is displayed that has selectable representations of content sources, at least one of which is available via a network. Responsive to selection of one or more of the content sources via the user interface, representations of content are displayed in the user interface using metadata obtained from the selected one or more content sources, the representations arranged according to a hierarchy used at a respective content source to arrange access to the content. Responsive to selection of one or more of the representations via the user interface; the content is obtained that corresponds to the selected representations and the obtained content is displayed in the user interface. | 1. A method implemented by a computing device, the method comprising:
displaying a user interface having selectable representations of content sources, at least one of which is available via a network; responsive to selection of one or more of the content sources via the user interface, displaying representations of content in the user interface using metadata obtained from the selected one or more content sources, the representations arranged according to a hierarchy used at a respective said content source to arrange access to the content; responsive to selection of one or more of the representations via the user interface; obtaining the content that corresponds to the selected representations; and displaying the obtained content in the user interface. 2. A method as described in claim 1, wherein the displaying of the representations is performed to populate the user interface with representations obtained from the content source in response to navigation through the user interface. 3. A method as described in claim 1, wherein at least one of the content sources is configured as storage that is local to the computing device. 4. A method as described in claim 1, wherein at least one of the content sources is a social network service. 5. A method as described in claim 1, wherein the metadata is obtained from a network service via a user account by using credentials of a user. 6. A method as described in claim 1, wherein the content sources involve either a device or a user account associated with a single user. 7. A method as described in claim 1, wherein the user interface involved in the displaying of the representations includes functionality to search the metadata to locate a particular item of the content without obtaining the item of content at the computing device. 8. A method as described in claim 1, wherein the representations are obtained from a plurality of content sources to provide an aggregated view of the content. 9. A method as described in claim 1, wherein the displaying of the representations provides a first view and further comprising responsive to receipt of an input to switch from the first view to a second view, obtaining additional metadata to represent the content. 10. A method as described in claim 9, wherein the representations in the first view are configured as thumbnails and representations in the second view are configured as larger representations of the content than the thumbnails. 11. A method implemented by one or more computing devices, the method comprising:
obtaining metadata, from a plurality of content sources, that describes content and how content is arranged in a hierarchy at a respective said content source; constructing an aggregate view of the plurality of content using the metadata as corresponding to the hierarchies at the respective said content sources; and displaying the aggregate view in a user interface as having representations of the plurality of content accessible via the hierarchies, at least one said representation being selectable to cause corresponding said content to be retrieved via a network connection from a corresponding said source. 12. A method as described in claim 11, wherein the obtaining and constructing is performed dynamically responsive to navigation through the aggregate view. 13. A method as described in claim 11, wherein at least one of the content sources is configured as storage that is local to the computing device and another one of the content sources is accessible via the network connection using credentials of a user. 14. A method as described in claim 13, wherein the other one of the content sources is a social network service. 15. A method as described in claim 13, wherein the user interface includes functionality to search the metadata to locate a particular item of the content without obtaining the item of content at the computing device. 16. A method as described in claim 11, wherein the obtaining is performed to cache the metadata locally at the one or more computing devices to support offline access. 17. A method implemented by one or more computing devices, the method comprising:
displaying representations of images or videos in a user interface formed from metadata obtained from a plurality of content sources in which at least one said content source is local to the computing device and another said content source is accessible remotely to the computing device via a network; indicating which of the representations are of images or videos that have been duplicated in the plurality of content sources; and outputting one or more options to address the duplication of the images or videos. 18. A method as described in claim 17, wherein the user interface includes functionality to search the metadata to locate a particular item of the content without obtaining the item of content at the computing device. 19. A method as described in claim 17, wherein the displaying, the indicating, and the outputting are performed by the one or more computing devices without downloading the content itself. 20. A method as described in claim 17, wherein the displaying is performed using metadata obtained dynamically responsive to navigate through the user interface populate the user interface. | A content user experience is described. In one or more implementations, a user interface is displayed that has selectable representations of content sources, at least one of which is available via a network. Responsive to selection of one or more of the content sources via the user interface, representations of content are displayed in the user interface using metadata obtained from the selected one or more content sources, the representations arranged according to a hierarchy used at a respective content source to arrange access to the content. Responsive to selection of one or more of the representations via the user interface; the content is obtained that corresponds to the selected representations and the obtained content is displayed in the user interface.1. A method implemented by a computing device, the method comprising:
displaying a user interface having selectable representations of content sources, at least one of which is available via a network; responsive to selection of one or more of the content sources via the user interface, displaying representations of content in the user interface using metadata obtained from the selected one or more content sources, the representations arranged according to a hierarchy used at a respective said content source to arrange access to the content; responsive to selection of one or more of the representations via the user interface; obtaining the content that corresponds to the selected representations; and displaying the obtained content in the user interface. 2. A method as described in claim 1, wherein the displaying of the representations is performed to populate the user interface with representations obtained from the content source in response to navigation through the user interface. 3. A method as described in claim 1, wherein at least one of the content sources is configured as storage that is local to the computing device. 4. A method as described in claim 1, wherein at least one of the content sources is a social network service. 5. A method as described in claim 1, wherein the metadata is obtained from a network service via a user account by using credentials of a user. 6. A method as described in claim 1, wherein the content sources involve either a device or a user account associated with a single user. 7. A method as described in claim 1, wherein the user interface involved in the displaying of the representations includes functionality to search the metadata to locate a particular item of the content without obtaining the item of content at the computing device. 8. A method as described in claim 1, wherein the representations are obtained from a plurality of content sources to provide an aggregated view of the content. 9. A method as described in claim 1, wherein the displaying of the representations provides a first view and further comprising responsive to receipt of an input to switch from the first view to a second view, obtaining additional metadata to represent the content. 10. A method as described in claim 9, wherein the representations in the first view are configured as thumbnails and representations in the second view are configured as larger representations of the content than the thumbnails. 11. A method implemented by one or more computing devices, the method comprising:
obtaining metadata, from a plurality of content sources, that describes content and how content is arranged in a hierarchy at a respective said content source; constructing an aggregate view of the plurality of content using the metadata as corresponding to the hierarchies at the respective said content sources; and displaying the aggregate view in a user interface as having representations of the plurality of content accessible via the hierarchies, at least one said representation being selectable to cause corresponding said content to be retrieved via a network connection from a corresponding said source. 12. A method as described in claim 11, wherein the obtaining and constructing is performed dynamically responsive to navigation through the aggregate view. 13. A method as described in claim 11, wherein at least one of the content sources is configured as storage that is local to the computing device and another one of the content sources is accessible via the network connection using credentials of a user. 14. A method as described in claim 13, wherein the other one of the content sources is a social network service. 15. A method as described in claim 13, wherein the user interface includes functionality to search the metadata to locate a particular item of the content without obtaining the item of content at the computing device. 16. A method as described in claim 11, wherein the obtaining is performed to cache the metadata locally at the one or more computing devices to support offline access. 17. A method implemented by one or more computing devices, the method comprising:
displaying representations of images or videos in a user interface formed from metadata obtained from a plurality of content sources in which at least one said content source is local to the computing device and another said content source is accessible remotely to the computing device via a network; indicating which of the representations are of images or videos that have been duplicated in the plurality of content sources; and outputting one or more options to address the duplication of the images or videos. 18. A method as described in claim 17, wherein the user interface includes functionality to search the metadata to locate a particular item of the content without obtaining the item of content at the computing device. 19. A method as described in claim 17, wherein the displaying, the indicating, and the outputting are performed by the one or more computing devices without downloading the content itself. 20. A method as described in claim 17, wherein the displaying is performed using metadata obtained dynamically responsive to navigate through the user interface populate the user interface. | 2,100 |
4,412 | 14,739,996 | 2,135 | A redundant storage system which can automatically recover RAID data by crossing different JBODs includes: at least one server, at least one SAS switch, and at least two storage devices; each of the at least one server includes an interface card, and each of the at least one server is connected to the at least one SAS switch through a SAS port of the interface card; each of the at least two storage devices is connected to the at least one SAS switch through a SAS interface; each of the at least two storage devices includes at least one physical disk; physical disks respectively included in different storage devices constitute a RAID group. | 1. A redundant storage system, comprising:
at least one server, at least one SAS switch, and at least two storage devices; wherein each of the at least one server comprises an interface card; each of the at least one server is connected to the at least one SAS switch through a SAS port of the interface card; each of the at least two storage devices is connected to the at least one SAS switch through a SAS interface; each of the at least two storage devices comprises at least one physical disk; physical disks respectively included in different storage devices constitute a RAID group. 2. The system of claim 1, wherein the at least one SAS switch comprises 2 SAS switches; each interface card comprises 2 SAS ports. 3. The system of claim 1, wherein the at least one server comprises 4 servers; the at least two storage devices comprise 8 storage devices;
wherein the RAID group is constituted of 8 physical disks respectively included in different 8 storage devices. 4. The system of claim 1, wherein the at least two storage devices are JBODs. 5. The system of claim 1, wherein the interface card is a RAID card or a HBA card. | A redundant storage system which can automatically recover RAID data by crossing different JBODs includes: at least one server, at least one SAS switch, and at least two storage devices; each of the at least one server includes an interface card, and each of the at least one server is connected to the at least one SAS switch through a SAS port of the interface card; each of the at least two storage devices is connected to the at least one SAS switch through a SAS interface; each of the at least two storage devices includes at least one physical disk; physical disks respectively included in different storage devices constitute a RAID group.1. A redundant storage system, comprising:
at least one server, at least one SAS switch, and at least two storage devices; wherein each of the at least one server comprises an interface card; each of the at least one server is connected to the at least one SAS switch through a SAS port of the interface card; each of the at least two storage devices is connected to the at least one SAS switch through a SAS interface; each of the at least two storage devices comprises at least one physical disk; physical disks respectively included in different storage devices constitute a RAID group. 2. The system of claim 1, wherein the at least one SAS switch comprises 2 SAS switches; each interface card comprises 2 SAS ports. 3. The system of claim 1, wherein the at least one server comprises 4 servers; the at least two storage devices comprise 8 storage devices;
wherein the RAID group is constituted of 8 physical disks respectively included in different 8 storage devices. 4. The system of claim 1, wherein the at least two storage devices are JBODs. 5. The system of claim 1, wherein the interface card is a RAID card or a HBA card. | 2,100 |
4,413 | 14,722,809 | 2,112 | Example apparatus and methods control whether and when hybrid rateless Reed Solomon (RS) error correcting codes (ECC) for a message are produced, stored, and distributed. The control may be based on a property (e.g., reliability, error state, speed) of a message recipient. Example apparatus and methods may also control whether and when fountain codes for the message are produced, stored, and distributed. Once again, the control may be based on a property of a message or ECC recipient. Both the hybrid rateless RS ECC and the fountain codes may be produced from data stored in a modified RS matrix. The modified RS matrix may store row-centric error detection codes (EDC) instead of conventional cyclic redundancy check (CRC) characters. The modified RS matrix may store column-centric ECC that may be produced serially. Different types or numbers of ECC may be produced, stored, and provided for different messages stored at different recipients. | 1. A method, comprising:
accessing first electronic data that describes a data storage device to which a message has been provided, where the first electronic data is not provided by the data storage device, where the message was provided from a hybrid Reed Solomon data structure stored in an electronic data storage, where the hybrid Reed Solomon data structure includes plaintext data arranged in two or more dimensions and a set of error detection codes associated with a first dimension of the plaintext data; selecting a number of error correcting codes to produce for the message based, at least in part, on the first electronic data; producing the number of error correcting codes for the message from data stored in the hybrid Reed Solomon data structure, storing the number of error correcting codes in the hybrid Reed Solomon data structure as part of a set of error correcting codes associated with a second, different dimension of the plaintext data, and selectively providing one or more of the number of error correcting codes to one or more error correcting code receivers. 2. The method of claim 1, where the first electronic data describes whether the message provided to the data storage device was stored error free by the data storage device. 3. The method of claim 1, where the first electronic data describes a reliability of the data storage device from the point of view of the method. 4. The method of claim 3, where the number of error correcting codes varies inversely with the reliability of the data storage device. 5. The method of claim 1, comprising:
selecting a type of error correcting code to produce based, at least in part, on the first electronic data. 6. The method of claim 5, where the type of error correcting code is described by an A/B policy, where B describes the total number of error correcting code symbols that can be produced for the message and A describes the minimum number of the B error correcting code symbols that are required to recreate the message for which the error correcting code symbols were produced, A and B being numbers. 7. The method of claim 1, where the first dimension is orthogonal to the second dimension, and where a member of the set of error correcting codes is a product of a selected portion of the plaintext data in the dimension orthogonal to the error correcting code dimension. 8. The method of claim 1, where the first dimension is orthogonal to the second dimension, and where a member of the set of error correcting codes is a product of a selected portion of the plaintext data in the dimension parallel to the error correcting code dimension. 9. The method of claim 1, where an ith member of the set of error correcting codes can be constructed as a function of an ith−1 member of the set of error correcting codes, i being an integer. 10. The method of claim 1, comprising selecting a number of hybrid error correcting codes (HECC) to produce based, at least in part, on the first electronic data. 11. The method of claim 10, where the number of HECCs varies inversely with the reliability of the data storage device from the point of view of the method. 12. The method of claim 10, comprising:
selectively producing the number of HECCS from data stored in the hybrid Reed Solomon data structure, and selectively providing one or more of the number of HECCs to one or more HECC receivers. 13. The method of claim 10, comprising selecting a type of HECC to produce based, at least in part, on the first electronic data. 14. The method of claim 13, where the type of HECC controls whether the HECC is produced from plaintext in the hybrid Reed Solomon data structure or an error detection code (EDC) in the hybrid Reed Solomon data structure or an error correction code (ECC) in the hybrid Reed Solomon data structure. 15. The method of claim 13, where the type of HECC is described by a C/D policy, where D describes the total number of HECC symbols that can be produced for the message and C describes the minimum number of the D HECC symbols that are required to recreate the message for which the HECC symbols were produced, C and D being numbers. 16. The method of claim 1, comprising selecting an error correcting code receiver based, at least in part, on a property of the error correcting code receiver. 17. The method of claim 10, comprising selecting a hybrid error correcting code receiver based, at least in part, on a property of the hybrid error correcting code receiver. 18. The method of claim 13, where the HECC is a 100% efficient fountain code. 19. An apparatus, comprising:
a processor; a memory that stores a modified Reed Solomon matrix having row-centric error detection codes and column-centric error correcting codes; a set of logics; and an interface that connects the processor, the memory, and the set of logics; the set of logics comprising:
a first logic that identifies a non-empty set of Reed Solomon error correction codes to produce for a message, where the message is stored in the modified Reed Solomon matrix, and where the message has been provided to a recipient;
a second logic that produces the set of Reed Solomon error correction codes from data in the modified Reed Solomon matrix, where the second logic produces the set of Reed Solomon error correction codes after the message has been provided to the recipient, and
a third logic that selectively distributes a member of the set of Reed Solomon error correction codes to a data store involved in storing the message for the recipient, where the third logic distributes the member after the message has been provided to the recipient. 20. The apparatus of claim 19, where the size of the set of Reed Solomon error correction codes is based, at least in part, on a property of the data store. 21. The apparatus of claim 19, comprising a fourth logic that:
identifies a non-empty set of fountain codes to produce for the message; produces the set of fountain codes for the message using data in the modified Reed Solomon matrix, and selectively distributes a member of the set of fountain codes to a data store involved in storing the message for the recipient. 22. The apparatus of claim 20, where the size of the set of fountain codes is based, at least in part, on a property of the data store. 23. A computerized method, comprising:
controlling how many hybrid rateless Reed Solomon error correcting codes for a message are produced by a computer that stores the message in a modified Reed Solomon generator matrix, where the hybrid rateless Reed Solomon error correcting codes are produced using the modified Reed Solomon generator matrix, and controlling the time at which the computer produces the hybrid rateless Reed Solomon error correcting codes. 24. The computerized method of claim 23, where the controlling is based, at least in part, on the correctness of the message as stored in an electronic data store. 25. The computerized method of claim 23, where the controlling is based, at least in part, on the likelihood of an error affecting the message as stored in an electronic data store. | Example apparatus and methods control whether and when hybrid rateless Reed Solomon (RS) error correcting codes (ECC) for a message are produced, stored, and distributed. The control may be based on a property (e.g., reliability, error state, speed) of a message recipient. Example apparatus and methods may also control whether and when fountain codes for the message are produced, stored, and distributed. Once again, the control may be based on a property of a message or ECC recipient. Both the hybrid rateless RS ECC and the fountain codes may be produced from data stored in a modified RS matrix. The modified RS matrix may store row-centric error detection codes (EDC) instead of conventional cyclic redundancy check (CRC) characters. The modified RS matrix may store column-centric ECC that may be produced serially. Different types or numbers of ECC may be produced, stored, and provided for different messages stored at different recipients.1. A method, comprising:
accessing first electronic data that describes a data storage device to which a message has been provided, where the first electronic data is not provided by the data storage device, where the message was provided from a hybrid Reed Solomon data structure stored in an electronic data storage, where the hybrid Reed Solomon data structure includes plaintext data arranged in two or more dimensions and a set of error detection codes associated with a first dimension of the plaintext data; selecting a number of error correcting codes to produce for the message based, at least in part, on the first electronic data; producing the number of error correcting codes for the message from data stored in the hybrid Reed Solomon data structure, storing the number of error correcting codes in the hybrid Reed Solomon data structure as part of a set of error correcting codes associated with a second, different dimension of the plaintext data, and selectively providing one or more of the number of error correcting codes to one or more error correcting code receivers. 2. The method of claim 1, where the first electronic data describes whether the message provided to the data storage device was stored error free by the data storage device. 3. The method of claim 1, where the first electronic data describes a reliability of the data storage device from the point of view of the method. 4. The method of claim 3, where the number of error correcting codes varies inversely with the reliability of the data storage device. 5. The method of claim 1, comprising:
selecting a type of error correcting code to produce based, at least in part, on the first electronic data. 6. The method of claim 5, where the type of error correcting code is described by an A/B policy, where B describes the total number of error correcting code symbols that can be produced for the message and A describes the minimum number of the B error correcting code symbols that are required to recreate the message for which the error correcting code symbols were produced, A and B being numbers. 7. The method of claim 1, where the first dimension is orthogonal to the second dimension, and where a member of the set of error correcting codes is a product of a selected portion of the plaintext data in the dimension orthogonal to the error correcting code dimension. 8. The method of claim 1, where the first dimension is orthogonal to the second dimension, and where a member of the set of error correcting codes is a product of a selected portion of the plaintext data in the dimension parallel to the error correcting code dimension. 9. The method of claim 1, where an ith member of the set of error correcting codes can be constructed as a function of an ith−1 member of the set of error correcting codes, i being an integer. 10. The method of claim 1, comprising selecting a number of hybrid error correcting codes (HECC) to produce based, at least in part, on the first electronic data. 11. The method of claim 10, where the number of HECCs varies inversely with the reliability of the data storage device from the point of view of the method. 12. The method of claim 10, comprising:
selectively producing the number of HECCS from data stored in the hybrid Reed Solomon data structure, and selectively providing one or more of the number of HECCs to one or more HECC receivers. 13. The method of claim 10, comprising selecting a type of HECC to produce based, at least in part, on the first electronic data. 14. The method of claim 13, where the type of HECC controls whether the HECC is produced from plaintext in the hybrid Reed Solomon data structure or an error detection code (EDC) in the hybrid Reed Solomon data structure or an error correction code (ECC) in the hybrid Reed Solomon data structure. 15. The method of claim 13, where the type of HECC is described by a C/D policy, where D describes the total number of HECC symbols that can be produced for the message and C describes the minimum number of the D HECC symbols that are required to recreate the message for which the HECC symbols were produced, C and D being numbers. 16. The method of claim 1, comprising selecting an error correcting code receiver based, at least in part, on a property of the error correcting code receiver. 17. The method of claim 10, comprising selecting a hybrid error correcting code receiver based, at least in part, on a property of the hybrid error correcting code receiver. 18. The method of claim 13, where the HECC is a 100% efficient fountain code. 19. An apparatus, comprising:
a processor; a memory that stores a modified Reed Solomon matrix having row-centric error detection codes and column-centric error correcting codes; a set of logics; and an interface that connects the processor, the memory, and the set of logics; the set of logics comprising:
a first logic that identifies a non-empty set of Reed Solomon error correction codes to produce for a message, where the message is stored in the modified Reed Solomon matrix, and where the message has been provided to a recipient;
a second logic that produces the set of Reed Solomon error correction codes from data in the modified Reed Solomon matrix, where the second logic produces the set of Reed Solomon error correction codes after the message has been provided to the recipient, and
a third logic that selectively distributes a member of the set of Reed Solomon error correction codes to a data store involved in storing the message for the recipient, where the third logic distributes the member after the message has been provided to the recipient. 20. The apparatus of claim 19, where the size of the set of Reed Solomon error correction codes is based, at least in part, on a property of the data store. 21. The apparatus of claim 19, comprising a fourth logic that:
identifies a non-empty set of fountain codes to produce for the message; produces the set of fountain codes for the message using data in the modified Reed Solomon matrix, and selectively distributes a member of the set of fountain codes to a data store involved in storing the message for the recipient. 22. The apparatus of claim 20, where the size of the set of fountain codes is based, at least in part, on a property of the data store. 23. A computerized method, comprising:
controlling how many hybrid rateless Reed Solomon error correcting codes for a message are produced by a computer that stores the message in a modified Reed Solomon generator matrix, where the hybrid rateless Reed Solomon error correcting codes are produced using the modified Reed Solomon generator matrix, and controlling the time at which the computer produces the hybrid rateless Reed Solomon error correcting codes. 24. The computerized method of claim 23, where the controlling is based, at least in part, on the correctness of the message as stored in an electronic data store. 25. The computerized method of claim 23, where the controlling is based, at least in part, on the likelihood of an error affecting the message as stored in an electronic data store. | 2,100 |
4,414 | 15,005,344 | 2,163 | Techniques are described for selecting, based on a data visualization intent specification and a defined set of data fields associated with a set of data, two or more Meta templates that meet the data visualization intent specification and that support the set of data fields, for determining chart parts that can be used within the selected Meta templates to form chart templates and for determining, based on a set of combination rules and the specification, the chart templates that meet the data visualization intent specification. | 1. A method, comprising:
retrieving, with one or more processing devices, a data visualization intent specification, the data visualization intent specification including one or more data visualization intent specification entries, each data visualization intent specification entry including an intent type and two or more of data fields selected from a defined set of two or more data fields, wherein the intent type defines a type of data visualization desired between data from the selected two or more data fields; selecting, with the one or more processing devices, based on the intent type of the data visualization intent specification, Meta templates that meet the intent type of the data visualization intent specification; determining, with the one or more processing devices and for each selected Meta template, chart parts to be assigned to each of the selected Meta templates, the combination of each selected Meta template with the chart parts assigned to that selected Meta template forming a chart template associated with that selected Meta template; and selecting, with the one or more processing devices and based on a set of combination rules and on the data visualization intent specification, one or more of the chart templates associated with the selected Meta templates. 2. The method of claim 1, wherein each Meta template includes a plurality of template fields and a layout mode, wherein the plurality of template fields includes a plurality of chart part type fields, wherein each of the chart parts includes restrictions limiting the chart parts to certain chart part type fields and wherein the layout mode defines how the chart parts associated with the chart part type fields are laid out in a data visualization corresponding to the selected Meta template. 3. The method of claim 2, wherein the layout mode defines, for each template field, a relationship between the template field and a layout model. 4. The method of claim 1, wherein one or more of the Meta templates is a complex Meta template, wherein each complex Meta template includes one or more Meta templates and a layout mode defining positioning of the included one or more Meta templates. 5. The method of claim 4, wherein the complex Meta templates define combinations of two or more charts associated with the data set. 6. The method of claim 1, wherein one or more of the Meta templates is a complex Meta template, wherein each complex Meta template includes one or more template fields, one or more Meta templates and a layout mode defining positioning of the included one or more template fields and the included one or more Meta templates. 7. The method of claim 1, wherein determining chart parts that can be used with the selected Meta templates includes defining a knowledge base of chart parts that can be used with the Meta templates to produce defined chart templates. 8. The method of claim 7, wherein each chart part includes a definition of types of data to which it can be applied. 9. The method of claim 8, wherein each chart part includes limitations on the Meta templates with which the chart part can be used. 10. The method of claim 1, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem. 11. The method of claim 1, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem and wherein selecting chart templates includes generating a fitness score based on the selected chart parts and the set of scoring rules. 12. The method of claim 1, wherein determining chart parts that can be used with the selected Meta templates includes defining a knowledge base of chart parts that can be used with each of the Meta templates to produce chart templates,
wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem, and wherein selecting chart templates includes generating a fitness score based on the selected chart parts and the set of scoring rules. 13. A computer program product comprising a computer-readable storage medium having program code embodied therewith, the program code executable by a computing device to:
retrieve a data visualization intent specification, the data visualization intent specification including one or more data visualization intent specification entries, each data visualization intent specification entry including an intent type and two or more of data fields selected from a defined set of two or more data fields, wherein the intent type defines a type of data visualization desired between data from the selected two or more data fields; select, based on the intent type of the data visualization intent specification, Meta templates that meet the intent type of the data visualization intent specification and; determine, for each selected Meta template, chart parts to be assigned to each of the selected Meta templates, the combination of each selected Meta template with the chart parts assigned to that selected Meta template forming a chart template associated with that selected Meta template; and select, based on a set of combination rules and the data visualization intent specification, one or more of the chart templates associated with the selected Meta templates. 14. The computer program product of claim 13, wherein each Meta template includes a a plurality of template fields and a layout mode, wherein the plurality of template fields includes a plurality of chart part type fields, wherein each chart part includes restrictions limiting the chart parts to certain chart part type fields, and wherein the layout mode defines, for each template field, a relationship between the template field and a layout model. 15. The computer program product of claim 13, wherein one or more of the Meta templates is a complex Meta template, wherein each complex Meta template includes one or more Meta templates and a layout mode defining positioning of the included one or more Meta templates and wherein the complex Meta templates define combinations of two or more charts associated with the data set. 16. The computer program product of claim 13, wherein the program code for determining chart parts includes program code executable by a computing device to:
retrieve chart part information for selected chart parts from a knowledge base of chart parts, wherein the chart part information includes a definition of types of data to which the chart part can be applied and the Meta templates with which the chart part can be used; and identify candidate chart templates based on the selected Meta templates and their associated chart parts. 17. The computer program product of claim 13, wherein the program code for determining chart parts includes program code executable by a computing device to:
define a knowledge base of chart parts that can be used with each of the Meta templates to produce chart templates, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem, and wherein the program code for selecting chart templates includes program code executable by a computing device to generate a fitness score based on the selected chart parts and the set of scoring rules and to display data from the data set in the chart template associated with the highest fitness score. 18. A computer system comprising:
one or more processors, one or more computer-readable memories, and one or more computer-readable storage mediums; program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to retrieve a data visualization intent specification, the data visualization intent specification including one or more data visualization intent specification entries, each data visualization intent specification entry including an intent type and two or more of data fields selected from a defined set of two or more data fields, wherein the intent type defines a type of data visualization desired between data from the selected two or more data fields; program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to select, based on the intent type of the data visualization intent specification, Meta templates that meet the intent type of the data visualization intent specification; program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to determine, for each selected Meta template, chart parts to be assigned to each of the selected Meta templates, the combination of each selected Meta template with the chart parts assigned to that selected Meta template forming a chart template associated with that selected Meta template; and program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to select, based on a set of combination rules and the data visualization intent specification, one or more of the chart templates associated with the selected Meta templates. 19. The computer system of claim 18, wherein the program instructions for determining chart parts includes:
program instructions to retrieve chart part information for selected chart parts from a knowledge base of chart parts, wherein the chart part information includes a definition of types of data to which the chart part can be applied and the Meta templates with which the chart part can be used; and program instructions to identify candidate chart templates based on the selected Meta templates and their associated chart parts. 20. The computer system of claim 18, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem,
wherein the program instructions for determining chart parts include program instructions to define a knowledge base of chart parts that can be used with each of the Meta templates to produce chart templates, and wherein the program instructions for selecting chart templates includes:
program instructions to generate a fitness score based on the selected chart parts and the set of scoring rules; and
program instructions to display data from the data set in the chart template associated with the highest fitness score. | Techniques are described for selecting, based on a data visualization intent specification and a defined set of data fields associated with a set of data, two or more Meta templates that meet the data visualization intent specification and that support the set of data fields, for determining chart parts that can be used within the selected Meta templates to form chart templates and for determining, based on a set of combination rules and the specification, the chart templates that meet the data visualization intent specification.1. A method, comprising:
retrieving, with one or more processing devices, a data visualization intent specification, the data visualization intent specification including one or more data visualization intent specification entries, each data visualization intent specification entry including an intent type and two or more of data fields selected from a defined set of two or more data fields, wherein the intent type defines a type of data visualization desired between data from the selected two or more data fields; selecting, with the one or more processing devices, based on the intent type of the data visualization intent specification, Meta templates that meet the intent type of the data visualization intent specification; determining, with the one or more processing devices and for each selected Meta template, chart parts to be assigned to each of the selected Meta templates, the combination of each selected Meta template with the chart parts assigned to that selected Meta template forming a chart template associated with that selected Meta template; and selecting, with the one or more processing devices and based on a set of combination rules and on the data visualization intent specification, one or more of the chart templates associated with the selected Meta templates. 2. The method of claim 1, wherein each Meta template includes a plurality of template fields and a layout mode, wherein the plurality of template fields includes a plurality of chart part type fields, wherein each of the chart parts includes restrictions limiting the chart parts to certain chart part type fields and wherein the layout mode defines how the chart parts associated with the chart part type fields are laid out in a data visualization corresponding to the selected Meta template. 3. The method of claim 2, wherein the layout mode defines, for each template field, a relationship between the template field and a layout model. 4. The method of claim 1, wherein one or more of the Meta templates is a complex Meta template, wherein each complex Meta template includes one or more Meta templates and a layout mode defining positioning of the included one or more Meta templates. 5. The method of claim 4, wherein the complex Meta templates define combinations of two or more charts associated with the data set. 6. The method of claim 1, wherein one or more of the Meta templates is a complex Meta template, wherein each complex Meta template includes one or more template fields, one or more Meta templates and a layout mode defining positioning of the included one or more template fields and the included one or more Meta templates. 7. The method of claim 1, wherein determining chart parts that can be used with the selected Meta templates includes defining a knowledge base of chart parts that can be used with the Meta templates to produce defined chart templates. 8. The method of claim 7, wherein each chart part includes a definition of types of data to which it can be applied. 9. The method of claim 8, wherein each chart part includes limitations on the Meta templates with which the chart part can be used. 10. The method of claim 1, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem. 11. The method of claim 1, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem and wherein selecting chart templates includes generating a fitness score based on the selected chart parts and the set of scoring rules. 12. The method of claim 1, wherein determining chart parts that can be used with the selected Meta templates includes defining a knowledge base of chart parts that can be used with each of the Meta templates to produce chart templates,
wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem, and wherein selecting chart templates includes generating a fitness score based on the selected chart parts and the set of scoring rules. 13. A computer program product comprising a computer-readable storage medium having program code embodied therewith, the program code executable by a computing device to:
retrieve a data visualization intent specification, the data visualization intent specification including one or more data visualization intent specification entries, each data visualization intent specification entry including an intent type and two or more of data fields selected from a defined set of two or more data fields, wherein the intent type defines a type of data visualization desired between data from the selected two or more data fields; select, based on the intent type of the data visualization intent specification, Meta templates that meet the intent type of the data visualization intent specification and; determine, for each selected Meta template, chart parts to be assigned to each of the selected Meta templates, the combination of each selected Meta template with the chart parts assigned to that selected Meta template forming a chart template associated with that selected Meta template; and select, based on a set of combination rules and the data visualization intent specification, one or more of the chart templates associated with the selected Meta templates. 14. The computer program product of claim 13, wherein each Meta template includes a a plurality of template fields and a layout mode, wherein the plurality of template fields includes a plurality of chart part type fields, wherein each chart part includes restrictions limiting the chart parts to certain chart part type fields, and wherein the layout mode defines, for each template field, a relationship between the template field and a layout model. 15. The computer program product of claim 13, wherein one or more of the Meta templates is a complex Meta template, wherein each complex Meta template includes one or more Meta templates and a layout mode defining positioning of the included one or more Meta templates and wherein the complex Meta templates define combinations of two or more charts associated with the data set. 16. The computer program product of claim 13, wherein the program code for determining chart parts includes program code executable by a computing device to:
retrieve chart part information for selected chart parts from a knowledge base of chart parts, wherein the chart part information includes a definition of types of data to which the chart part can be applied and the Meta templates with which the chart part can be used; and identify candidate chart templates based on the selected Meta templates and their associated chart parts. 17. The computer program product of claim 13, wherein the program code for determining chart parts includes program code executable by a computing device to:
define a knowledge base of chart parts that can be used with each of the Meta templates to produce chart templates, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem, and wherein the program code for selecting chart templates includes program code executable by a computing device to generate a fitness score based on the selected chart parts and the set of scoring rules and to display data from the data set in the chart template associated with the highest fitness score. 18. A computer system comprising:
one or more processors, one or more computer-readable memories, and one or more computer-readable storage mediums; program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to retrieve a data visualization intent specification, the data visualization intent specification including one or more data visualization intent specification entries, each data visualization intent specification entry including an intent type and two or more of data fields selected from a defined set of two or more data fields, wherein the intent type defines a type of data visualization desired between data from the selected two or more data fields; program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to select, based on the intent type of the data visualization intent specification, Meta templates that meet the intent type of the data visualization intent specification; program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to determine, for each selected Meta template, chart parts to be assigned to each of the selected Meta templates, the combination of each selected Meta template with the chart parts assigned to that selected Meta template forming a chart template associated with that selected Meta template; and program instructions, stored on at least one of the one or more storage mediums for execution by at least one of the one or more processors via at least one of the one or more memories, to select, based on a set of combination rules and the data visualization intent specification, one or more of the chart templates associated with the selected Meta templates. 19. The computer system of claim 18, wherein the program instructions for determining chart parts includes:
program instructions to retrieve chart part information for selected chart parts from a knowledge base of chart parts, wherein the chart part information includes a definition of types of data to which the chart part can be applied and the Meta templates with which the chart part can be used; and program instructions to identify candidate chart templates based on the selected Meta templates and their associated chart parts. 20. The computer system of claim 18, wherein the set of combination rules includes validation and scoring rules that score and validate combinations of chart parts used to solve a particular problem,
wherein the program instructions for determining chart parts include program instructions to define a knowledge base of chart parts that can be used with each of the Meta templates to produce chart templates, and wherein the program instructions for selecting chart templates includes:
program instructions to generate a fitness score based on the selected chart parts and the set of scoring rules; and
program instructions to display data from the data set in the chart template associated with the highest fitness score. | 2,100 |
4,415 | 13,238,927 | 2,156 | A device control method and apparatus and computer readable medium storing the method, the method including selecting at least one device based on at least one outdoor environment information; and generating control information regarding the selected at least one device based on the at least one outdoor environment information. | 1. A device control method, the method comprising:
selecting at least one device based on at least one outdoor environment information; and generating control information regarding the selected at least one device based on the at least one outdoor environment information. 2. The method of claim 1, further comprising:
outputting guide information based on the control information. 3. The method of claim 1, further comprising:
transmitting the guide information based on the control information to a user device of the selected at least one device. 4. The method of claim 3, wherein the user device is selected based on at least one of usage history information of the selected at least one device, location information of the selected at least one device, and attribute information of the selected at least one device. 5. The method of claim 2, further comprising:
controlling the selected at least one device by using information received based on the guide information. 6. The method of claim 1, further comprising:
collecting indoor environment information, wherein generating control information includes generating control information based on the outdoor environment information and the indoor environment information. 7. The method of claim 6, further comprising:
collecting user information, wherein generating control information includes generating the control information based on the outdoor environment information, the indoor environment information, and the user information. 8. The method of claim 7, wherein collecting user information comprises:
searching for at least one of an external database of a device control apparatus for controlling the selected at least one device and an internal database of the device control apparatus. 9. The method of claim 7, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 10. The method of claim 1, further comprising:
collecting user information, wherein generating control information includes generating the control information based on the outdoor environment information and the user information. 11. The method of claim 10, wherein collecting user information comprises:
searching for at least one of an external database of the device control apparatus for controlling the selected at least one device and an internal database of the device control apparatus. 12. The method of claim 10, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 13. The method of claim 1, further comprising:
if a device control apparatus for controlling the selected at least one device has left a region for controlling the at least one device, transferring a control right of the device control apparatus to a device included in the at least one device. 14. The method of claim 13, wherein transferring the control right is performed based on information regarding previously set candidate devices. 15. A device control method, the method comprising:
selecting at least one device based on at least one user information; and generating control information regarding the selected at least one device based on the at least one user information. 16. The method of claim 15, wherein selecting at least one device includes searching for at least one of an external database of a device control apparatus for controlling the selected at least one device and an internal database of the device control apparatus to obtain the at least one user information. 17. The method of claim 15, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 18. The method of claim 15, further comprising:
outputting guide information based on the control information. 19. The method of claim 18, further comprising:
transmitting the guide information based on the control information to a user device of the selected at least one device. 20. The method of claim 19, wherein the user device is selected based on at least one of usage history information of the selected at least one device, location information of the selected at least one device, and attribute information of the selected at least one device. 21. A non-transitory computer-readable recording medium having embodied thereon a program for executing a device control method, the method comprising:
selecting at least one device based on at least one outdoor environment information; and generating control information regarding the selected at least one device based on the at least one outdoor environment information. 22. A non-transitory computer-readable recording medium having embodied thereon a program for executing a device control method, the method comprising
collecting user information; and generating control information based on outdoor environment information and the user information. 23. A device control apparatus, the apparatus comprising:
a first network interface unit for interfacing with an external network; a second network interface unit for interfacing with a local area network; and a processor for selecting at least one device accessible through the second network interface unit based on at least one outdoor environment information received through the first network interface unit, and generating control information regarding the selected at least one device based on the at least one outdoor environment information. 24. The apparatus of claim 23, further comprising:
an output unit for outputting guide information, wherein the processor outputs guide information based on the control information to the output unit. 25. The apparatus of claim 24, wherein the processor transmits the guide information based on the control information to a user device of the selected at least one device through the second network interface unit. 26. The apparatus of claim 25, wherein the processor selects the user device based on at least one of usage history information of the selected at least one device, location information of the selected at least one device, and attribute information of the selected at least one device. 27. The apparatus of claim 24, wherein the processor outputs a control signal regarding the selected at least one device through the second network interface unit by using information received based on the guide information. 28. The apparatus of claim 23, further comprising:
an indoor environment information collection unit for collecting indoor environment information, wherein the processor generates the control information based on the outdoor environment information and the indoor environment information. 29. The apparatus of claim 28, wherein the processor collects user information, and generates the control information based on the outdoor environment information, the indoor environment information, and the user information. 30. The apparatus of claim 29, further comprising:
a storage unit for storing at least one user information, wherein the processor searches for at least one of an external database accessible through the first network interface unit and an internal database stored in the storage unit to collect the at least one user information. 31. The apparatus of claim 29, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 32. The apparatus of claim 23, further comprising:
a storage unit for storing at least one user information, wherein the processor searches for at least one of an external database accessible through the first network interface unit and an internal database stored in the storage unit to collect the at least one user information. 33. The apparatus of claim 23, wherein, if the device control apparatus for controlling the selected at least one device has left a region for controlling the at least one device, the processor transfers a control right of the device control apparatus to a device included in the at least one device. 34. The apparatus of claim 33, further comprising:
a storage unit for storing information regarding candidate devices capable of transferring the control right, wherein the processor transfers the control right based on information regarding the candidate devices stored in the storage unit. 35. The apparatus of claim 23, wherein the local area network is a home-based network. 36. A device control apparatus, the apparatus comprising:
a first network interface unit for interfacing with an external network; a second network interface unit for interfacing with a local area network; a processor for selecting at least one device based on user information obtained by searching for at least one of an external database and an internal database accessible through the second network interface unit and generating control information regarding the selected at least one device based on the user information; and a storage unit for storing a database based on the user information, wherein the database stored in the storage unit corresponds to the internal database. | A device control method and apparatus and computer readable medium storing the method, the method including selecting at least one device based on at least one outdoor environment information; and generating control information regarding the selected at least one device based on the at least one outdoor environment information.1. A device control method, the method comprising:
selecting at least one device based on at least one outdoor environment information; and generating control information regarding the selected at least one device based on the at least one outdoor environment information. 2. The method of claim 1, further comprising:
outputting guide information based on the control information. 3. The method of claim 1, further comprising:
transmitting the guide information based on the control information to a user device of the selected at least one device. 4. The method of claim 3, wherein the user device is selected based on at least one of usage history information of the selected at least one device, location information of the selected at least one device, and attribute information of the selected at least one device. 5. The method of claim 2, further comprising:
controlling the selected at least one device by using information received based on the guide information. 6. The method of claim 1, further comprising:
collecting indoor environment information, wherein generating control information includes generating control information based on the outdoor environment information and the indoor environment information. 7. The method of claim 6, further comprising:
collecting user information, wherein generating control information includes generating the control information based on the outdoor environment information, the indoor environment information, and the user information. 8. The method of claim 7, wherein collecting user information comprises:
searching for at least one of an external database of a device control apparatus for controlling the selected at least one device and an internal database of the device control apparatus. 9. The method of claim 7, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 10. The method of claim 1, further comprising:
collecting user information, wherein generating control information includes generating the control information based on the outdoor environment information and the user information. 11. The method of claim 10, wherein collecting user information comprises:
searching for at least one of an external database of the device control apparatus for controlling the selected at least one device and an internal database of the device control apparatus. 12. The method of claim 10, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 13. The method of claim 1, further comprising:
if a device control apparatus for controlling the selected at least one device has left a region for controlling the at least one device, transferring a control right of the device control apparatus to a device included in the at least one device. 14. The method of claim 13, wherein transferring the control right is performed based on information regarding previously set candidate devices. 15. A device control method, the method comprising:
selecting at least one device based on at least one user information; and generating control information regarding the selected at least one device based on the at least one user information. 16. The method of claim 15, wherein selecting at least one device includes searching for at least one of an external database of a device control apparatus for controlling the selected at least one device and an internal database of the device control apparatus to obtain the at least one user information. 17. The method of claim 15, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 18. The method of claim 15, further comprising:
outputting guide information based on the control information. 19. The method of claim 18, further comprising:
transmitting the guide information based on the control information to a user device of the selected at least one device. 20. The method of claim 19, wherein the user device is selected based on at least one of usage history information of the selected at least one device, location information of the selected at least one device, and attribute information of the selected at least one device. 21. A non-transitory computer-readable recording medium having embodied thereon a program for executing a device control method, the method comprising:
selecting at least one device based on at least one outdoor environment information; and generating control information regarding the selected at least one device based on the at least one outdoor environment information. 22. A non-transitory computer-readable recording medium having embodied thereon a program for executing a device control method, the method comprising
collecting user information; and generating control information based on outdoor environment information and the user information. 23. A device control apparatus, the apparatus comprising:
a first network interface unit for interfacing with an external network; a second network interface unit for interfacing with a local area network; and a processor for selecting at least one device accessible through the second network interface unit based on at least one outdoor environment information received through the first network interface unit, and generating control information regarding the selected at least one device based on the at least one outdoor environment information. 24. The apparatus of claim 23, further comprising:
an output unit for outputting guide information, wherein the processor outputs guide information based on the control information to the output unit. 25. The apparatus of claim 24, wherein the processor transmits the guide information based on the control information to a user device of the selected at least one device through the second network interface unit. 26. The apparatus of claim 25, wherein the processor selects the user device based on at least one of usage history information of the selected at least one device, location information of the selected at least one device, and attribute information of the selected at least one device. 27. The apparatus of claim 24, wherein the processor outputs a control signal regarding the selected at least one device through the second network interface unit by using information received based on the guide information. 28. The apparatus of claim 23, further comprising:
an indoor environment information collection unit for collecting indoor environment information, wherein the processor generates the control information based on the outdoor environment information and the indoor environment information. 29. The apparatus of claim 28, wherein the processor collects user information, and generates the control information based on the outdoor environment information, the indoor environment information, and the user information. 30. The apparatus of claim 29, further comprising:
a storage unit for storing at least one user information, wherein the processor searches for at least one of an external database accessible through the first network interface unit and an internal database stored in the storage unit to collect the at least one user information. 31. The apparatus of claim 29, wherein the user information comprises:
information indicating whether at least one user exists in a region for controlling the at least one device. 32. The apparatus of claim 23, further comprising:
a storage unit for storing at least one user information, wherein the processor searches for at least one of an external database accessible through the first network interface unit and an internal database stored in the storage unit to collect the at least one user information. 33. The apparatus of claim 23, wherein, if the device control apparatus for controlling the selected at least one device has left a region for controlling the at least one device, the processor transfers a control right of the device control apparatus to a device included in the at least one device. 34. The apparatus of claim 33, further comprising:
a storage unit for storing information regarding candidate devices capable of transferring the control right, wherein the processor transfers the control right based on information regarding the candidate devices stored in the storage unit. 35. The apparatus of claim 23, wherein the local area network is a home-based network. 36. A device control apparatus, the apparatus comprising:
a first network interface unit for interfacing with an external network; a second network interface unit for interfacing with a local area network; a processor for selecting at least one device based on user information obtained by searching for at least one of an external database and an internal database accessible through the second network interface unit and generating control information regarding the selected at least one device based on the user information; and a storage unit for storing a database based on the user information, wherein the database stored in the storage unit corresponds to the internal database. | 2,100 |
4,416 | 13,097,169 | 2,158 | User Defined Functions (UDFs) for a parallel database system are enhanced by making memory persist even when the UDFs terminate. The memory can be shared between different instances of the UDF and the memory can be custom mapped, encrypted, and use custom security. | 1. A method implemented in a non-transitory machine-readable storage medium and processed by one or more processors configured to perform the method, comprising:
receiving, on a processor, a command from a user-defined function (UDF) of a database system to map memory that is to be used by the UDF; mapping, by the processor, a block of data in the database system acquired from one or more tables in response to the command; and providing, by the processor, a mapping within the memory and the mapping accessed and managed by the UDF via set commands issued to the mapping within the memory. 2. The method of claim 1 further comprising, making, by the processor, management operations available to the UDF for managing the mapping and the data within the tables that are associated with the mapping. 3. The method of claim 2 further comprising, re-mapping, by the processor, the block of data on a remap management operation issued by the UDF. 4. The method of claim 2 further comprising, selectively making, by the processor, portions of the block of data: read only, read and write accessible, and globally modifiable, via the mappings as instructed by the UDF using a particular management operation. 5. The method of claim 2 further comprising, locking, by the processor, portions of the mapping associated with specific portions of the block of data based on a particular management operation received from the UDF to ensure updates to the data affected can be made without interference from other UDFs accessing the mapping. 6. The method of claim 2 further comprising, permitting, by the processor, selective portions of the mappings to be shared with other mappings as instructed by the UDF via a particular management operation. 7. The method of claim 2 further comprising, receiving, by the processor, revisions to selective portions of the block of data along with conditions from the UDF via a particular management operation where the revisions are not made to the block of data until the conditions are satisfied. 8. The method of claim 2 further comprising, sharing, by the processor, the mappings with other instances of the UDF based on a particular management instructing received from the UDF. 9. The method of claim 1 further comprising, altering or changing, by the processor, the mappings based on a role dynamically assumed by the UDF during processing of the UDF. 10. The method of claim 1 further comprising, permitting, by the processor, different mappings to the block of data to be accessed by other UDFs and allowing each UDF to maintain its own version of the block of data without interfering with remaining UDFs that are modifying the block of data with their independent mappings. 11. The method of claim 1 further comprising, retaining, by the processor, a state of the block of data upon termination of the UDF to provide that state of the block of data back to the UDF when it is subsequently reestablished for processing. 12. The method of claim 1 further comprising, automatically reinitializing, by the processor, the mappings on a database boundary, a session boundary, a transaction boundary, a request boundary, a user boundary, a role boundary, and/or an external routine boundary. 13. The method of claim 1 further comprising, permitting, by the processor, different mappings to the block of data to be accessed by others based on a current user, a current role of a user, or a current context of an external routine that wants to access the mappings. 14. A method implemented in a non-transitory machine-readable storage medium and processed by one or more processors configured to perform the method, comprising:
superimposing, by the processor, a set data structure onto a block of data housed in one or more database tables of a database; generating, by the processor, mappings for addressing data represented in the set data structure; providing, by the processor, the mappings in memory for access by one or more User Defined Functions (UDFs); and designating, by the processor, a particular UDF to act as a manager of the mappings. 15. The method of claim 14 further comprising, reestablishing, by the processor, the mappings when a particular UDF that had terminated processing is reestablished and is reprocessed. 16. The method of claim 14 further comprising, creating, by the processor, custom versions of the mappings within the memory for different UDFs. 17. The method of claim 14 further comprising, enforcing, by the processor, integrity checking and access control against the set data structure based on policy when the set data structure is accessed by the UDFs via the mappings from the memory. 18. The method of claim 14 further comprising, providing set operations to the UDFs for use against the mappings to access and manipulate the data associated with the set data structure. 19. A system, comprising:
a processor configured with a set manager that is implemented and programmed in a non-transitory machine-readable storage medium, the set manager executes on the processor; and the processor or another different processor configured with a User Defined Function (UDF) that is implemented and programmed in a non-transitory machine-readable storage medium, the UDF executes on the processor or the different processor; wherein the set manager is configured to organize blocks of data acquired from database tables of a database into a set data structure and provide access to data underlying the set data structure via mappings, the mappings provided to the UDF via memory, the UDF is configured to use the mappings to manipulate and manage the data that underlies the set data structure. 20. The system of claim 19, wherein the UDF is also configured to share the mappings with other UDFs, request the mappings be re-mapped, and perform other administrative functions on the mappings. | User Defined Functions (UDFs) for a parallel database system are enhanced by making memory persist even when the UDFs terminate. The memory can be shared between different instances of the UDF and the memory can be custom mapped, encrypted, and use custom security.1. A method implemented in a non-transitory machine-readable storage medium and processed by one or more processors configured to perform the method, comprising:
receiving, on a processor, a command from a user-defined function (UDF) of a database system to map memory that is to be used by the UDF; mapping, by the processor, a block of data in the database system acquired from one or more tables in response to the command; and providing, by the processor, a mapping within the memory and the mapping accessed and managed by the UDF via set commands issued to the mapping within the memory. 2. The method of claim 1 further comprising, making, by the processor, management operations available to the UDF for managing the mapping and the data within the tables that are associated with the mapping. 3. The method of claim 2 further comprising, re-mapping, by the processor, the block of data on a remap management operation issued by the UDF. 4. The method of claim 2 further comprising, selectively making, by the processor, portions of the block of data: read only, read and write accessible, and globally modifiable, via the mappings as instructed by the UDF using a particular management operation. 5. The method of claim 2 further comprising, locking, by the processor, portions of the mapping associated with specific portions of the block of data based on a particular management operation received from the UDF to ensure updates to the data affected can be made without interference from other UDFs accessing the mapping. 6. The method of claim 2 further comprising, permitting, by the processor, selective portions of the mappings to be shared with other mappings as instructed by the UDF via a particular management operation. 7. The method of claim 2 further comprising, receiving, by the processor, revisions to selective portions of the block of data along with conditions from the UDF via a particular management operation where the revisions are not made to the block of data until the conditions are satisfied. 8. The method of claim 2 further comprising, sharing, by the processor, the mappings with other instances of the UDF based on a particular management instructing received from the UDF. 9. The method of claim 1 further comprising, altering or changing, by the processor, the mappings based on a role dynamically assumed by the UDF during processing of the UDF. 10. The method of claim 1 further comprising, permitting, by the processor, different mappings to the block of data to be accessed by other UDFs and allowing each UDF to maintain its own version of the block of data without interfering with remaining UDFs that are modifying the block of data with their independent mappings. 11. The method of claim 1 further comprising, retaining, by the processor, a state of the block of data upon termination of the UDF to provide that state of the block of data back to the UDF when it is subsequently reestablished for processing. 12. The method of claim 1 further comprising, automatically reinitializing, by the processor, the mappings on a database boundary, a session boundary, a transaction boundary, a request boundary, a user boundary, a role boundary, and/or an external routine boundary. 13. The method of claim 1 further comprising, permitting, by the processor, different mappings to the block of data to be accessed by others based on a current user, a current role of a user, or a current context of an external routine that wants to access the mappings. 14. A method implemented in a non-transitory machine-readable storage medium and processed by one or more processors configured to perform the method, comprising:
superimposing, by the processor, a set data structure onto a block of data housed in one or more database tables of a database; generating, by the processor, mappings for addressing data represented in the set data structure; providing, by the processor, the mappings in memory for access by one or more User Defined Functions (UDFs); and designating, by the processor, a particular UDF to act as a manager of the mappings. 15. The method of claim 14 further comprising, reestablishing, by the processor, the mappings when a particular UDF that had terminated processing is reestablished and is reprocessed. 16. The method of claim 14 further comprising, creating, by the processor, custom versions of the mappings within the memory for different UDFs. 17. The method of claim 14 further comprising, enforcing, by the processor, integrity checking and access control against the set data structure based on policy when the set data structure is accessed by the UDFs via the mappings from the memory. 18. The method of claim 14 further comprising, providing set operations to the UDFs for use against the mappings to access and manipulate the data associated with the set data structure. 19. A system, comprising:
a processor configured with a set manager that is implemented and programmed in a non-transitory machine-readable storage medium, the set manager executes on the processor; and the processor or another different processor configured with a User Defined Function (UDF) that is implemented and programmed in a non-transitory machine-readable storage medium, the UDF executes on the processor or the different processor; wherein the set manager is configured to organize blocks of data acquired from database tables of a database into a set data structure and provide access to data underlying the set data structure via mappings, the mappings provided to the UDF via memory, the UDF is configured to use the mappings to manipulate and manage the data that underlies the set data structure. 20. The system of claim 19, wherein the UDF is also configured to share the mappings with other UDFs, request the mappings be re-mapped, and perform other administrative functions on the mappings. | 2,100 |
4,417 | 14,667,229 | 2,183 | A data processing system includes a plurality of contexts, a current context indicator configured to indicate a context of the plurality of contexts as the current context, an instruction queue configured to store fetched instructions for execution using in the current context, and a scheduler coupled to the context selector. The scheduler is configured to, in response to a context switch event, save a current context instruction state from the instruction queue to the corresponding instruction buffer of the current context, select a next context of the plurality of contexts, restore a context instruction state from the corresponding instruction buffer of the next context to the instruction queue, and set the current context indicator to indicate the selected next context as the current context. | 1. A data processing system comprising:
a plurality of contexts, wherein each context includes a corresponding register file and a corresponding instruction buffer; a current context indicator configured to indicate a context of the plurality of contexts as the current context; an instruction queue configured to store fetched instructions for execution using the current context; a scheduler coupled to the context selector and configured to, in response to a context switch event, save a current context instruction state from the instruction queue to the corresponding instruction buffer of the current context, select a next context of the plurality of contexts, restore a context instruction state from the corresponding instruction buffer of the next context to the instruction queue, and set the current context indicator to indicate the selected next context as the current context. 2. The data processing system of claim 1, wherein the current context instruction state comprises the fetched instructions of the current context. 3. The data processing system of claim 1, further comprising an instruction pipeline, wherein the instruction pipeline comprises the instruction queue, and a sequencer coupled to the instruction pipeline and configured to, in response to the context switch event, flush the pipeline. 4. The data processing system of claim 3, wherein the instruction pipeline is configured to, after the selected next context is set as the current context in response to the context switch event, continue instruction execution with the restored fetched instructions in the instruction queue. 5. The data processing system of claim 4, wherein the instruction pipeline comprises an instruction decode unit and is configured to continue execution with the restored fetched instructions by providing a next instruction of the restored fetched instructions to the instruction decode unit. 6. The data processing system of claim 1, wherein the context switch event comprises a cache miss. 7. The data processing system of claim 1, wherein the context switch event comprises a response to an interrupt. 8. The data processing system of claim 1, wherein each context of the plurality of contexts further comprises context scheduling information. 9. The data processing system of claim 8, wherein the context scheduling information in each context of the plurality of contexts includes a ready indicator, wherein the scheduler is configured to, in response to the context switch event, use the context scheduling information in each of the plurality of contexts to select a ready context as the next context. 10. A data processing system comprising:
an instruction pipeline having an instruction queue configured to store fetched instructions, an instruction decode unit coupled to receive fetched instructions from the instruction queue, and an execution unit coupled to receive decoded instructions from the instruction decode unit; a plurality of contexts coupled to the instruction pipeline, wherein each context includes a corresponding register file and a corresponding instruction buffer; a current context indicator configured to indicate a context of the plurality of contexts as the current context; a scheduler coupled to the context selector and configured to, in response to a context switch event, save the fetched instructions from the instruction queue to the corresponding instruction buffer of the current context, select a next context of the plurality of contexts, restore fetched instructions from the corresponding instruction buffer of the next context to the instruction queue, and set the current context indicator to indicate the selected next context as the current context. 11. The data processing system of claim 10, wherein the context switch event comprises a cache miss. 12. The data processing system of claim 10, wherein the context switch event comprises a response to an interrupt. 13. The data processing system of claim 10, wherein the context switch event comprises a message unavailable event. 14. The data processing system of claim 13, wherein each context of the plurality of contexts further comprises context scheduling information, and wherein the scheduler is configured to, in response to the context switch event, use the context scheduling information in each of the plurality of contexts to select a next ready context as the next context. 15. In a data processing system having an instruction pipeline and a plurality of contexts, each context having a corresponding register file and a corresponding instruction buffer, a method comprising:
executing a current context by the instruction pipeline; determining occurrence of a context switch event; and in response to the context switch event, the method further comprises:
saving a current context instruction state from the instruction pipeline to the corresponding instruction buffer of the current context;
selecting a next context of the plurality of contexts; and
restoring a context instruction state to the instruction pipeline from the corresponding instruction buffer of the next context. 16. The method of claim 15, wherein the executing in the current context comprises storing fetched instructions into an instruction queue of the instruction pipeline, wherein the saving the current context instruction state comprises storing the fetched instruction from the instruction queue to the corresponding instruction buffer of the current context. 17. The method of claim 16, wherein the restoring the context instruction state comprises restoring fetched instructions from the corresponding instruction buffer of the next context to the instruction queue. 18. The method of claim 17, wherein after the restoring the context instruction state to the pipeline, the method further comprises:
setting the selected next context as the current context; and executing the restored fetched instructions by the instruction pipeline. 19. The method of claim 15, wherein the context switch event is determined in response to one of a cache miss, a response to an interrupt, or a message unavailable event. 20. The method of claim 15, wherein in response to the context switch event, the method further comprises flushing the pipeline. | A data processing system includes a plurality of contexts, a current context indicator configured to indicate a context of the plurality of contexts as the current context, an instruction queue configured to store fetched instructions for execution using in the current context, and a scheduler coupled to the context selector. The scheduler is configured to, in response to a context switch event, save a current context instruction state from the instruction queue to the corresponding instruction buffer of the current context, select a next context of the plurality of contexts, restore a context instruction state from the corresponding instruction buffer of the next context to the instruction queue, and set the current context indicator to indicate the selected next context as the current context.1. A data processing system comprising:
a plurality of contexts, wherein each context includes a corresponding register file and a corresponding instruction buffer; a current context indicator configured to indicate a context of the plurality of contexts as the current context; an instruction queue configured to store fetched instructions for execution using the current context; a scheduler coupled to the context selector and configured to, in response to a context switch event, save a current context instruction state from the instruction queue to the corresponding instruction buffer of the current context, select a next context of the plurality of contexts, restore a context instruction state from the corresponding instruction buffer of the next context to the instruction queue, and set the current context indicator to indicate the selected next context as the current context. 2. The data processing system of claim 1, wherein the current context instruction state comprises the fetched instructions of the current context. 3. The data processing system of claim 1, further comprising an instruction pipeline, wherein the instruction pipeline comprises the instruction queue, and a sequencer coupled to the instruction pipeline and configured to, in response to the context switch event, flush the pipeline. 4. The data processing system of claim 3, wherein the instruction pipeline is configured to, after the selected next context is set as the current context in response to the context switch event, continue instruction execution with the restored fetched instructions in the instruction queue. 5. The data processing system of claim 4, wherein the instruction pipeline comprises an instruction decode unit and is configured to continue execution with the restored fetched instructions by providing a next instruction of the restored fetched instructions to the instruction decode unit. 6. The data processing system of claim 1, wherein the context switch event comprises a cache miss. 7. The data processing system of claim 1, wherein the context switch event comprises a response to an interrupt. 8. The data processing system of claim 1, wherein each context of the plurality of contexts further comprises context scheduling information. 9. The data processing system of claim 8, wherein the context scheduling information in each context of the plurality of contexts includes a ready indicator, wherein the scheduler is configured to, in response to the context switch event, use the context scheduling information in each of the plurality of contexts to select a ready context as the next context. 10. A data processing system comprising:
an instruction pipeline having an instruction queue configured to store fetched instructions, an instruction decode unit coupled to receive fetched instructions from the instruction queue, and an execution unit coupled to receive decoded instructions from the instruction decode unit; a plurality of contexts coupled to the instruction pipeline, wherein each context includes a corresponding register file and a corresponding instruction buffer; a current context indicator configured to indicate a context of the plurality of contexts as the current context; a scheduler coupled to the context selector and configured to, in response to a context switch event, save the fetched instructions from the instruction queue to the corresponding instruction buffer of the current context, select a next context of the plurality of contexts, restore fetched instructions from the corresponding instruction buffer of the next context to the instruction queue, and set the current context indicator to indicate the selected next context as the current context. 11. The data processing system of claim 10, wherein the context switch event comprises a cache miss. 12. The data processing system of claim 10, wherein the context switch event comprises a response to an interrupt. 13. The data processing system of claim 10, wherein the context switch event comprises a message unavailable event. 14. The data processing system of claim 13, wherein each context of the plurality of contexts further comprises context scheduling information, and wherein the scheduler is configured to, in response to the context switch event, use the context scheduling information in each of the plurality of contexts to select a next ready context as the next context. 15. In a data processing system having an instruction pipeline and a plurality of contexts, each context having a corresponding register file and a corresponding instruction buffer, a method comprising:
executing a current context by the instruction pipeline; determining occurrence of a context switch event; and in response to the context switch event, the method further comprises:
saving a current context instruction state from the instruction pipeline to the corresponding instruction buffer of the current context;
selecting a next context of the plurality of contexts; and
restoring a context instruction state to the instruction pipeline from the corresponding instruction buffer of the next context. 16. The method of claim 15, wherein the executing in the current context comprises storing fetched instructions into an instruction queue of the instruction pipeline, wherein the saving the current context instruction state comprises storing the fetched instruction from the instruction queue to the corresponding instruction buffer of the current context. 17. The method of claim 16, wherein the restoring the context instruction state comprises restoring fetched instructions from the corresponding instruction buffer of the next context to the instruction queue. 18. The method of claim 17, wherein after the restoring the context instruction state to the pipeline, the method further comprises:
setting the selected next context as the current context; and executing the restored fetched instructions by the instruction pipeline. 19. The method of claim 15, wherein the context switch event is determined in response to one of a cache miss, a response to an interrupt, or a message unavailable event. 20. The method of claim 15, wherein in response to the context switch event, the method further comprises flushing the pipeline. | 2,100 |
4,418 | 12,844,669 | 2,173 | Methods for realizing advanced graphical user interface (GUI) in panel subunit. The present invention provides, in one embodiment, a button GUI element descriptor that defines a bitmap to be displayed when a button is out of focus and another bitmap to be displayed when the button is in focus. In another embodiment, the present invention provides a table GUI element descriptor that defines a table-like on screen display to be displayed on the controller device. Another embodiment of the present invention provides a panel GUI element descriptor that includes a focused identifier attribute indicating a pre-determined element of the on-screen display as default focus. In this way, the target device would be able to control the default focus of the controller device when displaying an on-screen display. In yet another embodiment, the present invention provides a text GUI element descriptor that includes a font style attribute that dictates whether the text GUI element should be displayed as bold, underlined and/or reversed. By using these extended elements in panel subunit, more complicated and advanced GUI, such as an electronic programming guide (EPG) can be achieved. | 1. A method of displaying a graphical user interface (GUI), said method comprising:
a controller device receiving data from a target device, wherein said data is operable to define physical appearances of graphical elements of said GUI, wherein said GUI is associated with said target device when rendered by said controller device; said controller device generating said GUI based on said data, wherein user interaction with said graphical elements of said GUI is operable to control at least one operation of said target device; and said controller device storing said GUI in a memory component. 2. The method as described in claim 1 further comprising:
said controller device rendering said GUI for user interaction thereof. 3. The method as described in claim 2, wherein said rendering comprises displaying said GUI. 4. The method as described in claim 1 further comprising:
said controller device monitoring said target device to track a current status of said target device. 5. The method as described in claim 4, wherein said monitoring comprises:
said controller device transmitting a status inquiry to said target device; and in response to said transmitting, said controller device receiving said current status of said target device. 6. The method as described in claim 4 further comprising:
said controller device, updating said GUI based on said monitoring. 7. The method as described in claim 4, wherein said monitoring comprises:
said controller device automatically receiving a change in status of said target device. 8. The method as described in claim 1, wherein said physical appearance comprises a layout of images and orientations of said graphical elements of said GUI. 9. The method as described in claim 1 further comprising:
said controller device monitoring a network to discover a new target device being coupled to said controller device via said network. 10. A controller comprising:
a processor; and a memory coupled to said processor wherein said memory comprises instructions that when executed implement a method of processing information, said method comprising:
receiving data from a target device, wherein said data is operable to define physical appearances of graphical elements of a graphical user interface (GUI), wherein said GUI is associated with said target device when rendered by said controller;
generating said GUI based on said data, wherein said GUI comprises said graphical elements as part of an on-screen display, and wherein further user interaction with said GUI is operable to control at least one operation of said target device; and
storing said GUI in said memory. 11. The controller as described in claim 10, wherein said data comprises a button GUI element descriptor operable to define a graphical element of said graphical elements to be displayed by said GUI, and wherein said button GUI element descriptor is further operable to define a first bitmap image to be displayed when said graphical element is selected and a second bitmap image to be displayed when said graphical element is not selected, and wherein said button GUI element descriptor is further operable to define vertically and horizontally aligned information to be displayed by said controller. 12. The controller as described in claim 11, wherein said button GUI element descriptor is operable to define a first label to be displayed when said graphical element is not selected. 13. The controller as described in claim 12, wherein said button GUI element descriptor is further operable to define a second label to be displayed when said graphical element is selected, and wherein a content of said second label is different from a content of said first label. 14. The controller as described in claim 10 further comprising:
a display operable to render said GUI for user interaction thereof. 15. The controller as described in claim 10, wherein said method further comprises:
monitoring said target device to track a current status of said target device. 16. The controller as described in claim 15, wherein said monitoring comprises:
transmitting a status inquiry to said target device; and in response to said transmitting, receiving said current status of said target device. 17. The controller as described in claim 15, wherein said method further comprising:
updating said GUI based on said monitoring. 18. The controller as described in claim 15, wherein said monitoring further comprises:
automatically receiving a change in status of said target device. 19. The controller as described in claim 10, wherein said method further comprises:
monitoring a network to discover a new target device being coupled to said controller via said network. 20. The controller as described in claim 10, wherein said data comprises a panel GUI element descriptor operable to define an on-screen display that includes said graphical elements of said GUI, and wherein said panel GUI element descriptor is further operable to define a selection identifier attribute that indicates a pre-determined graphical element of said graphical elements as a default selection, and wherein said panel GUI element descriptor is further operable to define a vertically and horizontally aligned information to be displayed by said GUI. 21. The controller as described in claim 10, wherein said GUI comprises a pop-up menu. 22. The controller as described in claim 10, wherein said data comprises a text GUI element descriptor operable to define a text element to be displayed by said GUI, and wherein said text GUI element descriptor further includes a font style attribute, and wherein said text GUI element descriptor is further operable to define a vertically and horizontally aligned information to be displayed by said GUI. 23. The controller as described in claim 22, wherein said font style attribute is selected from a group consisting of bolding said text element, underlining said text element, and reversing a color of said text element and a background color. | Methods for realizing advanced graphical user interface (GUI) in panel subunit. The present invention provides, in one embodiment, a button GUI element descriptor that defines a bitmap to be displayed when a button is out of focus and another bitmap to be displayed when the button is in focus. In another embodiment, the present invention provides a table GUI element descriptor that defines a table-like on screen display to be displayed on the controller device. Another embodiment of the present invention provides a panel GUI element descriptor that includes a focused identifier attribute indicating a pre-determined element of the on-screen display as default focus. In this way, the target device would be able to control the default focus of the controller device when displaying an on-screen display. In yet another embodiment, the present invention provides a text GUI element descriptor that includes a font style attribute that dictates whether the text GUI element should be displayed as bold, underlined and/or reversed. By using these extended elements in panel subunit, more complicated and advanced GUI, such as an electronic programming guide (EPG) can be achieved.1. A method of displaying a graphical user interface (GUI), said method comprising:
a controller device receiving data from a target device, wherein said data is operable to define physical appearances of graphical elements of said GUI, wherein said GUI is associated with said target device when rendered by said controller device; said controller device generating said GUI based on said data, wherein user interaction with said graphical elements of said GUI is operable to control at least one operation of said target device; and said controller device storing said GUI in a memory component. 2. The method as described in claim 1 further comprising:
said controller device rendering said GUI for user interaction thereof. 3. The method as described in claim 2, wherein said rendering comprises displaying said GUI. 4. The method as described in claim 1 further comprising:
said controller device monitoring said target device to track a current status of said target device. 5. The method as described in claim 4, wherein said monitoring comprises:
said controller device transmitting a status inquiry to said target device; and in response to said transmitting, said controller device receiving said current status of said target device. 6. The method as described in claim 4 further comprising:
said controller device, updating said GUI based on said monitoring. 7. The method as described in claim 4, wherein said monitoring comprises:
said controller device automatically receiving a change in status of said target device. 8. The method as described in claim 1, wherein said physical appearance comprises a layout of images and orientations of said graphical elements of said GUI. 9. The method as described in claim 1 further comprising:
said controller device monitoring a network to discover a new target device being coupled to said controller device via said network. 10. A controller comprising:
a processor; and a memory coupled to said processor wherein said memory comprises instructions that when executed implement a method of processing information, said method comprising:
receiving data from a target device, wherein said data is operable to define physical appearances of graphical elements of a graphical user interface (GUI), wherein said GUI is associated with said target device when rendered by said controller;
generating said GUI based on said data, wherein said GUI comprises said graphical elements as part of an on-screen display, and wherein further user interaction with said GUI is operable to control at least one operation of said target device; and
storing said GUI in said memory. 11. The controller as described in claim 10, wherein said data comprises a button GUI element descriptor operable to define a graphical element of said graphical elements to be displayed by said GUI, and wherein said button GUI element descriptor is further operable to define a first bitmap image to be displayed when said graphical element is selected and a second bitmap image to be displayed when said graphical element is not selected, and wherein said button GUI element descriptor is further operable to define vertically and horizontally aligned information to be displayed by said controller. 12. The controller as described in claim 11, wherein said button GUI element descriptor is operable to define a first label to be displayed when said graphical element is not selected. 13. The controller as described in claim 12, wherein said button GUI element descriptor is further operable to define a second label to be displayed when said graphical element is selected, and wherein a content of said second label is different from a content of said first label. 14. The controller as described in claim 10 further comprising:
a display operable to render said GUI for user interaction thereof. 15. The controller as described in claim 10, wherein said method further comprises:
monitoring said target device to track a current status of said target device. 16. The controller as described in claim 15, wherein said monitoring comprises:
transmitting a status inquiry to said target device; and in response to said transmitting, receiving said current status of said target device. 17. The controller as described in claim 15, wherein said method further comprising:
updating said GUI based on said monitoring. 18. The controller as described in claim 15, wherein said monitoring further comprises:
automatically receiving a change in status of said target device. 19. The controller as described in claim 10, wherein said method further comprises:
monitoring a network to discover a new target device being coupled to said controller via said network. 20. The controller as described in claim 10, wherein said data comprises a panel GUI element descriptor operable to define an on-screen display that includes said graphical elements of said GUI, and wherein said panel GUI element descriptor is further operable to define a selection identifier attribute that indicates a pre-determined graphical element of said graphical elements as a default selection, and wherein said panel GUI element descriptor is further operable to define a vertically and horizontally aligned information to be displayed by said GUI. 21. The controller as described in claim 10, wherein said GUI comprises a pop-up menu. 22. The controller as described in claim 10, wherein said data comprises a text GUI element descriptor operable to define a text element to be displayed by said GUI, and wherein said text GUI element descriptor further includes a font style attribute, and wherein said text GUI element descriptor is further operable to define a vertically and horizontally aligned information to be displayed by said GUI. 23. The controller as described in claim 22, wherein said font style attribute is selected from a group consisting of bolding said text element, underlining said text element, and reversing a color of said text element and a background color. | 2,100 |
4,419 | 13,050,490 | 2,145 | A Graphical User Interface (GUI) Customization System provides users with applications that feature customized GUI configurations by applying one or more configuration parameters to common codebases in the applications without user intervention. Various embodiments of the GUI Customization System can provide different methods of acquiring, customizing, and providing applications and sets of configuration parameters to users. | 1. A method comprising:
receiving, from an application store, a request to provide an application associated with a first market brand; receiving from the application store, in conjunction with the request, a GUI configuration parameter associated with the first market brand; obtaining, from a codebase, an unconfigured application; and customizing the unconfigured application, using the GUI configuration parameter, to generate the application associated with the first market brand. 2. The method of claim 1, further comprising:
transmitting the configured application to an end-user device. 3. The method of claim 1, further comprising:
transmitting both the unconfigured application and the GUI configuration parameter to an end-user device; and wherein customizing the unconfigured application includes generating the application associated with the first market brand using the end-user device. 4. The method of claim 1, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing default information sources; and customizing channel configurations. 5. The method of claim 1, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing advertising variables. 6. The method of claim 1, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing reporting variables. 7. The method of claim 1, further comprising:
receiving, from an application store, a second request to provide a second application associated with a second market brand; receiving from the application store, in conjunction with the second request, a second GUI configuration parameter associated with the second market brand; obtaining, from the codebase, the unconfigured application; and customizing the unconfigured application, using the second GUI configuration parameter, to generate the second application associated with the second market brand. 8. An apparatus comprising:
a codebase, wherein the codebase stores a plurality of unconfigured applications; a first processing circuitry configured to:
receive, from an application store, a request to provide an application associated with a first market brand;
receive from the application store, in conjunction with the request, a GUI configuration parameter associated with the first market brand;
obtain, from the codebase, an unconfigured application; and
customize the unconfigured application, using the GUI configuration parameter, to generate the application associated with the first market brand. 9. The apparatus of claim 8, wherein the first processing circuitry is further configured to:
transmit both the unconfigured application and the GUI configuration parameter to an end-user device; and wherein customizing the unconfigured application includes generating the application associated with the first market brand using the end-user device. 10. The apparatus of claim 8, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing default information sources; and customizing channel configurations. 11. The apparatus of claim 8, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing advertising variables. 12. The apparatus of claim 8, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing reporting variables. 13. The apparatus of claim 8, wherein the processing circuitry is further configured to:
receive, from an application store, a second request to provide a second application associated with a second market brand; receive from the application store, in conjunction with the second request, a second GUI configuration parameter associated with the second market brand; obtain, from the codebase, the unconfigured application; and customize the unconfigured application, using the second GUI configuration parameter, to generate the second application associated with the second market brand. 14. A computer readable medium tangibly embodying a program of computer executable instructions, the program of instructions comprising:
at least one instruction to receive, from an application store, a request to provide an application associated with a first market brand; at least one instruction to receive from the application store, in conjunction with the request, a GUI configuration parameter associated with the first market brand; at least one instruction to obtain, from a codebase, an unconfigured application; and at least one instruction to customize the unconfigured application, using the GUI configuration parameter, to generate the application associated with the first market brand. 15. The computer readable medium of claim 14, the program of instructions further comprising:
transmitting the configured application to an end-user device. 16. The computer readable medium of claim 14, the program of instructions further comprising:
at least one instruction to transmit both the unconfigured application and the GUI configuration parameter to an end-user device; and wherein customizing the unconfigured application includes generating the application associated with the first market brand using the end-user device. 17. The computer readable medium of claim 14, wherein the at least one instruction to customize the unconfigured application using the GUI configuration parameter comprises:
at least one instruction to customize default information sources; and at least one instruction to customize channel configurations. 18. The computer readable medium of claim 14, wherein the at least one instruction to customize the unconfigured application using the GUI configuration parameter comprises:
at least one instruction to customize advertising variables. 19. The computer readable medium of claim 14, wherein the at least one instruction to customize the unconfigured application using the GUI configuration parameter comprises:
customizing reporting variables. 20. The computer readable medium of claim 14, the program of instructions further comprising:
at least one instruction to receive, from an application store, a second request to provide a second application associated with a second market brand; at least one instruction to receive, from the application store, in conjunction with the second request, a second GUI configuration parameter associated with the second market brand; at least one instruction to obtain, from the codebase, the unconfigured application; and at least one instruction to customize the unconfigured application, using the second GUI configuration parameter, to generate the second application associated with the second market brand. | A Graphical User Interface (GUI) Customization System provides users with applications that feature customized GUI configurations by applying one or more configuration parameters to common codebases in the applications without user intervention. Various embodiments of the GUI Customization System can provide different methods of acquiring, customizing, and providing applications and sets of configuration parameters to users.1. A method comprising:
receiving, from an application store, a request to provide an application associated with a first market brand; receiving from the application store, in conjunction with the request, a GUI configuration parameter associated with the first market brand; obtaining, from a codebase, an unconfigured application; and customizing the unconfigured application, using the GUI configuration parameter, to generate the application associated with the first market brand. 2. The method of claim 1, further comprising:
transmitting the configured application to an end-user device. 3. The method of claim 1, further comprising:
transmitting both the unconfigured application and the GUI configuration parameter to an end-user device; and wherein customizing the unconfigured application includes generating the application associated with the first market brand using the end-user device. 4. The method of claim 1, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing default information sources; and customizing channel configurations. 5. The method of claim 1, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing advertising variables. 6. The method of claim 1, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing reporting variables. 7. The method of claim 1, further comprising:
receiving, from an application store, a second request to provide a second application associated with a second market brand; receiving from the application store, in conjunction with the second request, a second GUI configuration parameter associated with the second market brand; obtaining, from the codebase, the unconfigured application; and customizing the unconfigured application, using the second GUI configuration parameter, to generate the second application associated with the second market brand. 8. An apparatus comprising:
a codebase, wherein the codebase stores a plurality of unconfigured applications; a first processing circuitry configured to:
receive, from an application store, a request to provide an application associated with a first market brand;
receive from the application store, in conjunction with the request, a GUI configuration parameter associated with the first market brand;
obtain, from the codebase, an unconfigured application; and
customize the unconfigured application, using the GUI configuration parameter, to generate the application associated with the first market brand. 9. The apparatus of claim 8, wherein the first processing circuitry is further configured to:
transmit both the unconfigured application and the GUI configuration parameter to an end-user device; and wherein customizing the unconfigured application includes generating the application associated with the first market brand using the end-user device. 10. The apparatus of claim 8, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing default information sources; and customizing channel configurations. 11. The apparatus of claim 8, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing advertising variables. 12. The apparatus of claim 8, wherein customizing the unconfigured application using the GUI configuration parameter comprises:
customizing reporting variables. 13. The apparatus of claim 8, wherein the processing circuitry is further configured to:
receive, from an application store, a second request to provide a second application associated with a second market brand; receive from the application store, in conjunction with the second request, a second GUI configuration parameter associated with the second market brand; obtain, from the codebase, the unconfigured application; and customize the unconfigured application, using the second GUI configuration parameter, to generate the second application associated with the second market brand. 14. A computer readable medium tangibly embodying a program of computer executable instructions, the program of instructions comprising:
at least one instruction to receive, from an application store, a request to provide an application associated with a first market brand; at least one instruction to receive from the application store, in conjunction with the request, a GUI configuration parameter associated with the first market brand; at least one instruction to obtain, from a codebase, an unconfigured application; and at least one instruction to customize the unconfigured application, using the GUI configuration parameter, to generate the application associated with the first market brand. 15. The computer readable medium of claim 14, the program of instructions further comprising:
transmitting the configured application to an end-user device. 16. The computer readable medium of claim 14, the program of instructions further comprising:
at least one instruction to transmit both the unconfigured application and the GUI configuration parameter to an end-user device; and wherein customizing the unconfigured application includes generating the application associated with the first market brand using the end-user device. 17. The computer readable medium of claim 14, wherein the at least one instruction to customize the unconfigured application using the GUI configuration parameter comprises:
at least one instruction to customize default information sources; and at least one instruction to customize channel configurations. 18. The computer readable medium of claim 14, wherein the at least one instruction to customize the unconfigured application using the GUI configuration parameter comprises:
at least one instruction to customize advertising variables. 19. The computer readable medium of claim 14, wherein the at least one instruction to customize the unconfigured application using the GUI configuration parameter comprises:
customizing reporting variables. 20. The computer readable medium of claim 14, the program of instructions further comprising:
at least one instruction to receive, from an application store, a second request to provide a second application associated with a second market brand; at least one instruction to receive, from the application store, in conjunction with the second request, a second GUI configuration parameter associated with the second market brand; at least one instruction to obtain, from the codebase, the unconfigured application; and at least one instruction to customize the unconfigured application, using the second GUI configuration parameter, to generate the second application associated with the second market brand. | 2,100 |
4,420 | 13,983,985 | 2,171 | A communication terminal (T) equipped with a means of processing (TRT) designed to allow the use of software applications and equipped with an interface (INT) for communicating with a communication network (N), said means of processing comprising at least: •A first module (MZG) designed to delimit a geographical zone (ZG) based on a curve described in space by the communication terminal, •A second module (MOR) designed to determine a set of active real objects (O 1, 02 ) located in this zone and having an interface (Int 1, Int 2 ) with the communication network, •A third module (MIA) designed to identify an application in relation to the active real objects, •A fourth module (MDA) designed to interface the application with the previously determined active real objects. | 1. Method to run a software application accessible from a communication terminal using at least one real object, comprising:
describing a curve in space from said communication terminal identifying a geographic zone based on said curve, determining a set of active real objects located within said geographic zone having a communication interface with a communication network identifying an application from among said active real objects interfacing said application with said active real objects. 2. Method according to claim 1 in which said delimitation consists of automatically determining the position of said communication terminal using a locating device and determining said geographic zone in relation to said position. 3. Method according to claim 1, in which said communication terminal can display said geographic zone being determined on the screen in real time. 4. Method according to claim 1 in which the delimitation and determination steps are carried out progressively and in parallel, so that said terminal displays the active real objects in the geographic zone being determined on said screen. 5. Method according to claim 1 in which said determination step consists of querying a first database associating real objects and geographic positions, and determining said set of active real objects by comparing the associated geographic positions in said database with said geographic zone. 6. Method according to claim 1 in which said terminal may display at least part of said geographic zone on the screen and may show the active real objects from among said set of active real objects corresponding to at least one part of it using an augmented reality mechanism. 7. Method according to claim 1 in which said identification step includes re-querying a second database associating the applications available with the required conditions, and the determination of a set of applications for which the associated required conditions correspond to the abilities offered by the real objects in said set. 8. Method according to claim 1 in which it is possible to use an ontology to determine the required conditions for said applications that correspond to the abilities of said objects. 9. Method according to claim 9 in which said set of applications is provided to the user of said communication terminal to help him or her select an application from among said set of applications. 10. Method according to claim 1 in which said set of applications is displayed on a screen of said communication terminal. 11. Method according to claim 8 in which said second database is formed from the set of applications currently installed on the communication terminal. 12. Method according to claim 8 in which said second database comprises the applications available on at least one application server. 13. Method according to claim 1 in which said application is run by using a subset of said set of active real objects, said subset being determined by a criterion of the distance from the position of said communication terminal. 14. Method according to claim 1 in which said application is run by using a subset of said set of active real objects, said subset being determined by a criterion linked to the profile of the user of said communication terminal. 15. Method according to claim 1 in which said delimitation step is carried out by determining a path, and said determination, identification, and interface are then carried out in relation to the location of said communication terminal along said path. 16. A communication terminal equipped with a means of processing designed to allow the use of software applications and equipped with an interface for communicating with a communication network, said means of processing comprising at least:
A first module designed to delimit a geographical zone (ZG) based on a curve described in space by said communication terminal, A second module designed to determine a set of active real objects located in said geographic zone and having a communication interface with said communication network, A third module designed to identify an application in relation to said active real objects A fourth module designed to interface said application with said previously determined active real objects. 17. A man-machine interface for communication terminal comprising a screen having the means to display a list of available applications that may be run on active real objects within a set of active real objects located in a geographic zone determined from the location of said communication terminal and a curve described in space by said communication terminal, and a means of interaction to allow a user to select an application from said list and to start the interface between said application and said previously determined active real objects. 18. Computer program comprising suitable software resources for implementing the method according to claim 1. | A communication terminal (T) equipped with a means of processing (TRT) designed to allow the use of software applications and equipped with an interface (INT) for communicating with a communication network (N), said means of processing comprising at least: •A first module (MZG) designed to delimit a geographical zone (ZG) based on a curve described in space by the communication terminal, •A second module (MOR) designed to determine a set of active real objects (O 1, 02 ) located in this zone and having an interface (Int 1, Int 2 ) with the communication network, •A third module (MIA) designed to identify an application in relation to the active real objects, •A fourth module (MDA) designed to interface the application with the previously determined active real objects.1. Method to run a software application accessible from a communication terminal using at least one real object, comprising:
describing a curve in space from said communication terminal identifying a geographic zone based on said curve, determining a set of active real objects located within said geographic zone having a communication interface with a communication network identifying an application from among said active real objects interfacing said application with said active real objects. 2. Method according to claim 1 in which said delimitation consists of automatically determining the position of said communication terminal using a locating device and determining said geographic zone in relation to said position. 3. Method according to claim 1, in which said communication terminal can display said geographic zone being determined on the screen in real time. 4. Method according to claim 1 in which the delimitation and determination steps are carried out progressively and in parallel, so that said terminal displays the active real objects in the geographic zone being determined on said screen. 5. Method according to claim 1 in which said determination step consists of querying a first database associating real objects and geographic positions, and determining said set of active real objects by comparing the associated geographic positions in said database with said geographic zone. 6. Method according to claim 1 in which said terminal may display at least part of said geographic zone on the screen and may show the active real objects from among said set of active real objects corresponding to at least one part of it using an augmented reality mechanism. 7. Method according to claim 1 in which said identification step includes re-querying a second database associating the applications available with the required conditions, and the determination of a set of applications for which the associated required conditions correspond to the abilities offered by the real objects in said set. 8. Method according to claim 1 in which it is possible to use an ontology to determine the required conditions for said applications that correspond to the abilities of said objects. 9. Method according to claim 9 in which said set of applications is provided to the user of said communication terminal to help him or her select an application from among said set of applications. 10. Method according to claim 1 in which said set of applications is displayed on a screen of said communication terminal. 11. Method according to claim 8 in which said second database is formed from the set of applications currently installed on the communication terminal. 12. Method according to claim 8 in which said second database comprises the applications available on at least one application server. 13. Method according to claim 1 in which said application is run by using a subset of said set of active real objects, said subset being determined by a criterion of the distance from the position of said communication terminal. 14. Method according to claim 1 in which said application is run by using a subset of said set of active real objects, said subset being determined by a criterion linked to the profile of the user of said communication terminal. 15. Method according to claim 1 in which said delimitation step is carried out by determining a path, and said determination, identification, and interface are then carried out in relation to the location of said communication terminal along said path. 16. A communication terminal equipped with a means of processing designed to allow the use of software applications and equipped with an interface for communicating with a communication network, said means of processing comprising at least:
A first module designed to delimit a geographical zone (ZG) based on a curve described in space by said communication terminal, A second module designed to determine a set of active real objects located in said geographic zone and having a communication interface with said communication network, A third module designed to identify an application in relation to said active real objects A fourth module designed to interface said application with said previously determined active real objects. 17. A man-machine interface for communication terminal comprising a screen having the means to display a list of available applications that may be run on active real objects within a set of active real objects located in a geographic zone determined from the location of said communication terminal and a curve described in space by said communication terminal, and a means of interaction to allow a user to select an application from said list and to start the interface between said application and said previously determined active real objects. 18. Computer program comprising suitable software resources for implementing the method according to claim 1. | 2,100 |
4,421 | 14,572,765 | 2,158 | Techniques for compressing leaf blocks of an index are provided. The decision whether (and/or how much) to compress leaf blocks of an index is performed on a per block basis. Thus, for example, some leaf blocks of the index may be compressed while other leaf blocks of the index may be uncompressed. As another example, different leaf blocks of an index may be compressed a different amount. In one technique, a set of index entries is identified for storage in a leaf block. Multiple estimates of potential space savings are calculated for compressing the set of index entries, one estimate for each different variation of a compression technique. The compression technique variation that is associated with the most space savings is selected and applied to the set of index entries. Thus, some techniques prevent negative compression altogether. Additionally, users require no knowledge of the underlying data to perform optimal compression. | 1. A method comprising:
identifying a first plurality of index entries that are to be stored in a first leaf block of a plurality of leaf blocks of an index; determining whether to compress the first plurality of index entries; identifying a second plurality of index entries that are to be stored in a second leaf block of the plurality of leaf blocks of the index; determining whether to compress the second plurality of index entries; wherein the method is performed by one or more computing devices. 2. The method of claim 1, further comprising:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; determining not to compress the second plurality of index entries that are to be stored in the second leaf block. 3. The method of claim 1, wherein:
determining whether to compress the first plurality of index entries of the first leaf block comprises determining whether compressing the first plurality of index entries would require more storage than not compressing the first plurality of index entries. 4. The method of claim 1, further comprising:
identifying, for compression, a first set of one or more columns of the first plurality of index entries that are to be stored in the first leaf block; identifying, for compression, a second set of one or more columns of the second plurality of index entries that are to be stored in the second leaf block; wherein the number of columns in the first set is different than the number of columns in the second set. 5. The method of claim 1, further comprising:
storing, in the first leaf block of the plurality of leaf blocks, a first plurality of compressed indexed entries and first prefix information for a first number of columns; after storing the first plurality of compressed indexed entries and the first prefix information in the first leaf block, storing, in the first leaf block, instead of the first plurality of compressed indexed entries and the first prefix information, a second plurality of compressed indexed entries and second prefix information for a second number of columns that is different than the first number of columns. 6. The method of claim 1, further comprising:
receiving a particular index entry that is to be inserted into one of the plurality of leaf blocks; identifying a particular leaf block, of the plurality of leaf blocks, in which to insert the particular index entry; wherein the particular leaf block stores information about a plurality of index entries; determining whether the particular leaf block contains enough available storage space to store the information and the particular index entry. 7. The method of claim 6, further comprising:
in response to determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, analyzing the plurality of index entries and the particular index entry to determine whether applying a prefix compression technique would allow the plurality of index entries and the particular index entry to be stored in the particular leaf block. 8. The method of claim 6, further comprising:
after determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, determining to split the particular leaf block into a first particular leaf block and a second particular leaf block, wherein the first particular leaf block and the second particular leaf block have the same size as the particular leaf block; storing a first subset of the plurality of index entries in the first particular leaf block; storing a second subset of the plurality of index entries in the second particular leaf block; inserting the particular index entry into the first particular leaf block or the second particular leaf block. 9. The method of claim 1, further comprising:
storing, within a particular leaf block of the plurality of leaf blocks, an overhead array that comprises a plurality of entries that includes a first entry and a second entry, wherein the first entry includes a first prefix count and the second entry includes a second prefix count; locating a particular index entry in the particular leaf block by using the first prefix count and the second prefix count. 10. The method of claim 9, wherein:
the first entry also includes an offset; locating the particular index entry in the particular leaf block by also using the offset. 11. The method of claim 1, further comprising:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; compressing the first plurality of index entries; prior to durably storing the first plurality of index entries in the first leaf block, determining whether one or more additional index entries that are not in the first plurality of index entries may be stored in the first leaf block; in response to determining that the one or more additional index entries may be stored in the first leaf block, compressing the one or more additional index entries and storing the one or more additional index entries in the first leaf block. 12. One or more non-transitory storage media storing instructions which, when executed by one or more computing devices, cause:
identifying a first plurality of index entries that are to be stored in a first leaf block of a plurality of leaf blocks of an index; determining whether to compress the first plurality of index entries; identifying a second plurality of index entries that are to be stored in a second leaf block of the plurality of leaf blocks of the index; determining whether to compress the second plurality of index entries. 13. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the or more processors, further cause:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; determining not to compress the second plurality of index entries that are to be stored in the second leaf block. 14. The one or more non-transitory storage media of claim 12, wherein:
determining whether to compress the first plurality of index entries of the first leaf block comprises determining whether compressing the first plurality of index entries would require more storage than not compressing the first plurality of index entries. 15. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
identifying, for compression, a first set of one or more columns of the first plurality of index entries that are to be stored in the first leaf block; identifying, for compression, a second set of one or more columns of the second plurality of index entries that are to be stored in the second leaf block; wherein the number of columns in the first set is different than the number of columns in the second set. 16. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
storing, in the first leaf block of the plurality of leaf blocks, a first plurality of compressed indexed entries and first prefix information for a first number of columns; after storing the first plurality of compressed indexed entries and the first prefix information in the first leaf block, storing, in the first leaf block, instead of the first plurality of compressed indexed entries and the first prefix information, a second plurality of compressed indexed entries and second prefix information for a second number of columns that is different than the first number of columns. 17. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
receiving a particular index entry that is to be inserted into one of the plurality of leaf blocks; identifying a particular leaf block, of the plurality of leaf blocks, in which to insert the particular index entry; wherein the particular leaf block stores information about a plurality of index entries; determining whether the particular leaf block contains enough available storage space to store the information and the particular index entry. 18. The one or more non-transitory storage media of claim 17, wherein the instructions, when executed by the one or more processors, further cause:
in response to determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, analyzing the plurality of index entries and the particular index entry to determine whether applying a prefix compression technique would allow the plurality of index entries and the particular index entry to be stored in the particular leaf block. 19. The one or more non-transitory storage media of claim 17, wherein the instructions, when executed by the one or more processors, further cause:
after determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, determining to split the particular leaf block into a first particular leaf block and a second particular leaf block, wherein the first particular leaf block and the second particular leaf block have the same size as the particular leaf block; storing a first subset of the plurality of index entries in the first particular leaf block; storing a second subset of the plurality of index entries in the second particular leaf block; inserting the particular index entry into the first particular leaf block or the second particular leaf block. 20. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
storing, within a particular leaf block of the plurality of leaf blocks, an overhead array that comprises a plurality of entries that includes a first entry and a second entry, wherein the first entry includes a first prefix count and the second entry includes a second prefix count; locating a particular index entry in the particular leaf block by using the first prefix count and the second prefix count. 21. The one or more non-transitory storage media of claim 20, wherein:
the first entry also includes an offset; locating the particular index entry in the particular leaf block by also using the offset. 22. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; compressing the first plurality of index entries; prior to durably storing the first plurality of index entries in the first leaf block, determining whether one or more additional index entries that are not in the first plurality of index entries may be stored in the first leaf block; in response to determining that the one or more additional index entries may be stored in the first leaf block, compressing the one or more additional index entries and storing the one or more additional index entries in the first leaf block. | Techniques for compressing leaf blocks of an index are provided. The decision whether (and/or how much) to compress leaf blocks of an index is performed on a per block basis. Thus, for example, some leaf blocks of the index may be compressed while other leaf blocks of the index may be uncompressed. As another example, different leaf blocks of an index may be compressed a different amount. In one technique, a set of index entries is identified for storage in a leaf block. Multiple estimates of potential space savings are calculated for compressing the set of index entries, one estimate for each different variation of a compression technique. The compression technique variation that is associated with the most space savings is selected and applied to the set of index entries. Thus, some techniques prevent negative compression altogether. Additionally, users require no knowledge of the underlying data to perform optimal compression.1. A method comprising:
identifying a first plurality of index entries that are to be stored in a first leaf block of a plurality of leaf blocks of an index; determining whether to compress the first plurality of index entries; identifying a second plurality of index entries that are to be stored in a second leaf block of the plurality of leaf blocks of the index; determining whether to compress the second plurality of index entries; wherein the method is performed by one or more computing devices. 2. The method of claim 1, further comprising:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; determining not to compress the second plurality of index entries that are to be stored in the second leaf block. 3. The method of claim 1, wherein:
determining whether to compress the first plurality of index entries of the first leaf block comprises determining whether compressing the first plurality of index entries would require more storage than not compressing the first plurality of index entries. 4. The method of claim 1, further comprising:
identifying, for compression, a first set of one or more columns of the first plurality of index entries that are to be stored in the first leaf block; identifying, for compression, a second set of one or more columns of the second plurality of index entries that are to be stored in the second leaf block; wherein the number of columns in the first set is different than the number of columns in the second set. 5. The method of claim 1, further comprising:
storing, in the first leaf block of the plurality of leaf blocks, a first plurality of compressed indexed entries and first prefix information for a first number of columns; after storing the first plurality of compressed indexed entries and the first prefix information in the first leaf block, storing, in the first leaf block, instead of the first plurality of compressed indexed entries and the first prefix information, a second plurality of compressed indexed entries and second prefix information for a second number of columns that is different than the first number of columns. 6. The method of claim 1, further comprising:
receiving a particular index entry that is to be inserted into one of the plurality of leaf blocks; identifying a particular leaf block, of the plurality of leaf blocks, in which to insert the particular index entry; wherein the particular leaf block stores information about a plurality of index entries; determining whether the particular leaf block contains enough available storage space to store the information and the particular index entry. 7. The method of claim 6, further comprising:
in response to determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, analyzing the plurality of index entries and the particular index entry to determine whether applying a prefix compression technique would allow the plurality of index entries and the particular index entry to be stored in the particular leaf block. 8. The method of claim 6, further comprising:
after determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, determining to split the particular leaf block into a first particular leaf block and a second particular leaf block, wherein the first particular leaf block and the second particular leaf block have the same size as the particular leaf block; storing a first subset of the plurality of index entries in the first particular leaf block; storing a second subset of the plurality of index entries in the second particular leaf block; inserting the particular index entry into the first particular leaf block or the second particular leaf block. 9. The method of claim 1, further comprising:
storing, within a particular leaf block of the plurality of leaf blocks, an overhead array that comprises a plurality of entries that includes a first entry and a second entry, wherein the first entry includes a first prefix count and the second entry includes a second prefix count; locating a particular index entry in the particular leaf block by using the first prefix count and the second prefix count. 10. The method of claim 9, wherein:
the first entry also includes an offset; locating the particular index entry in the particular leaf block by also using the offset. 11. The method of claim 1, further comprising:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; compressing the first plurality of index entries; prior to durably storing the first plurality of index entries in the first leaf block, determining whether one or more additional index entries that are not in the first plurality of index entries may be stored in the first leaf block; in response to determining that the one or more additional index entries may be stored in the first leaf block, compressing the one or more additional index entries and storing the one or more additional index entries in the first leaf block. 12. One or more non-transitory storage media storing instructions which, when executed by one or more computing devices, cause:
identifying a first plurality of index entries that are to be stored in a first leaf block of a plurality of leaf blocks of an index; determining whether to compress the first plurality of index entries; identifying a second plurality of index entries that are to be stored in a second leaf block of the plurality of leaf blocks of the index; determining whether to compress the second plurality of index entries. 13. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the or more processors, further cause:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; determining not to compress the second plurality of index entries that are to be stored in the second leaf block. 14. The one or more non-transitory storage media of claim 12, wherein:
determining whether to compress the first plurality of index entries of the first leaf block comprises determining whether compressing the first plurality of index entries would require more storage than not compressing the first plurality of index entries. 15. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
identifying, for compression, a first set of one or more columns of the first plurality of index entries that are to be stored in the first leaf block; identifying, for compression, a second set of one or more columns of the second plurality of index entries that are to be stored in the second leaf block; wherein the number of columns in the first set is different than the number of columns in the second set. 16. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
storing, in the first leaf block of the plurality of leaf blocks, a first plurality of compressed indexed entries and first prefix information for a first number of columns; after storing the first plurality of compressed indexed entries and the first prefix information in the first leaf block, storing, in the first leaf block, instead of the first plurality of compressed indexed entries and the first prefix information, a second plurality of compressed indexed entries and second prefix information for a second number of columns that is different than the first number of columns. 17. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
receiving a particular index entry that is to be inserted into one of the plurality of leaf blocks; identifying a particular leaf block, of the plurality of leaf blocks, in which to insert the particular index entry; wherein the particular leaf block stores information about a plurality of index entries; determining whether the particular leaf block contains enough available storage space to store the information and the particular index entry. 18. The one or more non-transitory storage media of claim 17, wherein the instructions, when executed by the one or more processors, further cause:
in response to determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, analyzing the plurality of index entries and the particular index entry to determine whether applying a prefix compression technique would allow the plurality of index entries and the particular index entry to be stored in the particular leaf block. 19. The one or more non-transitory storage media of claim 17, wherein the instructions, when executed by the one or more processors, further cause:
after determining that the particular leaf block does not contain enough available storage space to store the information and the particular index entry, determining to split the particular leaf block into a first particular leaf block and a second particular leaf block, wherein the first particular leaf block and the second particular leaf block have the same size as the particular leaf block; storing a first subset of the plurality of index entries in the first particular leaf block; storing a second subset of the plurality of index entries in the second particular leaf block; inserting the particular index entry into the first particular leaf block or the second particular leaf block. 20. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
storing, within a particular leaf block of the plurality of leaf blocks, an overhead array that comprises a plurality of entries that includes a first entry and a second entry, wherein the first entry includes a first prefix count and the second entry includes a second prefix count; locating a particular index entry in the particular leaf block by using the first prefix count and the second prefix count. 21. The one or more non-transitory storage media of claim 20, wherein:
the first entry also includes an offset; locating the particular index entry in the particular leaf block by also using the offset. 22. The one or more non-transitory storage media of claim 12, wherein the instructions, when executed by the one or more processors, further cause:
determining to compress the first plurality of index entries that are to be stored in the first leaf block; compressing the first plurality of index entries; prior to durably storing the first plurality of index entries in the first leaf block, determining whether one or more additional index entries that are not in the first plurality of index entries may be stored in the first leaf block; in response to determining that the one or more additional index entries may be stored in the first leaf block, compressing the one or more additional index entries and storing the one or more additional index entries in the first leaf block. | 2,100 |
4,422 | 14,471,871 | 2,138 | A method and apparatus are provided for generating an adjusted internal electrical parameter for accessing a NAND Flash memory array based on an adjustment control parameter conveyed by a memory access instruction, where the memory access instruction is compliant with an Open NAND Flash Interface (ONFI) protocol to include a two command cycle sequence to specify a command for accessing the NAND Flash memory with the adjusted internal electrical parameter. | 1. A method comprising:
receiving a memory access instruction for accessing a non-volatile memory array; generating an adjusted internal electrical parameter for accessing the non-volatile memory array based on an adjustment control parameter conveyed by the memory access instruction, and accessing the non-volatile memory array using the adjusted internal electrical parameter. 2. The method of claim 1, where receiving the memory access instruction comprises receiving a memory access instruction for accessing a NAND Flash memory which is compliant with an Open NAND Flash Interface (ONFI) protocol, where the memory access instruction comprises a two command cycle sequence to specify a command for accessing the NAND Flash memory. 3. The method of claim 1, where generating the adjusted internal electrical parameter comprises increasing by a predetermined increment one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array during a read operation for accessing the non-volatile memory array, where the predetermined increment corresponds to the adjustment control parameter conveyed by the memory access instruction. 4. The method of claim 1, where generating the adjusted internal electrical parameter comprises decreasing by a predetermined decrement one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array during a read operation for accessing the non-volatile memory array, where the predetermined decrement corresponds to the adjustment control parameter conveyed by the memory access instruction. 5. The method of claim 1, where generating the adjusted internal electrical parameter comprises applying a temperature compensation adjustment to one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array during a read operation for accessing the non-volatile memory array, where the temperature compensation adjustment corresponds to the adjustment control parameter conveyed by the memory access instruction. 6. The method of claim 1, where generating the adjusted internal electrical parameter comprises increasing, by a predetermined increment, an erase margin that is applied to a block of bitcells in the non-volatile memory array during an erase operation for accessing the non-volatile memory array, where the predetermined increment corresponds to the adjustment control parameter conveyed by the memory access instruction. 7. The method of claim 1, where generating the adjusted internal electrical parameter comprises decreasing, by a predetermined decrement, an erase margin that is applied to a block of bitcells in the non-volatile memory array during an erase operation for accessing the non-volatile memory array, where the predetermined decrement corresponds to the adjustment control parameter conveyed by the memory access instruction. 8. The method of claim 1, where generating the adjusted internal electrical parameter comprises applying a temperature compensation adjustment to an erase margin that is applied to a block of bitcells in the non-volatile memory array during an erase operation for accessing the non-volatile memory array, where the temperature compensation adjustment corresponds to the adjustment control parameter conveyed by the memory access instruction. 9. The method of claim 1, where generating the adjusted internal electrical parameter comprises increasing, by a predetermined increment, a program margin that is applied to a page of bitcells in the non-volatile memory array during a program operation for accessing the non-volatile memory array, where the predetermined increment corresponds to the adjustment control parameter conveyed by the memory access instruction. 10. The method of claim 1, where generating the adjusted internal electrical parameter comprises decreasing, by a predetermined decrement, a program margin that is applied to a page of bitcells in the non-volatile memory array during a program operation for accessing the non-volatile memory array, where the predetermined decrement corresponds to the adjustment control parameter conveyed by the memory access instruction. 11. The method of claim 1, where generating the adjusted internal electrical parameter comprises applying a temperature compensation adjustment to a program margin that is applied to a page of bitcells in the non-volatile memory array during a program operation for accessing the non-volatile memory array, where the temperature compensation adjustment corresponds to the adjustment control parameter conveyed by the memory access instruction. 12. A device comprising:
a power supply unit for generating a supply voltage; a non-volatile memory array comprising one or more line driver circuits and a plurality of sets of bit cells arranged in rows and columns, the non-volatile memory array adapted to receive the supply voltage at the one or more line driver circuits; and a controller adapted to receive a memory access instruction for accessing the non-volatile memory array which comprises a control code, the controller adapted to provide a control signal to the power supply unit for adjusting the supply voltage generated by the power supply unit based on the control code. 13. The device of claim 12, wherein the power supply unit is a charge pump circuit. 14. The device of claim 12, where the memory access instruction comprises a memory access instruction which is compliant with an Open NAND Flash Interface (ONFI) protocol for accessing a NAND Flash memory. 15. The device of claim 12, where the controller provides a control signal to the power supply unit to increase by a predetermined increment one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array, where the predetermined increment corresponds to a first control code in the memory access instruction. 16. The device of claim 12, where the controller provides a control signal to the power supply unit to decrease by a predetermined decrement one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array, where the predetermined decrement corresponds to a second control code in the memory access instruction. 17. The device of claim 12, where the controller provides a control signal to the power supply unit to increase by a predetermined increment an erase margin that is applied to a block of multi-level bitcells in the non-volatile memory array, where the predetermined increment corresponds to a third control code in the memory access instruction. 18. The device of claim 12, where the controller provides a control signal to the power supply unit to decrease by a predetermined decrement an erase margin that is applied to a block of multi-level bitcells in the non-volatile memory array, where the predetermined decrement corresponds to a fourth control code in the memory access instruction. 19. The device of claim 12, where the controller provides a control signal to the power supply unit to increase by a predetermined increment a program margin that is applied to a page of multi-level bitcells in the non-volatile memory array, where the predetermined increment corresponds to a fifth control code in the memory access instruction. 20. The device of claim 12, where the controller provides a control signal to the power supply unit to decrease by a predetermined decrement a program margin that is applied to a page of multi-level bitcells in the non-volatile memory array, where the predetermined decrement corresponds to a sixth control code in the memory access instruction. | A method and apparatus are provided for generating an adjusted internal electrical parameter for accessing a NAND Flash memory array based on an adjustment control parameter conveyed by a memory access instruction, where the memory access instruction is compliant with an Open NAND Flash Interface (ONFI) protocol to include a two command cycle sequence to specify a command for accessing the NAND Flash memory with the adjusted internal electrical parameter.1. A method comprising:
receiving a memory access instruction for accessing a non-volatile memory array; generating an adjusted internal electrical parameter for accessing the non-volatile memory array based on an adjustment control parameter conveyed by the memory access instruction, and accessing the non-volatile memory array using the adjusted internal electrical parameter. 2. The method of claim 1, where receiving the memory access instruction comprises receiving a memory access instruction for accessing a NAND Flash memory which is compliant with an Open NAND Flash Interface (ONFI) protocol, where the memory access instruction comprises a two command cycle sequence to specify a command for accessing the NAND Flash memory. 3. The method of claim 1, where generating the adjusted internal electrical parameter comprises increasing by a predetermined increment one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array during a read operation for accessing the non-volatile memory array, where the predetermined increment corresponds to the adjustment control parameter conveyed by the memory access instruction. 4. The method of claim 1, where generating the adjusted internal electrical parameter comprises decreasing by a predetermined decrement one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array during a read operation for accessing the non-volatile memory array, where the predetermined decrement corresponds to the adjustment control parameter conveyed by the memory access instruction. 5. The method of claim 1, where generating the adjusted internal electrical parameter comprises applying a temperature compensation adjustment to one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array during a read operation for accessing the non-volatile memory array, where the temperature compensation adjustment corresponds to the adjustment control parameter conveyed by the memory access instruction. 6. The method of claim 1, where generating the adjusted internal electrical parameter comprises increasing, by a predetermined increment, an erase margin that is applied to a block of bitcells in the non-volatile memory array during an erase operation for accessing the non-volatile memory array, where the predetermined increment corresponds to the adjustment control parameter conveyed by the memory access instruction. 7. The method of claim 1, where generating the adjusted internal electrical parameter comprises decreasing, by a predetermined decrement, an erase margin that is applied to a block of bitcells in the non-volatile memory array during an erase operation for accessing the non-volatile memory array, where the predetermined decrement corresponds to the adjustment control parameter conveyed by the memory access instruction. 8. The method of claim 1, where generating the adjusted internal electrical parameter comprises applying a temperature compensation adjustment to an erase margin that is applied to a block of bitcells in the non-volatile memory array during an erase operation for accessing the non-volatile memory array, where the temperature compensation adjustment corresponds to the adjustment control parameter conveyed by the memory access instruction. 9. The method of claim 1, where generating the adjusted internal electrical parameter comprises increasing, by a predetermined increment, a program margin that is applied to a page of bitcells in the non-volatile memory array during a program operation for accessing the non-volatile memory array, where the predetermined increment corresponds to the adjustment control parameter conveyed by the memory access instruction. 10. The method of claim 1, where generating the adjusted internal electrical parameter comprises decreasing, by a predetermined decrement, a program margin that is applied to a page of bitcells in the non-volatile memory array during a program operation for accessing the non-volatile memory array, where the predetermined decrement corresponds to the adjustment control parameter conveyed by the memory access instruction. 11. The method of claim 1, where generating the adjusted internal electrical parameter comprises applying a temperature compensation adjustment to a program margin that is applied to a page of bitcells in the non-volatile memory array during a program operation for accessing the non-volatile memory array, where the temperature compensation adjustment corresponds to the adjustment control parameter conveyed by the memory access instruction. 12. A device comprising:
a power supply unit for generating a supply voltage; a non-volatile memory array comprising one or more line driver circuits and a plurality of sets of bit cells arranged in rows and columns, the non-volatile memory array adapted to receive the supply voltage at the one or more line driver circuits; and a controller adapted to receive a memory access instruction for accessing the non-volatile memory array which comprises a control code, the controller adapted to provide a control signal to the power supply unit for adjusting the supply voltage generated by the power supply unit based on the control code. 13. The device of claim 12, wherein the power supply unit is a charge pump circuit. 14. The device of claim 12, where the memory access instruction comprises a memory access instruction which is compliant with an Open NAND Flash Interface (ONFI) protocol for accessing a NAND Flash memory. 15. The device of claim 12, where the controller provides a control signal to the power supply unit to increase by a predetermined increment one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array, where the predetermined increment corresponds to a first control code in the memory access instruction. 16. The device of claim 12, where the controller provides a control signal to the power supply unit to decrease by a predetermined decrement one or more read reference voltages that are applied to a gate of a multi-level cell (MLC) in the non-volatile memory array, where the predetermined decrement corresponds to a second control code in the memory access instruction. 17. The device of claim 12, where the controller provides a control signal to the power supply unit to increase by a predetermined increment an erase margin that is applied to a block of multi-level bitcells in the non-volatile memory array, where the predetermined increment corresponds to a third control code in the memory access instruction. 18. The device of claim 12, where the controller provides a control signal to the power supply unit to decrease by a predetermined decrement an erase margin that is applied to a block of multi-level bitcells in the non-volatile memory array, where the predetermined decrement corresponds to a fourth control code in the memory access instruction. 19. The device of claim 12, where the controller provides a control signal to the power supply unit to increase by a predetermined increment a program margin that is applied to a page of multi-level bitcells in the non-volatile memory array, where the predetermined increment corresponds to a fifth control code in the memory access instruction. 20. The device of claim 12, where the controller provides a control signal to the power supply unit to decrease by a predetermined decrement a program margin that is applied to a page of multi-level bitcells in the non-volatile memory array, where the predetermined decrement corresponds to a sixth control code in the memory access instruction. | 2,100 |
4,423 | 14,561,204 | 2,135 | According to one general aspect, an apparatus may include a processor, a heterogeneous memory system, and a memory interconnect. The processor may be configured to perform a data access on data stored in a memory system. The heterogeneous memory system may include a plurality of types of storage mediums. Each type of storage medium may be based upon a respective memory technology and may be associated with one or more performance characteristics. The heterogeneous memory system may include both volatile and non-volatile storage mediums. The memory interconnect may be configured to route the data access from the processor to at least one of the storage mediums based, at least in part, upon the one or more performance characteristic associated with the respective memory technologies of the storage media. | 1. An apparatus comprising:
a processor configured to perform a data access on data stored in a memory system; a heterogeneous memory system comprising a plurality of types of storage mediums, wherein each type of storage medium is based upon a respective memory technology and is associated with one or more performance characteristics, and wherein the heterogeneous memory system comprises both volatile and non-volatile storage mediums; and a memory interconnect configured to route the data access from the processor to at least one of the storage mediums based, at least in part, upon the one or more performance characteristic associated with the respective memory technologies of the storage media. 2. The apparatus of claim 1, wherein the processor is configured to employ a unified access protocol regardless of the type of storage medium employed to store the data. 3. The apparatus of claim 2, wherein the memory interconnect is configured to translate the data access from the unified access protocol employed by the processor to a storage medium specific protocol employed by the storage medium employed to store the data. 4. The apparatus of claim 1, wherein the heterogeneous memory system includes a volatile system memory storage medium and a non-volatile secondary storage medium. 5. The apparatus of claim 1, wherein the plurality of types of storage mediums are based upon two or more different memory technologies. 6. The apparatus of claim 1, wherein the processor is configured to indicate, via the data access, a data category associated with the data stored in a memory system; and
wherein the memory interconnect is configured to preferentially route the data to one of the plurality of types of storage mediums based upon the data category. 7. The apparatus of claim 6, wherein the data category associated with the data is set during a compilation of a software program that, when executed by the processor, accesses the data. 8. The apparatus of claim 1, wherein the memory interconnect is configured to organize at least a portion of the plurality of types of storage mediums into a hierarchy of storage medium tiers based, at least in part upon, the one or more performance characteristics associated with each type of storage medium. 9. The apparatus of claim 8, wherein the memory interconnect is configured to organize the hierarchy of storage medium tiers into a layered caching memory system. 10. The apparatus of claim 8, wherein the memory interconnect is configured to dynamically re-organize the hierarchy of storage medium tiers when the apparatus experiences a triggering event. 11. A method comprising:
receiving, from a processor, a data access for a heterogeneous memory system, wherein the heterogeneous memory system comprises a plurality of types of storage mediums, wherein each type of storage medium is based upon a respective memory technology and is associated with one or more performance characteristic; determining, by a memory interconnect, a target storage medium of the heterogeneous memory system for the data access based, at least in part, upon at least one performance characteristic associated with the target storage medium; and routing, by the memory interconnect, the data access, at least partially, between the processor and the target storage medium. 12. The method of claim 11, wherein receiving the data access from the processor comprises:
receiving a data accesses for a first group of one or more storage mediums via a first access protocol, and receiving a data accesses for a second group of one or more storage mediums via a second access protocol. 13. The method of claim 11, further comprising organizing at least a portion of the plurality of types of storage mediums into a hierarchy of storage medium tiers based, at least in part upon, the one or more performance characteristic associated with each type of storage medium. 14. The method of claim 13, wherein organizing includes organizing the hierarchy of storage medium tiers into a layered caching memory system,
wherein organizing the hierarchy of storage medium tiers into a layered caching memory system includes monitoring the data contents of each storage medium within the layered caching memory system, and wherein determining includes determining which, if any, storage mediums, include a piece of data associated with the data access. 15. The method of claim 13, wherein organizing includes organizing the hierarchy of storage medium tiers into a layered caching memory system,
further including mirroring the piece of data within a non-volatile layer of the layered caching memory system, if the highest layer of the layered caching memory system that includes the piece of data associated includes a volatile storage medium. 16. An apparatus comprising:
a processor interface configured to receive a data access directed for a heterogeneous memory system; a plurality of storage medium interfaces, each configured to communicate with at least one storage medium of the heterogeneous memory system, and each storage medium interface associated with at least one performance characteristic, wherein the heterogeneous memory system comprises a plurality of types of storage mediums; and a memory controller configured to route the data access from the processor interface to a one of the plurality of storage medium interfaces based, at least in part, upon at least one performance characteristic associated with the one of the plurality of storage medium interfaces. 17. The apparatus of claim 16, further comprising:
at least one accelerator processor configured to assist the memory controller route the data access from the processor interface to a one of the plurality of storage medium interfaces. 18. The apparatus of claim 17, wherein the at least one accelerator processor includes an encryption circuit configured to encrypt at least a data portion of the data access before the data access is routed to the one of the plurality of storage medium interfaces. 19. The apparatus of claim 17, wherein the at least one accelerator processor includes protocol translation circuit configured to translate the data access from a first communications protocol to a second communication protocol, before the data access is routed to the one of the plurality of storage medium interfaces. 20. The apparatus of claim 17, wherein the at least one accelerator processor includes a cache organizer circuit configured to:
organize the heterogeneous memory system into a layered caching memory system, maintain an inventory of the layered caching memory system, and providing information regarding the layered caching memory system to the memory controller; and wherein the memory controller is configured to select the one of the plurality of storage medium interfaces based, at least in part, upon the information regarding the layered caching memory system provided by the cache organizer circuit. 21-40. (canceled) | According to one general aspect, an apparatus may include a processor, a heterogeneous memory system, and a memory interconnect. The processor may be configured to perform a data access on data stored in a memory system. The heterogeneous memory system may include a plurality of types of storage mediums. Each type of storage medium may be based upon a respective memory technology and may be associated with one or more performance characteristics. The heterogeneous memory system may include both volatile and non-volatile storage mediums. The memory interconnect may be configured to route the data access from the processor to at least one of the storage mediums based, at least in part, upon the one or more performance characteristic associated with the respective memory technologies of the storage media.1. An apparatus comprising:
a processor configured to perform a data access on data stored in a memory system; a heterogeneous memory system comprising a plurality of types of storage mediums, wherein each type of storage medium is based upon a respective memory technology and is associated with one or more performance characteristics, and wherein the heterogeneous memory system comprises both volatile and non-volatile storage mediums; and a memory interconnect configured to route the data access from the processor to at least one of the storage mediums based, at least in part, upon the one or more performance characteristic associated with the respective memory technologies of the storage media. 2. The apparatus of claim 1, wherein the processor is configured to employ a unified access protocol regardless of the type of storage medium employed to store the data. 3. The apparatus of claim 2, wherein the memory interconnect is configured to translate the data access from the unified access protocol employed by the processor to a storage medium specific protocol employed by the storage medium employed to store the data. 4. The apparatus of claim 1, wherein the heterogeneous memory system includes a volatile system memory storage medium and a non-volatile secondary storage medium. 5. The apparatus of claim 1, wherein the plurality of types of storage mediums are based upon two or more different memory technologies. 6. The apparatus of claim 1, wherein the processor is configured to indicate, via the data access, a data category associated with the data stored in a memory system; and
wherein the memory interconnect is configured to preferentially route the data to one of the plurality of types of storage mediums based upon the data category. 7. The apparatus of claim 6, wherein the data category associated with the data is set during a compilation of a software program that, when executed by the processor, accesses the data. 8. The apparatus of claim 1, wherein the memory interconnect is configured to organize at least a portion of the plurality of types of storage mediums into a hierarchy of storage medium tiers based, at least in part upon, the one or more performance characteristics associated with each type of storage medium. 9. The apparatus of claim 8, wherein the memory interconnect is configured to organize the hierarchy of storage medium tiers into a layered caching memory system. 10. The apparatus of claim 8, wherein the memory interconnect is configured to dynamically re-organize the hierarchy of storage medium tiers when the apparatus experiences a triggering event. 11. A method comprising:
receiving, from a processor, a data access for a heterogeneous memory system, wherein the heterogeneous memory system comprises a plurality of types of storage mediums, wherein each type of storage medium is based upon a respective memory technology and is associated with one or more performance characteristic; determining, by a memory interconnect, a target storage medium of the heterogeneous memory system for the data access based, at least in part, upon at least one performance characteristic associated with the target storage medium; and routing, by the memory interconnect, the data access, at least partially, between the processor and the target storage medium. 12. The method of claim 11, wherein receiving the data access from the processor comprises:
receiving a data accesses for a first group of one or more storage mediums via a first access protocol, and receiving a data accesses for a second group of one or more storage mediums via a second access protocol. 13. The method of claim 11, further comprising organizing at least a portion of the plurality of types of storage mediums into a hierarchy of storage medium tiers based, at least in part upon, the one or more performance characteristic associated with each type of storage medium. 14. The method of claim 13, wherein organizing includes organizing the hierarchy of storage medium tiers into a layered caching memory system,
wherein organizing the hierarchy of storage medium tiers into a layered caching memory system includes monitoring the data contents of each storage medium within the layered caching memory system, and wherein determining includes determining which, if any, storage mediums, include a piece of data associated with the data access. 15. The method of claim 13, wherein organizing includes organizing the hierarchy of storage medium tiers into a layered caching memory system,
further including mirroring the piece of data within a non-volatile layer of the layered caching memory system, if the highest layer of the layered caching memory system that includes the piece of data associated includes a volatile storage medium. 16. An apparatus comprising:
a processor interface configured to receive a data access directed for a heterogeneous memory system; a plurality of storage medium interfaces, each configured to communicate with at least one storage medium of the heterogeneous memory system, and each storage medium interface associated with at least one performance characteristic, wherein the heterogeneous memory system comprises a plurality of types of storage mediums; and a memory controller configured to route the data access from the processor interface to a one of the plurality of storage medium interfaces based, at least in part, upon at least one performance characteristic associated with the one of the plurality of storage medium interfaces. 17. The apparatus of claim 16, further comprising:
at least one accelerator processor configured to assist the memory controller route the data access from the processor interface to a one of the plurality of storage medium interfaces. 18. The apparatus of claim 17, wherein the at least one accelerator processor includes an encryption circuit configured to encrypt at least a data portion of the data access before the data access is routed to the one of the plurality of storage medium interfaces. 19. The apparatus of claim 17, wherein the at least one accelerator processor includes protocol translation circuit configured to translate the data access from a first communications protocol to a second communication protocol, before the data access is routed to the one of the plurality of storage medium interfaces. 20. The apparatus of claim 17, wherein the at least one accelerator processor includes a cache organizer circuit configured to:
organize the heterogeneous memory system into a layered caching memory system, maintain an inventory of the layered caching memory system, and providing information regarding the layered caching memory system to the memory controller; and wherein the memory controller is configured to select the one of the plurality of storage medium interfaces based, at least in part, upon the information regarding the layered caching memory system provided by the cache organizer circuit. 21-40. (canceled) | 2,100 |
4,424 | 14,209,582 | 2,176 | A number of supplemental media content selection periods may be identified within a narrative presentation consisting of a defined number and sequence of scenes. Within each of the supplemental media content selection periods, a number of selectable indicators, each corresponding to an associated aspect of inner awareness of a character included in the narrative may be provided. The aspects of inner awareness may include a thought or cognitive activity of the respective character, an emotion or emotional process of the respective character, or an instinct or bodily perception of the narrative character. Upon selecting a selectable indicator, a supplemental media content presentation logically associated with the aspect of inner awareness of the respective character is provided to a media content consumer. A media editing system can provide various options for transitioning between the narrative presentation and each of the supplemental media content presentations. | 1. A method for editing at least one supplemental media content presentation into a narrative presentation consisting of a defined sequence of scenes using a processor-based media editing system, the method comprising:
identifying over the course of the narrative presentation a number of supplemental media content selection periods during which at least one supplemental media content presentation is available, each of the selection periods having a respective start point, duration, and end point in the narrative presentation; for each of the supplemental media content selection periods, providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period,
each selectable indicator representative of an aspect of inner awareness associated with each of a number of characters; and
each selectable indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer; and
for each supplemental media content presentation, identifying at least one respective transition mode between the narrative presentation and each supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the narrative presentation and the respective supplemental media content presentation. 2. The method of claim 1, further comprising:
identifying over the course of at least one supplemental media content presentation a number of subordinate supplemental media content selection periods during which at least one subordinate supplemental media content presentation is available, each subordinate supplemental media content selection period having a respective start point, duration, and end point in the respective supplemental media content presentation; for each of the subordinate supplemental media content selection periods, providing a number of media content consumer perceptible and selectable indicators in the supplemental media content presentation during all or a portion of the respective subordinate supplemental media content selection period;
each indicator representative of an aspect of inner awareness for each of a number of characters included in the supplemental media content presentation; and
each indicator logically associated with a respective subordinate supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character included in the supplemental media content presentation at a point in the supplemental media content presentation selected by the media content consumer; and
for each subordinate supplemental media content presentation, identifying at least one respective transition mode between the supplemental media content presentation and each subordinate supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the supplemental media content presentation and the respective subordinate supplemental media content presentation. 3. The method of claim 1, further comprising:
identifying a temporal transition relationship between a departure transition event from the narrative presentation to the supplemental media content presentation and return transition event from the supplemental media content presentation to the narrative presentation. 4. The method of claim 3 wherein identifying a temporal transition relationship between the departure transition event from the narrative presentation to the supplemental media content presentation and the return transition event from the supplemental media content presentation to the narrative presentation comprises one of:
identifying the temporal transition relationship that causes the return transition event to return to the narrative presentation at a point in the narrative when the departure transition event occurred; or
identifying the temporal transition relationship that causes the return transition event to return to the narrative presentation at a defined point in the narrative presentation prior to when the departure transition event occurred. 5. The method of claim 3 wherein identifying a temporal transition relationship between the departure transition event from the narrative presentation to the supplemental media content presentation and the return transition event from the supplemental media content presentation to the narrative presentation comprises:
identifying the temporal transition relationship that causes the return transition event to autonomously return to the narrative presentation at the start point of the respective supplemental media content selection period responsive to a selection of a supplemental media content presentation by a media content user within a defined interval prior to the end point of the respective supplemental media content selection period. 6. The method of claim 1 wherein identifying at least one respective transition mode between the narrative presentation and each supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the supplemental media content presentation and the respective subordinate supplemental media content presentation comprises at least one of:
specifying the transition effect causing a decrease in size of a narrative display area and a contemporaneous increase in size of a supplemental media content display area; and
specifying the transition effect causing a reduction in intensity of a narrative display area and a contemporaneous increase in intensity of a supplemental media content display area. 7. The method of claim 1, further comprising:
for each supplemental media content selection period, selecting a standby mode entered by the narrative presentation while a supplemental media content presentation is provided to a media content consumer. 8. The method of claim 7 wherein selecting a standby mode comprises selecting at least one of:
the standby mode that causes the narrative presentation to halt during the supplemental media content presentation;
the standby mode that causes at least a portion of the narrative existent between a defined start point and a defined end point within the respective supplemental media content selection period to cyclically loop during the supplemental media content presentation; or
the narrative presentation standby mode that causes the narrative presentation to progress at a reduced frame rate during the supplemental media content presentation. 9. The method of claim 1, further comprising:
for each supplemental media content selection period, selecting at least one character included in the narrative presentation, each selected character having at least one associated supplemental media content presentation logically associated with an aspect of inner awareness of the respective character; and autonomously identifying each of the selected characters by the processor-based media editing system for at least a portion of the duration of the respective supplemental media content selection period. 10. The method of claim 9 wherein autonomously identifying each of the selected characters by the processor-based media editing system for at least a portion of the duration of the respective supplemental media content selection period comprises:
autonomously identifying each of the selected characters using a processor-based facial recognition. 11. The method of claim 1, further comprising:
for each of the supplemental media content selection periods, providing a number of media content consumer perceptible, non-selectable, indicators in the narrative presentation,
each non-selectable indicator representative of an aspect of inner awareness for each of the number of characters; and
each non-selectable indicator logically associated with a respective supplemental media content presentation previously accessed by the media content consumer during the respective supplemental media content selection period. 12. The method of claim 1 wherein for each of the supplemental media content selection periods, providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of one aspect of inner awareness for each of a number of characters comprises:
providing a number of selectable indicators, each representative an aspect of inner awareness that includes at least:
the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character;
the aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and
the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character. 13. The method of claim 12 wherein providing a selectable indicator representative of an aspect of inner awareness that includes at least: an aspect of inner awareness corresponding to a thought or cognitive activity of the respective character; an aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and an aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character comprises at least one of:
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of a narrative character on or about a first portion of a representation of the respective character;
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of a narrative character on or about a second portion of a representation of the respective character; and
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of a narrative character on or about a third portion of a representation of the respective character. 14. The method of claim 12 wherein providing a selectable indicator representative of an aspect of inner awareness that includes at least: an aspect of inner awareness corresponding to a thought or cognitive activity of the respective character; an aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and an aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character comprises at least one of:
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character on or about a head portion of a representation of the respective character;
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of the respective character on or about a chest portion of a representation of the respective character; and
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character on or about an abdominal portion of a representation of the respective character. 15. The method of claim 1, further comprising:
selecting at least one display parameter for each of the number of selectable indicators. 16. The method of claim 15 wherein selecting at least one display parameter comprises:
selecting at least one display effect on or proximate at least one of:
a media content consumer selectable indicator including an icon logically associated with a supplemental media content presentation logically associated with the respective character; and
a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a character, the indicator logically associated with a supplemental media content presentation logically associated with the respective character. 17. The method of claim 16 wherein selecting at least one display effect includes selecting at least one of:
a change in display intensity;
a change in display color; and
a cyclical change in alternating portions of display location to cause a shimmer or halo effect. 18. The method of claim 16 wherein selecting at least one display effect on or proximate a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a narrative character comprises selecting at least one of:
a display effect directly on or proximate at least a portion of a representation of the respective character appearing in the narrative presentation; or
a display effect directly on or proximate at least a portion of a representation corresponding to the respective character appearing external to the narrative presentation. 19. The method of claim 15 wherein selecting at least one display parameter for each of the number of selectable indicators further comprises:
selecting a duration of the at least one display effect in the narrative presentation equal to a duration of the respective supplemental media content selection period; and
selecting a duration of the at least one display effect in the narrative presentation less than a duration of the respective supplemental media content selection period. 20. The method of claim 1, further comprising:
for each of the number of selectable indicators, identifying a media content consumer input indicative of a selection of the respective indicator. 21. The method of claim 20 wherein identifying a media content consumer input indicative of a selection of the respective indicator comprises at least one of:
identifying a non-contact, gesture based, input using a human hand or pointer to indicate selection of the respective indicator;
identifying a contact, touch based, input using a human hand or pointer to indicate selection of the respective indicator; and
identifying a pointer based input using a pointing device to indicate selection of the respective indicator. 22. The method of claim 1 wherein providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of an aspect of inner awareness for each of a number of characters included in the narrative; and each indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer; comprises:
providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of an aspect of inner awareness for each of at least two characters included in the narrative; and each indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer. 23. The method of claim 22, further comprising:
defining a presentation sequence for each of the number of supplemental media content presentations logically associated with each of the at least two characters included in the narrative presentation. 24. The method of claim 23 wherein defining a presentation sequence for the number of supplemental media content presentations logically associated each of the at least two narrative characters comprises:
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with a first character included in the narrative presentation prior to a presentation of any of the number of supplemental media content portions logically associated with a second character included in the narrative presentation. 25. The method of claim 24 wherein defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with a first character included in the narrative presentation prior to a presentation of any of the number of supplemental media content portions logically associated with a second character included in the narrative presentation comprises at least one of:
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for the duration of each supplemental media content period; or
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for a duration narrative presentation. 26. The method of claim 23 wherein defining a presentation sequence for the number of supplemental media content presentations logically associated each of the at least two narrative characters comprises:
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the second character included in the narrative presentation. 27. The method of claim 23 wherein defining a presentation sequence for the number of supplemental media content presentations logically associated each of the at least two characters included in the narrative comprises:
defining by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters. 28. The method of claim 27 wherein defining by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters comprises:
defining by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters corresponding to a selectable indicator selection sequence provided by the media content consumer. 29. A system for editing at least one supplemental media content presentation into a narrative presentation consisting of a defined sequence of scenes, the system comprising:
a first nontransitory storage including data representative of the narrative presentation and a number of supplemental media content presentations; at least one user interface; and at least one processor with machine executable instructions that when executed by the at least one processor, cause the at least one processor to provide a user with the ability via the at least one user interface to:
identify over the course of the narrative presentation a number of supplemental media content selection periods during which at least one supplemental media content presentation is available, each of the selection periods having a respective start point, duration, and end point in the narrative presentation;
for each of the supplemental media content selection periods, provide a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period,
each selectable indicator representative an aspect of inner awareness associated with each of a number of characters included in the narrative presentation; and
each indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer; and
for each supplemental media content presentation, identify at least one respective transition mode between the narrative presentation and each supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the narrative presentation and the respective supplemental media content presentation. 30. The system of claim 29, wherein the machine executable instructions further cause the at least one processor to provide a user with the ability via the user interface to:
identify over the course of at least one supplemental media content presentation a number of subordinate supplemental media content selection periods during which at least one subordinate supplemental media content presentation is available, each subordinate supplemental media content selection period having a respective start point, duration, and end point in the respective supplemental media content presentation; for each of the subordinate supplemental media content selection periods, provide a number of media content consumer perceptible and selectable indicators in the supplemental media content presentation during all or a portion of the respective subordinate supplemental media content selection period;
each selectable indicator representative of an aspect of inner awareness for each of a number of characters included in the respective supplemental media content presentation; and
each indicator logically associated with a respective subordinate supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the supplemental media content presentation selected by the media content consumer; and
for each supplemental media content presentation, identify at least one respective transition mode between the supplemental media content presentation and each subordinate supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the supplemental media content presentation and the respective subordinate supplemental media content presentation. 31. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide a user with the ability via the user interface to:
identify a temporal transition relationship between a departure transition event from the narrative presentation to the supplemental media content presentation and return transition event from the supplemental media content presentation to the narrative presentation. 32. The system of claim 31 wherein the temporal transition relationship comprises one of:
the temporal transition relationship that causes the return transition event to return to the narrative presentation at a point in the narrative when the departure transition event occurred; or
the temporal transition relationship that causes the return transition event to return to the narrative presentation at a defined point in the narrative presentation prior to when the departure transition event occurred. 33. The system of claim 31 wherein the temporal transition relationship comprises the relationship that causes the return transition event to autonomously return to the narrative presentation at the start point of the respective supplemental media content selection period responsive to a selection of a supplemental media content presentation by a media content user within a defined interval prior to the end point of the respective supplemental media content selection period. 34. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
specify the transition effect that causes a decrease in size of a narrative presentation display area and a contemporaneous increase in size of a supplemental media content presentation display area; and
specify the transition effect that causes a reduction in intensity of a narrative presentation display area and a contemporaneous increase in intensity of a supplemental media content presentation display area. 35. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each supplemental media content selection period, select a standby mode entered by the narrative presentation while a supplemental media content presentation is provided to a media content consumer. 36. The system of claim 35 wherein the standby mode comprises at least one of:
the standby mode that causes the narrative presentation to halt during the supplemental media content presentation;
the standby mode that causes at least a portion of the narrative existent between a defined start point and a defined end point within the respective supplemental media content selection period to cyclically loop during the supplemental media content presentation; or
the standby mode that causes the narrative presentation to progress at a reduced frame rate during the supplemental media content presentation. 37. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each supplemental media content selection period, select at least one character in the narrative presentation, each selected character having at least one associated supplemental media content presentation logically associated with an aspect of inner awareness; and
autonomously identify each of the selected characters using facial recognition for at least a portion of the duration of the respective supplemental media content selection period. 38. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each of the supplemental media content selection periods, provide a number of media content consumer perceptible, non-selectable, indicators in the narrative presentation,
each non-selectable indicator representative of an aspect of inner awareness for each of the number of narrative characters; and
each non-selectable indicator logically associated with a respective supplemental media content presentation previously accessed by the media content consumer during the respective supplemental media content selection period. 39. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide a selectable indicator representative of an aspect of inner awareness that includes at least:
the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character;
the aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and
providing in the narrative a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character. 40. The system of claim 39 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of a narrative character on or about a first portion of a representation of the respective character;
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of a narrative character on or about a second portion of a representation of the respective character; and
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of a narrative character on or about a third portion of a representation of the respective character. 41. The system of claim 39 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character on or about a head portion of a representation of the respective character;
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of the respective character on or about a chest portion of a representation of the respective character; and
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character on or about an abdominal portion of a representation of the respective character. 42. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display parameter for each of the number of selectable indicators. 43. The system of claim 42 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display effect on or proximate at least one of:
a media content consumer selectable indicator including an icon logically associated with a supplemental media content presentation logically associated with the respective character; and
a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a narrative character, the indicator logically associated with a supplemental media content presentation logically associated with the respective character. 44. The system of claim 43 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display effect that includes at least one of:
a change in display intensity;
a change in display color; and
a cyclical change in alternating portions of display location to cause a shimmer or halo effect. 45. The system of claim 43 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display effect on or proximate a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a character included in the narrative presentation including at least one of:
a display effect directly on or proximate at least a portion of a representation of the respective character included in the narrative presentation; or
a display effect directly on or proximate at least a portion of a representation of the respective character external to the narrative presentation. 46. The system of claim 42 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display parameter for each of the number of selectable indicators including at least one of:
a duration of the at least one display effect in the narrative presentation equal to a duration of the respective supplemental media content selection period; and
a duration of the at least one display effect in the narrative presentation less than a duration of the respective supplemental media content selection period. 47. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each of the number of selectable indicators, identify a media content consumer input indicative of a selection of the respective indicator. 48. The system of claim 47 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to identify a media content consumer input indicative of a selection of the respective indicator including at least one of:
a non-contact, gesture based, input using a human hand or pointer to indicate selection of the respective indicator;
a contact, touch based, input using a human hand or pointer to indicate selection of the respective indicator; and
a pointer based input using a pointing device to indicate selection of the respective indicator. 49. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of an aspect of inner awareness for each of at least two characters included in the narrative presentation; and each selectable indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer. 50. The system of claim 49 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence for each of the number of supplemental media content presentations logically associated with each of the at least two characters included in the narrative presentation. 51. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with a first character included in the narrative presentation prior to a presentation of any of the number of supplemental media content portions logically associated with a second character included in the narrative presentation. 52. The system of claim 51 wherein the presentation sequence includes at least one of:
a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for the duration of each supplemental media content period; or
a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for a duration of the narrative presentation. 53. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the second character included in the narrative presentation. 54. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters included in the narrative presentation. 55. The system of claim 54 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters included in the narrative presentation corresponding to a selectable indicator selection sequence provided by the media content consumer. 56. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence that causes the simultaneous presentation of a first supplemental media content presentation logically associated with a first character included in the narrative presentation during a supplemental media content selection period and a second supplemental media content presentation logically associated with a second character included in the narrative presentation during the supplemental media content selection period. | A number of supplemental media content selection periods may be identified within a narrative presentation consisting of a defined number and sequence of scenes. Within each of the supplemental media content selection periods, a number of selectable indicators, each corresponding to an associated aspect of inner awareness of a character included in the narrative may be provided. The aspects of inner awareness may include a thought or cognitive activity of the respective character, an emotion or emotional process of the respective character, or an instinct or bodily perception of the narrative character. Upon selecting a selectable indicator, a supplemental media content presentation logically associated with the aspect of inner awareness of the respective character is provided to a media content consumer. A media editing system can provide various options for transitioning between the narrative presentation and each of the supplemental media content presentations.1. A method for editing at least one supplemental media content presentation into a narrative presentation consisting of a defined sequence of scenes using a processor-based media editing system, the method comprising:
identifying over the course of the narrative presentation a number of supplemental media content selection periods during which at least one supplemental media content presentation is available, each of the selection periods having a respective start point, duration, and end point in the narrative presentation; for each of the supplemental media content selection periods, providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period,
each selectable indicator representative of an aspect of inner awareness associated with each of a number of characters; and
each selectable indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer; and
for each supplemental media content presentation, identifying at least one respective transition mode between the narrative presentation and each supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the narrative presentation and the respective supplemental media content presentation. 2. The method of claim 1, further comprising:
identifying over the course of at least one supplemental media content presentation a number of subordinate supplemental media content selection periods during which at least one subordinate supplemental media content presentation is available, each subordinate supplemental media content selection period having a respective start point, duration, and end point in the respective supplemental media content presentation; for each of the subordinate supplemental media content selection periods, providing a number of media content consumer perceptible and selectable indicators in the supplemental media content presentation during all or a portion of the respective subordinate supplemental media content selection period;
each indicator representative of an aspect of inner awareness for each of a number of characters included in the supplemental media content presentation; and
each indicator logically associated with a respective subordinate supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character included in the supplemental media content presentation at a point in the supplemental media content presentation selected by the media content consumer; and
for each subordinate supplemental media content presentation, identifying at least one respective transition mode between the supplemental media content presentation and each subordinate supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the supplemental media content presentation and the respective subordinate supplemental media content presentation. 3. The method of claim 1, further comprising:
identifying a temporal transition relationship between a departure transition event from the narrative presentation to the supplemental media content presentation and return transition event from the supplemental media content presentation to the narrative presentation. 4. The method of claim 3 wherein identifying a temporal transition relationship between the departure transition event from the narrative presentation to the supplemental media content presentation and the return transition event from the supplemental media content presentation to the narrative presentation comprises one of:
identifying the temporal transition relationship that causes the return transition event to return to the narrative presentation at a point in the narrative when the departure transition event occurred; or
identifying the temporal transition relationship that causes the return transition event to return to the narrative presentation at a defined point in the narrative presentation prior to when the departure transition event occurred. 5. The method of claim 3 wherein identifying a temporal transition relationship between the departure transition event from the narrative presentation to the supplemental media content presentation and the return transition event from the supplemental media content presentation to the narrative presentation comprises:
identifying the temporal transition relationship that causes the return transition event to autonomously return to the narrative presentation at the start point of the respective supplemental media content selection period responsive to a selection of a supplemental media content presentation by a media content user within a defined interval prior to the end point of the respective supplemental media content selection period. 6. The method of claim 1 wherein identifying at least one respective transition mode between the narrative presentation and each supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the supplemental media content presentation and the respective subordinate supplemental media content presentation comprises at least one of:
specifying the transition effect causing a decrease in size of a narrative display area and a contemporaneous increase in size of a supplemental media content display area; and
specifying the transition effect causing a reduction in intensity of a narrative display area and a contemporaneous increase in intensity of a supplemental media content display area. 7. The method of claim 1, further comprising:
for each supplemental media content selection period, selecting a standby mode entered by the narrative presentation while a supplemental media content presentation is provided to a media content consumer. 8. The method of claim 7 wherein selecting a standby mode comprises selecting at least one of:
the standby mode that causes the narrative presentation to halt during the supplemental media content presentation;
the standby mode that causes at least a portion of the narrative existent between a defined start point and a defined end point within the respective supplemental media content selection period to cyclically loop during the supplemental media content presentation; or
the narrative presentation standby mode that causes the narrative presentation to progress at a reduced frame rate during the supplemental media content presentation. 9. The method of claim 1, further comprising:
for each supplemental media content selection period, selecting at least one character included in the narrative presentation, each selected character having at least one associated supplemental media content presentation logically associated with an aspect of inner awareness of the respective character; and autonomously identifying each of the selected characters by the processor-based media editing system for at least a portion of the duration of the respective supplemental media content selection period. 10. The method of claim 9 wherein autonomously identifying each of the selected characters by the processor-based media editing system for at least a portion of the duration of the respective supplemental media content selection period comprises:
autonomously identifying each of the selected characters using a processor-based facial recognition. 11. The method of claim 1, further comprising:
for each of the supplemental media content selection periods, providing a number of media content consumer perceptible, non-selectable, indicators in the narrative presentation,
each non-selectable indicator representative of an aspect of inner awareness for each of the number of characters; and
each non-selectable indicator logically associated with a respective supplemental media content presentation previously accessed by the media content consumer during the respective supplemental media content selection period. 12. The method of claim 1 wherein for each of the supplemental media content selection periods, providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of one aspect of inner awareness for each of a number of characters comprises:
providing a number of selectable indicators, each representative an aspect of inner awareness that includes at least:
the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character;
the aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and
the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character. 13. The method of claim 12 wherein providing a selectable indicator representative of an aspect of inner awareness that includes at least: an aspect of inner awareness corresponding to a thought or cognitive activity of the respective character; an aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and an aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character comprises at least one of:
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of a narrative character on or about a first portion of a representation of the respective character;
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of a narrative character on or about a second portion of a representation of the respective character; and
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of a narrative character on or about a third portion of a representation of the respective character. 14. The method of claim 12 wherein providing a selectable indicator representative of an aspect of inner awareness that includes at least: an aspect of inner awareness corresponding to a thought or cognitive activity of the respective character; an aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and an aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character comprises at least one of:
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character on or about a head portion of a representation of the respective character;
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of the respective character on or about a chest portion of a representation of the respective character; and
providing in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character on or about an abdominal portion of a representation of the respective character. 15. The method of claim 1, further comprising:
selecting at least one display parameter for each of the number of selectable indicators. 16. The method of claim 15 wherein selecting at least one display parameter comprises:
selecting at least one display effect on or proximate at least one of:
a media content consumer selectable indicator including an icon logically associated with a supplemental media content presentation logically associated with the respective character; and
a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a character, the indicator logically associated with a supplemental media content presentation logically associated with the respective character. 17. The method of claim 16 wherein selecting at least one display effect includes selecting at least one of:
a change in display intensity;
a change in display color; and
a cyclical change in alternating portions of display location to cause a shimmer or halo effect. 18. The method of claim 16 wherein selecting at least one display effect on or proximate a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a narrative character comprises selecting at least one of:
a display effect directly on or proximate at least a portion of a representation of the respective character appearing in the narrative presentation; or
a display effect directly on or proximate at least a portion of a representation corresponding to the respective character appearing external to the narrative presentation. 19. The method of claim 15 wherein selecting at least one display parameter for each of the number of selectable indicators further comprises:
selecting a duration of the at least one display effect in the narrative presentation equal to a duration of the respective supplemental media content selection period; and
selecting a duration of the at least one display effect in the narrative presentation less than a duration of the respective supplemental media content selection period. 20. The method of claim 1, further comprising:
for each of the number of selectable indicators, identifying a media content consumer input indicative of a selection of the respective indicator. 21. The method of claim 20 wherein identifying a media content consumer input indicative of a selection of the respective indicator comprises at least one of:
identifying a non-contact, gesture based, input using a human hand or pointer to indicate selection of the respective indicator;
identifying a contact, touch based, input using a human hand or pointer to indicate selection of the respective indicator; and
identifying a pointer based input using a pointing device to indicate selection of the respective indicator. 22. The method of claim 1 wherein providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of an aspect of inner awareness for each of a number of characters included in the narrative; and each indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer; comprises:
providing a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of an aspect of inner awareness for each of at least two characters included in the narrative; and each indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer. 23. The method of claim 22, further comprising:
defining a presentation sequence for each of the number of supplemental media content presentations logically associated with each of the at least two characters included in the narrative presentation. 24. The method of claim 23 wherein defining a presentation sequence for the number of supplemental media content presentations logically associated each of the at least two narrative characters comprises:
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with a first character included in the narrative presentation prior to a presentation of any of the number of supplemental media content portions logically associated with a second character included in the narrative presentation. 25. The method of claim 24 wherein defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with a first character included in the narrative presentation prior to a presentation of any of the number of supplemental media content portions logically associated with a second character included in the narrative presentation comprises at least one of:
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for the duration of each supplemental media content period; or
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for a duration narrative presentation. 26. The method of claim 23 wherein defining a presentation sequence for the number of supplemental media content presentations logically associated each of the at least two narrative characters comprises:
defining a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the second character included in the narrative presentation. 27. The method of claim 23 wherein defining a presentation sequence for the number of supplemental media content presentations logically associated each of the at least two characters included in the narrative comprises:
defining by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters. 28. The method of claim 27 wherein defining by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters comprises:
defining by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters corresponding to a selectable indicator selection sequence provided by the media content consumer. 29. A system for editing at least one supplemental media content presentation into a narrative presentation consisting of a defined sequence of scenes, the system comprising:
a first nontransitory storage including data representative of the narrative presentation and a number of supplemental media content presentations; at least one user interface; and at least one processor with machine executable instructions that when executed by the at least one processor, cause the at least one processor to provide a user with the ability via the at least one user interface to:
identify over the course of the narrative presentation a number of supplemental media content selection periods during which at least one supplemental media content presentation is available, each of the selection periods having a respective start point, duration, and end point in the narrative presentation;
for each of the supplemental media content selection periods, provide a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period,
each selectable indicator representative an aspect of inner awareness associated with each of a number of characters included in the narrative presentation; and
each indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer; and
for each supplemental media content presentation, identify at least one respective transition mode between the narrative presentation and each supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the narrative presentation and the respective supplemental media content presentation. 30. The system of claim 29, wherein the machine executable instructions further cause the at least one processor to provide a user with the ability via the user interface to:
identify over the course of at least one supplemental media content presentation a number of subordinate supplemental media content selection periods during which at least one subordinate supplemental media content presentation is available, each subordinate supplemental media content selection period having a respective start point, duration, and end point in the respective supplemental media content presentation; for each of the subordinate supplemental media content selection periods, provide a number of media content consumer perceptible and selectable indicators in the supplemental media content presentation during all or a portion of the respective subordinate supplemental media content selection period;
each selectable indicator representative of an aspect of inner awareness for each of a number of characters included in the respective supplemental media content presentation; and
each indicator logically associated with a respective subordinate supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the supplemental media content presentation selected by the media content consumer; and
for each supplemental media content presentation, identify at least one respective transition mode between the supplemental media content presentation and each subordinate supplemental media content presentation, the respective transition mode specifying a transition effect for segueing between the supplemental media content presentation and the respective subordinate supplemental media content presentation. 31. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide a user with the ability via the user interface to:
identify a temporal transition relationship between a departure transition event from the narrative presentation to the supplemental media content presentation and return transition event from the supplemental media content presentation to the narrative presentation. 32. The system of claim 31 wherein the temporal transition relationship comprises one of:
the temporal transition relationship that causes the return transition event to return to the narrative presentation at a point in the narrative when the departure transition event occurred; or
the temporal transition relationship that causes the return transition event to return to the narrative presentation at a defined point in the narrative presentation prior to when the departure transition event occurred. 33. The system of claim 31 wherein the temporal transition relationship comprises the relationship that causes the return transition event to autonomously return to the narrative presentation at the start point of the respective supplemental media content selection period responsive to a selection of a supplemental media content presentation by a media content user within a defined interval prior to the end point of the respective supplemental media content selection period. 34. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
specify the transition effect that causes a decrease in size of a narrative presentation display area and a contemporaneous increase in size of a supplemental media content presentation display area; and
specify the transition effect that causes a reduction in intensity of a narrative presentation display area and a contemporaneous increase in intensity of a supplemental media content presentation display area. 35. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each supplemental media content selection period, select a standby mode entered by the narrative presentation while a supplemental media content presentation is provided to a media content consumer. 36. The system of claim 35 wherein the standby mode comprises at least one of:
the standby mode that causes the narrative presentation to halt during the supplemental media content presentation;
the standby mode that causes at least a portion of the narrative existent between a defined start point and a defined end point within the respective supplemental media content selection period to cyclically loop during the supplemental media content presentation; or
the standby mode that causes the narrative presentation to progress at a reduced frame rate during the supplemental media content presentation. 37. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each supplemental media content selection period, select at least one character in the narrative presentation, each selected character having at least one associated supplemental media content presentation logically associated with an aspect of inner awareness; and
autonomously identify each of the selected characters using facial recognition for at least a portion of the duration of the respective supplemental media content selection period. 38. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each of the supplemental media content selection periods, provide a number of media content consumer perceptible, non-selectable, indicators in the narrative presentation,
each non-selectable indicator representative of an aspect of inner awareness for each of the number of narrative characters; and
each non-selectable indicator logically associated with a respective supplemental media content presentation previously accessed by the media content consumer during the respective supplemental media content selection period. 39. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide a selectable indicator representative of an aspect of inner awareness that includes at least:
the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character;
the aspect of inner awareness corresponding to an emotion or emotional process of the respective character; and
providing in the narrative a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character. 40. The system of claim 39 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of a narrative character on or about a first portion of a representation of the respective character;
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of a narrative character on or about a second portion of a representation of the respective character; and
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of a narrative character on or about a third portion of a representation of the respective character. 41. The system of claim 39 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to a thought or cognitive activity of the respective character on or about a head portion of a representation of the respective character;
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an emotion or emotional process of the respective character on or about a chest portion of a representation of the respective character; and
provide in the narrative presentation a selectable indicator representative of the aspect of inner awareness corresponding to an instinct or bodily sensation of the respective character on or about an abdominal portion of a representation of the respective character. 42. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display parameter for each of the number of selectable indicators. 43. The system of claim 42 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display effect on or proximate at least one of:
a media content consumer selectable indicator including an icon logically associated with a supplemental media content presentation logically associated with the respective character; and
a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a narrative character, the indicator logically associated with a supplemental media content presentation logically associated with the respective character. 44. The system of claim 43 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display effect that includes at least one of:
a change in display intensity;
a change in display color; and
a cyclical change in alternating portions of display location to cause a shimmer or halo effect. 45. The system of claim 43 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display effect on or proximate a media content consumer selectable indicator including an indicator disposed on or about all or a portion of a representation of a character included in the narrative presentation including at least one of:
a display effect directly on or proximate at least a portion of a representation of the respective character included in the narrative presentation; or
a display effect directly on or proximate at least a portion of a representation of the respective character external to the narrative presentation. 46. The system of claim 42 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
select at least one display parameter for each of the number of selectable indicators including at least one of:
a duration of the at least one display effect in the narrative presentation equal to a duration of the respective supplemental media content selection period; and
a duration of the at least one display effect in the narrative presentation less than a duration of the respective supplemental media content selection period. 47. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
for each of the number of selectable indicators, identify a media content consumer input indicative of a selection of the respective indicator. 48. The system of claim 47 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to identify a media content consumer input indicative of a selection of the respective indicator including at least one of:
a non-contact, gesture based, input using a human hand or pointer to indicate selection of the respective indicator;
a contact, touch based, input using a human hand or pointer to indicate selection of the respective indicator; and
a pointer based input using a pointing device to indicate selection of the respective indicator. 49. The system of claim 29 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
provide a number of media content consumer perceptible and selectable indicators in the narrative presentation during all or a portion of the respective supplemental media content period, each indicator representative of an aspect of inner awareness for each of at least two characters included in the narrative presentation; and each selectable indicator logically associated with a respective supplemental media content presentation including information regarding the respective aspect of inner awareness of the respective character at a point in the narrative presentation selected by the media content consumer. 50. The system of claim 49 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence for each of the number of supplemental media content presentations logically associated with each of the at least two characters included in the narrative presentation. 51. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with a first character included in the narrative presentation prior to a presentation of any of the number of supplemental media content portions logically associated with a second character included in the narrative presentation. 52. The system of claim 51 wherein the presentation sequence includes at least one of:
a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for the duration of each supplemental media content period; or
a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with the second character included in the narrative presentation for a duration of the narrative presentation. 53. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence that causes the presentation of each of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the first character included in the narrative presentation prior to the presentation of any of the number of supplemental media content presentations logically associated with at least one of the aspects of inner awareness associated with the second character included in the narrative presentation. 54. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters included in the narrative presentation. 55. The system of claim 54 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define by the media content consumer a presentation sequence for the presentation of each of a number of supplemental media content presentations for each of the at least two characters included in the narrative presentation corresponding to a selectable indicator selection sequence provided by the media content consumer. 56. The system of claim 50 wherein the machine executable instructions further cause the at least one processor to provide the user with the ability via the user interface to:
define a presentation sequence that causes the simultaneous presentation of a first supplemental media content presentation logically associated with a first character included in the narrative presentation during a supplemental media content selection period and a second supplemental media content presentation logically associated with a second character included in the narrative presentation during the supplemental media content selection period. | 2,100 |
4,425 | 14,781,514 | 2,118 | A method for operating an energy supply network, wherein energy generation is decentralized, the energy supply network has three supply levels, and energy is generated in each supply level and is fed into the particular supply level, where the three supply levels each form an independent control unit that is connectable or disconnectable via interfaces between the control units as needed, an operator region is associated with each of the control units, in which operator region an energy feed-in and an energy consumption for the respective associated control unit are combined and controlled, and where an exchange of energy amounts between the control units is then controlled, such as in a demand-oriented manner, by the respective operator areas via the interfaces between associated control units by the control of parameters defined between the control units, such that the entire energy supply network can be dynamically controlled in a simple manner. | 1-6. (canceled) 7. A method for operating an entire energy supply network having three supply levels and energy being generated and fed into each supply level, each of the three supply levels comprising an independent regulating unit which is connected or disconnected via interfaces between respective regulating units as required, the method comprising:
assigning a respective operator region to each of the regulating units , energy feed-in and energy consumption in the respective regulating units being combined and controlled in the respective operator region; and supervising an exchange of energy amounts between the respective regulating units by each associated operator region , via an interface between the respective regulating units, by controlling parameters that are defined between the respective regulating units. 8. The method as claimed in claim 7, wherein a specified voltage range is maintained in each operator region and an associated regulating unit. 9. The method as claimed in claim 7, wherein a primary regulation, a secondary regulation and a tertiary regulation are used to regulate an individual regulating unit and each associated operator region. 10. The method as claimed in claim 8, wherein a primary regulation, a secondary regulation and a tertiary regulation are used to regulate an individual regulating unit and each associated operator region. 11. The method as claimed in claim 7, wherein in addition to an exchange of energy amounts between the respective operator regions, operator data for regulation and control of a respective regulating unit and each associated operator region is also exchanged. 12. The method as claimed in claim 8, wherein in addition to an exchange of energy amounts between the respective operator regions, operator data for regulation and control of a respective regulating unit and each associated operator region is also exchanged. 13. The method as claimed in claim 9, wherein in addition to an exchange of energy amounts between the respective operator regions, operator data for regulation and control of a respective regulating unit and each associated operator region is also exchanged. 14. The method as claimed in claim 7, wherein at least one of (i) effective power, (ii) reactive power and (iii) a power factor cos Φ are used as parameters between each associated operator region and the respective regulating units. 15. The method as claimed in claim 7, wherein a high-voltage or transmission level is provided as a first level of the three supply levels, a medium-voltage or distribution level is provided as a second level of the three supply levels, and a low-voltage level is provided as a third level of the three supply levels. 16. The method as claimed in claim 7, wherein interfaces to subscribers or groups of subscribers at the second and third supply levels are controlled by the associated operator region, said interfaces to subscribers being used by the subscribers or subscriber groups to withdraw energy and by at least some of the subscribers or subscriber groups to feed energy directly into the respective operator region, particularly by means of photovoltaic systems and/or wind power. 17. The method as claimed in claim 7, wherein the energy feed directly into the respective operator region is via at least one of photovoltaic systems and/or wind power. | A method for operating an energy supply network, wherein energy generation is decentralized, the energy supply network has three supply levels, and energy is generated in each supply level and is fed into the particular supply level, where the three supply levels each form an independent control unit that is connectable or disconnectable via interfaces between the control units as needed, an operator region is associated with each of the control units, in which operator region an energy feed-in and an energy consumption for the respective associated control unit are combined and controlled, and where an exchange of energy amounts between the control units is then controlled, such as in a demand-oriented manner, by the respective operator areas via the interfaces between associated control units by the control of parameters defined between the control units, such that the entire energy supply network can be dynamically controlled in a simple manner.1-6. (canceled) 7. A method for operating an entire energy supply network having three supply levels and energy being generated and fed into each supply level, each of the three supply levels comprising an independent regulating unit which is connected or disconnected via interfaces between respective regulating units as required, the method comprising:
assigning a respective operator region to each of the regulating units , energy feed-in and energy consumption in the respective regulating units being combined and controlled in the respective operator region; and supervising an exchange of energy amounts between the respective regulating units by each associated operator region , via an interface between the respective regulating units, by controlling parameters that are defined between the respective regulating units. 8. The method as claimed in claim 7, wherein a specified voltage range is maintained in each operator region and an associated regulating unit. 9. The method as claimed in claim 7, wherein a primary regulation, a secondary regulation and a tertiary regulation are used to regulate an individual regulating unit and each associated operator region. 10. The method as claimed in claim 8, wherein a primary regulation, a secondary regulation and a tertiary regulation are used to regulate an individual regulating unit and each associated operator region. 11. The method as claimed in claim 7, wherein in addition to an exchange of energy amounts between the respective operator regions, operator data for regulation and control of a respective regulating unit and each associated operator region is also exchanged. 12. The method as claimed in claim 8, wherein in addition to an exchange of energy amounts between the respective operator regions, operator data for regulation and control of a respective regulating unit and each associated operator region is also exchanged. 13. The method as claimed in claim 9, wherein in addition to an exchange of energy amounts between the respective operator regions, operator data for regulation and control of a respective regulating unit and each associated operator region is also exchanged. 14. The method as claimed in claim 7, wherein at least one of (i) effective power, (ii) reactive power and (iii) a power factor cos Φ are used as parameters between each associated operator region and the respective regulating units. 15. The method as claimed in claim 7, wherein a high-voltage or transmission level is provided as a first level of the three supply levels, a medium-voltage or distribution level is provided as a second level of the three supply levels, and a low-voltage level is provided as a third level of the three supply levels. 16. The method as claimed in claim 7, wherein interfaces to subscribers or groups of subscribers at the second and third supply levels are controlled by the associated operator region, said interfaces to subscribers being used by the subscribers or subscriber groups to withdraw energy and by at least some of the subscribers or subscriber groups to feed energy directly into the respective operator region, particularly by means of photovoltaic systems and/or wind power. 17. The method as claimed in claim 7, wherein the energy feed directly into the respective operator region is via at least one of photovoltaic systems and/or wind power. | 2,100 |
4,426 | 14,846,411 | 2,136 | Various embodiments of the present invention are generally directed to an apparatus and associated method for updating data in a non-volatile memory array. In accordance with some embodiments, a memory block is formed with a plurality of types of memory cell sectors arranged in data pages of a first type and log pages of a second type that can be updated in-place. A first updated sector is written to a first log page while maintaining an outdated sector in an original data page, and overwritten with a second updated sector. | 1. An apparatus comprising a data storage device having first and second non-volatile memory arrays, the first non-volatile memory array comprising a first type of memory that cannot be updated in-place, the second non-volatile memory array comprising a second type of memory that can be updated in-place, the second non-volatile memory storing at least one out-of-date version of data and the first non-volatile memory storing a current version of the data. 2. The apparatus of claim 1, wherein the first non-volatile memory array comprises multiple pages with each page comprising multiple sectors, the current version stored on a first sector. 3. The apparatus of claim 2, wherein the smallest storage resolution of the first non-volatile memory array is a page and the smallest storage resolution of the second non-volatile memory array is a sector. 4. The apparatus of claim 1, wherein the first non-volatile memory array comprises flash memory. 5. The apparatus of claim 1, wherein the second non-volatile memory array comprises XRAM. 6. The apparatus of claim 1, wherein each non-volatile memory array is present in the data storage device. 7. The apparatus of claim 1, wherein the at least one out-of-date version and the current version of data are currently stored on the respective first and second non-volatile memory arrays. 8. The apparatus of claim 1, wherein the second non-volatile memory array stores multiple different out-of-date versions of the data. 9. The apparatus of claim 1, wherein the first non-volatile memory array stores an out-of-date version of the data. 10. The apparatus of claim 1, wherein a data buffer is positioned in the data storage device, the data buffer being different than the second non-volatile memory array. 11. A method comprising:
storing a current version of data in a first non-volatile memory array, the first non-volatile memory array comprising a first type of memory that cannot be updated in-place; and storing at least one out-of-date version of the data in a second non-volatile memory array, the second non-volatile memory array comprising a second type of memory that differs from the first type of memory, the first and second non-volatile memory arrays each being present in a data storage device. 12. The method of claim 11, wherein the second non-volatile memory array stores first and second out-of-date versions of the data. 13. The method of claim 12, wherein the first non-volatile memory array stores a third out-of-date version of the data currently with the current version of the data. 14. The method of claim 13, wherein the third out-of-date version of the data and the current version of the data are stored in different sectors of the first non-volatile memory array. 15. The method of claim 11, wherein the second non-volatile memory array stores multiple copies of a first out-of-date version of the data. 16. A method comprising:
storing first and second current versions of first and second portions of data, respectively, in a first non-volatile memory array, the first non-volatile memory array comprising a first type of memory that cannot be updated in-place; and storing first and second out-of-date versions of the first and second portions of data, respectively, in a second non-volatile memory array, the second non-volatile memory array comprising a second type of memory that differs from the first type of memory, the first and second non-volatile memory arrays each being present in a data storage device. 17. The method of claim 16, wherein the first and second out-of-date versions of the first and second portions of data are respectively stored on different pages of the second non-volatile memory array. 18. The method of claim 16, wherein the first and second current versions of the first and second portions of data are stored on a common page of the first non-volatile memory array. 19. The method of claim 16, wherein the first and second out-of-date versions of the first and second portions of data were previously current versions, respectively, and each stored in the first non-volatile memory array. 20. The method of claim 19, wherein the first and second out-of-date versions of the first and second portions of data were stored in the second non-volatile memory array in response to the current versions becoming out-of-date. | Various embodiments of the present invention are generally directed to an apparatus and associated method for updating data in a non-volatile memory array. In accordance with some embodiments, a memory block is formed with a plurality of types of memory cell sectors arranged in data pages of a first type and log pages of a second type that can be updated in-place. A first updated sector is written to a first log page while maintaining an outdated sector in an original data page, and overwritten with a second updated sector.1. An apparatus comprising a data storage device having first and second non-volatile memory arrays, the first non-volatile memory array comprising a first type of memory that cannot be updated in-place, the second non-volatile memory array comprising a second type of memory that can be updated in-place, the second non-volatile memory storing at least one out-of-date version of data and the first non-volatile memory storing a current version of the data. 2. The apparatus of claim 1, wherein the first non-volatile memory array comprises multiple pages with each page comprising multiple sectors, the current version stored on a first sector. 3. The apparatus of claim 2, wherein the smallest storage resolution of the first non-volatile memory array is a page and the smallest storage resolution of the second non-volatile memory array is a sector. 4. The apparatus of claim 1, wherein the first non-volatile memory array comprises flash memory. 5. The apparatus of claim 1, wherein the second non-volatile memory array comprises XRAM. 6. The apparatus of claim 1, wherein each non-volatile memory array is present in the data storage device. 7. The apparatus of claim 1, wherein the at least one out-of-date version and the current version of data are currently stored on the respective first and second non-volatile memory arrays. 8. The apparatus of claim 1, wherein the second non-volatile memory array stores multiple different out-of-date versions of the data. 9. The apparatus of claim 1, wherein the first non-volatile memory array stores an out-of-date version of the data. 10. The apparatus of claim 1, wherein a data buffer is positioned in the data storage device, the data buffer being different than the second non-volatile memory array. 11. A method comprising:
storing a current version of data in a first non-volatile memory array, the first non-volatile memory array comprising a first type of memory that cannot be updated in-place; and storing at least one out-of-date version of the data in a second non-volatile memory array, the second non-volatile memory array comprising a second type of memory that differs from the first type of memory, the first and second non-volatile memory arrays each being present in a data storage device. 12. The method of claim 11, wherein the second non-volatile memory array stores first and second out-of-date versions of the data. 13. The method of claim 12, wherein the first non-volatile memory array stores a third out-of-date version of the data currently with the current version of the data. 14. The method of claim 13, wherein the third out-of-date version of the data and the current version of the data are stored in different sectors of the first non-volatile memory array. 15. The method of claim 11, wherein the second non-volatile memory array stores multiple copies of a first out-of-date version of the data. 16. A method comprising:
storing first and second current versions of first and second portions of data, respectively, in a first non-volatile memory array, the first non-volatile memory array comprising a first type of memory that cannot be updated in-place; and storing first and second out-of-date versions of the first and second portions of data, respectively, in a second non-volatile memory array, the second non-volatile memory array comprising a second type of memory that differs from the first type of memory, the first and second non-volatile memory arrays each being present in a data storage device. 17. The method of claim 16, wherein the first and second out-of-date versions of the first and second portions of data are respectively stored on different pages of the second non-volatile memory array. 18. The method of claim 16, wherein the first and second current versions of the first and second portions of data are stored on a common page of the first non-volatile memory array. 19. The method of claim 16, wherein the first and second out-of-date versions of the first and second portions of data were previously current versions, respectively, and each stored in the first non-volatile memory array. 20. The method of claim 19, wherein the first and second out-of-date versions of the first and second portions of data were stored in the second non-volatile memory array in response to the current versions becoming out-of-date. | 2,100 |
4,427 | 13,450,000 | 2,159 | A method begins by a dispersed storage (DS) processing module receiving a request for a hypertext markup language (HTML) file, wherein the HTML file is encoded using a dispersed storage (DS) error coding function to produce a plurality of sets of encoded data slices, wherein the plurality of sets of encoded data slices is stored in a dispersed storage network (DSN) memory, and wherein the request includes a universal record locator (URL) associated with the HTML file. The method continues with the DS processing module translating the URL into a source name associated with the plurality of sets of encoded data slices. The method continues with the DS processing module requesting retrieval of a plurality of sets of at least a decode threshold number of encoded data slices of the plurality of sets of encoded data slices from the DSN memory in accordance with the source name. | 1. A method comprises:
receiving a request for a hypertext markup language (HTML) file, wherein the HTML file is encoded using a dispersed storage (DS) error coding function to produce a plurality of sets of encoded data slices, wherein the plurality of sets of encoded data slices is stored in a dispersed storage network (DSN) memory, and wherein the request includes a universal record locator (URL) associated with the HTML file; translating the URL into a source name associated with the plurality of sets of encoded data slices; and requesting retrieval of a plurality of sets of at least a decode threshold number of encoded data slices of the plurality of sets of encoded data slices from the DSN memory in accordance with the source name. 2. The method of claim 1 further comprises:
as the plurality of sets of at least a decode threshold number of encoded data slices is being received, reconstructing the HTML file from the plurality of sets of the at least the decode threshold number of encoded data slices. 3. The method of claim 2 further comprises:
outputting the HTML file to a requesting entity in accordance with a hypertext protocol (HTTP). 4. The method of claim 3, wherein the outputting the HTML file further comprises:
outputting the source name to the requesting entity, such that the requesting entity caches the source name for subsequent access of the HTML file. 5. The method of claim 1 further comprises:
generating one or more hypertext protocol (HTTP) response status codes based on response to the requesting retrieval of the plurality of sets of the at least the decode threshold number of encoded data slices;
generating a server response that includes at least one of the HTML file and the one or more HTTP response status codes; and
outputting the server response to a requesting entity. 6. The method of claim 1, wherein the receiving the request further comprises:
receiving a GET request in accordance with a hypertext protocol (HTTP). 7. The method of claim 1, wherein the translating the URL into the source name comprises:
obtaining a root directory associated with the DSN memory; identifying a pathname based on the URL and the root directory; and accessing a DSN index utilizing the pathname to retrieve the source name. 8. The method of claim 1, wherein the translating the URL into the source name comprises:
accessing a URL to source name table utilizing the URL to retrieve the source name. 9. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a request for a hypertext markup language (HTML) file, wherein the HTML file is encoded using a dispersed storage (DS) error coding function to produce a plurality of sets of encoded data slices, wherein the plurality of sets of encoded data slices is stored in a dispersed storage network (DSN) memory, and wherein the request includes a universal record locator (URL) associated with the HTML file;
a second module, when operable within the computing device, causes the computing device to:
translate the URL into a source name associated with the plurality of sets of encoded data slices; and
a third module, when operable within the computing device, causes the computing device to:
request retrieval of a plurality of sets of at least a decode threshold number of encoded data slices of the plurality of sets of encoded data slices from the DSN memory in accordance with the source name. 10. The DS module of claim 9 further comprises:
a fourth module, when operable within the computing device, causes the computing device to:
as the plurality of sets of at least a decode threshold number of encoded data slices is being received, reconstruct the HTML file from the plurality of sets of the at least the decode threshold number of encoded data slices. 11. The DS module of claim 10 further comprises:
a fifth module, when operable within the computing device, causes the computing device to:
output the HTML file to a requesting entity in accordance with a hypertext protocol (HTTP). 12. The DS module of claim 11, wherein the fifth module further functions to output the HTML file by:
outputting the source name to the requesting entity, such that the requesting entity caches the source name for subsequent access of the HTML file. 13. The DS module of claim 9 further comprises:
a sixth module, when operable within the computing device, causes the computing device to:
generate one or more hypertext protocol (HTTP) response status codes based on response to the requesting retrieval of the plurality of sets of the at least the decode threshold number of encoded data slices;
generate a server response that includes at least one of the HTML file and the one or more HTTP response status codes; and
output the server response to a requesting entity. 14. The DS module of claim 9, wherein the first module further functions to receive the request by:
receiving a GET request in accordance with a hypertext protocol (HTTP). 15. The DS module of claim 9, wherein the second module functions to translate the URL into the source name by:
obtaining a root directory associated with the DSN memory; identifying a pathname based on the URL and the root directory; and accessing a DSN index utilizing the pathname to retrieve the source name. 16. The DS module of claim 9, wherein the second module further functions to translate the URL into the source name by:
accessing a URL to source name table utilizing the URL to retrieve the source name. | A method begins by a dispersed storage (DS) processing module receiving a request for a hypertext markup language (HTML) file, wherein the HTML file is encoded using a dispersed storage (DS) error coding function to produce a plurality of sets of encoded data slices, wherein the plurality of sets of encoded data slices is stored in a dispersed storage network (DSN) memory, and wherein the request includes a universal record locator (URL) associated with the HTML file. The method continues with the DS processing module translating the URL into a source name associated with the plurality of sets of encoded data slices. The method continues with the DS processing module requesting retrieval of a plurality of sets of at least a decode threshold number of encoded data slices of the plurality of sets of encoded data slices from the DSN memory in accordance with the source name.1. A method comprises:
receiving a request for a hypertext markup language (HTML) file, wherein the HTML file is encoded using a dispersed storage (DS) error coding function to produce a plurality of sets of encoded data slices, wherein the plurality of sets of encoded data slices is stored in a dispersed storage network (DSN) memory, and wherein the request includes a universal record locator (URL) associated with the HTML file; translating the URL into a source name associated with the plurality of sets of encoded data slices; and requesting retrieval of a plurality of sets of at least a decode threshold number of encoded data slices of the plurality of sets of encoded data slices from the DSN memory in accordance with the source name. 2. The method of claim 1 further comprises:
as the plurality of sets of at least a decode threshold number of encoded data slices is being received, reconstructing the HTML file from the plurality of sets of the at least the decode threshold number of encoded data slices. 3. The method of claim 2 further comprises:
outputting the HTML file to a requesting entity in accordance with a hypertext protocol (HTTP). 4. The method of claim 3, wherein the outputting the HTML file further comprises:
outputting the source name to the requesting entity, such that the requesting entity caches the source name for subsequent access of the HTML file. 5. The method of claim 1 further comprises:
generating one or more hypertext protocol (HTTP) response status codes based on response to the requesting retrieval of the plurality of sets of the at least the decode threshold number of encoded data slices;
generating a server response that includes at least one of the HTML file and the one or more HTTP response status codes; and
outputting the server response to a requesting entity. 6. The method of claim 1, wherein the receiving the request further comprises:
receiving a GET request in accordance with a hypertext protocol (HTTP). 7. The method of claim 1, wherein the translating the URL into the source name comprises:
obtaining a root directory associated with the DSN memory; identifying a pathname based on the URL and the root directory; and accessing a DSN index utilizing the pathname to retrieve the source name. 8. The method of claim 1, wherein the translating the URL into the source name comprises:
accessing a URL to source name table utilizing the URL to retrieve the source name. 9. A dispersed storage (DS) module comprises:
a first module, when operable within a computing device, causes the computing device to:
receive a request for a hypertext markup language (HTML) file, wherein the HTML file is encoded using a dispersed storage (DS) error coding function to produce a plurality of sets of encoded data slices, wherein the plurality of sets of encoded data slices is stored in a dispersed storage network (DSN) memory, and wherein the request includes a universal record locator (URL) associated with the HTML file;
a second module, when operable within the computing device, causes the computing device to:
translate the URL into a source name associated with the plurality of sets of encoded data slices; and
a third module, when operable within the computing device, causes the computing device to:
request retrieval of a plurality of sets of at least a decode threshold number of encoded data slices of the plurality of sets of encoded data slices from the DSN memory in accordance with the source name. 10. The DS module of claim 9 further comprises:
a fourth module, when operable within the computing device, causes the computing device to:
as the plurality of sets of at least a decode threshold number of encoded data slices is being received, reconstruct the HTML file from the plurality of sets of the at least the decode threshold number of encoded data slices. 11. The DS module of claim 10 further comprises:
a fifth module, when operable within the computing device, causes the computing device to:
output the HTML file to a requesting entity in accordance with a hypertext protocol (HTTP). 12. The DS module of claim 11, wherein the fifth module further functions to output the HTML file by:
outputting the source name to the requesting entity, such that the requesting entity caches the source name for subsequent access of the HTML file. 13. The DS module of claim 9 further comprises:
a sixth module, when operable within the computing device, causes the computing device to:
generate one or more hypertext protocol (HTTP) response status codes based on response to the requesting retrieval of the plurality of sets of the at least the decode threshold number of encoded data slices;
generate a server response that includes at least one of the HTML file and the one or more HTTP response status codes; and
output the server response to a requesting entity. 14. The DS module of claim 9, wherein the first module further functions to receive the request by:
receiving a GET request in accordance with a hypertext protocol (HTTP). 15. The DS module of claim 9, wherein the second module functions to translate the URL into the source name by:
obtaining a root directory associated with the DSN memory; identifying a pathname based on the URL and the root directory; and accessing a DSN index utilizing the pathname to retrieve the source name. 16. The DS module of claim 9, wherein the second module further functions to translate the URL into the source name by:
accessing a URL to source name table utilizing the URL to retrieve the source name. | 2,100 |
4,428 | 13,191,614 | 2,128 | A handheld field maintenance tool and associated method are provided. The handheld field maintenance tool includes a process communication module configured to communicate in accordance with a process industry communication standard. A controller is coupled to the process communication module and is configured to access a device description relative to a selected simulated field device. A user interface is configured to receive a user input relative to a parameter of the simulated field device. The controller generates communication through the process communication module to simulate the selected field device based on the user input. | 1. A handheld field maintenance tool comprising:
a process communication module configured to communicate in accordance with a process industry communication standard; a controller coupled to the process communication module, the controller being configured to access a device description relative to a selected simulated field device; a user interface configured to receive a user input relative to a parameter of the simulated field device; and wherein the controller is configured to generate communication through the process communication module to simulate the selected field device based on the user input. 2. The handheld field maintenance tool of claim 1, wherein the process communication module is a wired process communication module. 3. The handheld field maintenance tool of claim 1, wherein the process communication module is a wireless process communication module. 4. The handheld field maintenance tool of claim 1, and further comprising a database of device descriptions stored on computer readable media within the handheld field maintenance tool and coupled the controller. 5. The handheld field maintenance tool of claim 1, and further comprising at least one secondary wireless communication protocol module coupled to the controller, wherein the controller is configured to access the device description using the at least one secondary wireless communication protocol module. 6. The handheld field maintenance tool of claim 1, wherein the communication generated through the process communication module by the controller is indicative of simulation. 7. The handheld field maintenance tool of claim 6, wherein the communication generated through the process communication module includes an additional communication packet to allow a host to display an indicator relative to the simulated field device. 8. A method of simulating a field device over a process communication loop, the method comprising:
coupling a handheld field maintenance tool to the loop; selecting a field device to simulate with the handheld field maintenance tool; accessing a device description for the selected field device; receiving user input relative to at least one parameter indicated by the device description to be a variable of the simulated field device; and generating process communication on the loop with the handheld field maintenance tool based on the device description and the user input. 9. The method of claim 8, wherein the handheld field maintenance tool simulates a plurality of field devices. 10. The method of claim 8, wherein the process communication includes data indicating that the process communication is from a simulated field device. 11. The method of claim 8, wherein accessing the device description includes wirelessly communicating with a remote database to obtain the device description. | A handheld field maintenance tool and associated method are provided. The handheld field maintenance tool includes a process communication module configured to communicate in accordance with a process industry communication standard. A controller is coupled to the process communication module and is configured to access a device description relative to a selected simulated field device. A user interface is configured to receive a user input relative to a parameter of the simulated field device. The controller generates communication through the process communication module to simulate the selected field device based on the user input.1. A handheld field maintenance tool comprising:
a process communication module configured to communicate in accordance with a process industry communication standard; a controller coupled to the process communication module, the controller being configured to access a device description relative to a selected simulated field device; a user interface configured to receive a user input relative to a parameter of the simulated field device; and wherein the controller is configured to generate communication through the process communication module to simulate the selected field device based on the user input. 2. The handheld field maintenance tool of claim 1, wherein the process communication module is a wired process communication module. 3. The handheld field maintenance tool of claim 1, wherein the process communication module is a wireless process communication module. 4. The handheld field maintenance tool of claim 1, and further comprising a database of device descriptions stored on computer readable media within the handheld field maintenance tool and coupled the controller. 5. The handheld field maintenance tool of claim 1, and further comprising at least one secondary wireless communication protocol module coupled to the controller, wherein the controller is configured to access the device description using the at least one secondary wireless communication protocol module. 6. The handheld field maintenance tool of claim 1, wherein the communication generated through the process communication module by the controller is indicative of simulation. 7. The handheld field maintenance tool of claim 6, wherein the communication generated through the process communication module includes an additional communication packet to allow a host to display an indicator relative to the simulated field device. 8. A method of simulating a field device over a process communication loop, the method comprising:
coupling a handheld field maintenance tool to the loop; selecting a field device to simulate with the handheld field maintenance tool; accessing a device description for the selected field device; receiving user input relative to at least one parameter indicated by the device description to be a variable of the simulated field device; and generating process communication on the loop with the handheld field maintenance tool based on the device description and the user input. 9. The method of claim 8, wherein the handheld field maintenance tool simulates a plurality of field devices. 10. The method of claim 8, wherein the process communication includes data indicating that the process communication is from a simulated field device. 11. The method of claim 8, wherein accessing the device description includes wirelessly communicating with a remote database to obtain the device description. | 2,100 |
4,429 | 14,229,502 | 2,161 | A method includes: storing, via at least one processor, intrinsic service elements and environmental elements in at least one storage medium on a user-by-user basis; receiving, from a first plurality of users, requests for a service over at least one network; selecting, in response to receiving the requests, a second plurality of users from the first plurality of users based on the intrinsic service elements; and matching at least two users among the second plurality of users based on the environmental elements. | 1. A method, comprising:
storing, via at least one processor, intrinsic service elements and environmental elements in at least one storage medium on a user-by-user basis; receiving, from a first plurality of users, requests for a service over at least one network; selecting, in response to receiving the requests, a second plurality of users from the first plurality of users based on the intrinsic service elements; and matching at least two users among the second plurality of users based on the environmental elements. 2. The method of claim 1, wherein the intrinsic service element of a user of the second plurality of users comprises information associated with at least one of a reception time of the request of the user, an option of the service set in association with the user, and a skill score set for the user according to a service process of the user. 3. The method of claim 1, wherein the environmental element of a user of the second plurality of users comprises information associated with at least one of a nationality of the user, a race of the user, a gender of the user, an age of the user, a current access location of the user, a residential place of the user, a main access time of the user, a main access day of the user, a service start date of the user, a service use period of the user, an alma mater of the user, and a language of the user. 4. The method of claim 1, wherein matching at least two users among the second plurality of users based on the environmental elements comprises:
determining environment weights with respect pairs of users based on the environmental elements, each pair of users comprising the same reference user and a respectively different user from the second plurality of users; selecting a user pair from the pairs of users based on the environment weights; and matching the reference user to the respectively different user of the user pair. 5. The method of claim 4, wherein:
each environmental element comprises one or more items; and determining an environment weight with respect to pairs of users based on the environment elements comprises:
determining, for each of the one or more items, an individual environmental element item weight based on a comparison of corresponding items associated with each user of a pair of users; and
determining the environment weights based on the individual environmental element item weights. 6. The method of claim 5, wherein:
the comparison corresponds to an inter-user difference in values of the corresponding items; and each value is established based on a determined valuation scheme of a corresponding item. 7. The method of claim 4, wherein matching the at least two users among the second plurality of users based on the environmental elements further comprises:
determining an average environment weight between the reference user and the respectively different user of the user pair; and matching another user with the reference user and the respectively different user based on the average environment weight. 8. The method of claim 4, further comprising:
selecting one or more items of the environmental elements based on a service option set for each of the users of the second plurality of users, wherein the environment weights are determined based on the one or more items. 9. A method, comprising:
determining, via at least one processor, individual environmental element item weights for user pairs based on comparisons of corresponding environmental element items associated with each user of a user pair; determining, for each user pair, an environment weight based on the individual environmental element item weights associated with the user pair; selecting one user pair from the user pairs based on the environment weights; and matching users of the one user pair, wherein the comparisons correspond to inter-user differences in values of corresponding environmental element items, and wherein each value is established based on a determined valuation scheme of a corresponding environmental element item. 10. The method of claim 9, further comprising:
selecting one or more environmental element items of environmental elements based on a service option set for each of the user pairs, wherein the environment weights are determined based on the one or more environmental element items. 11. The method of claim 9, wherein:
a first environmental element item of the environmental element items corresponds to a skill score set of a user associated with a service progress of the user; and a second environmental element item of the environmental element items corresponds to a nationality of the user, a race of the user, a gender of the user, an age of the user, a current access location of the user, a residential place of the user, a main access time of the user, a main access day of the user, a service start date of the user, a service use period of the user, an alma mater of the user, or a language of the user. 12. The method of claim 9, further comprising:
generating a group of users comprising the users of the user pair and at least one other user. 13. The method of claim 12, further comprising:
selecting an advertisement based on the group of users; and providing the advertisement to the users of the group of users. 14. The method of claim 12, further comprising:
selecting a reward based on a service progress result of users in the group of users; and providing the reward to the users in the group of users. 15. At least one non-transitory computer-readable storage medium comprising one or more instructions that, when executed, are configured to implement the method of claim 1. 16. A file distribution system configured to distribute, to a terminal, an installation file that, when executed by the terminal, is configured to install an application on the terminal, the application being configured to implement the method of claim 1. 17. A file distribution system, comprising:
a file manager configured to store an installation file for an application; and a file transmitter configured to transmit the installation file to a user terminal in response to reception of a request associated with the user terminal, wherein:
the application comprises a control module configured to control the user terminal to receive a service via a server; and
the server is configured to:
store intrinsic service elements and environmental elements on a user-by-user basis;
receive, from a first plurality of users, requests for a service over at least one network;
select, in response to reception of the requests, a second plurality of users from the first plurality of users based on the intrinsic service elements; and
match at least two users among the second plurality of users based on the environmental elements. 18. A file distribution system, comprising:
a file manager configured to store an installation file associated with an application; and a file transmitter configured to transmit the installation file to a user terminal in response to reception of a request associated with the user terminal, wherein:
the application comprises a control module configured to control the user terminal to receive a service via a server,
the server is configured to:
determine individual environmental element item weights for user pairs based on comparisons of corresponding environmental element items associated with each user of a user pair;
determine, for each user pair, an environment weight based on the individual environmental element item weights associated with the user pair;
select one user pair from the user pairs based on the environment weights; and
match users of the one user pair;
the comparisons correspond to inter-user differences in values of corresponding environmental element items; and
each value is established based on a determined valuation scheme of a corresponding environmental element item. 19. A system configured to provide a service to users over at least one network, the system comprising:
at least one storage unit configured to store, on a user-by-user basis, intrinsic service elements and environmental elements; and at least one module configured to:
receive, via the at least one network, requests for the service from a first plurality of the users,
select, in response to reception of the requests, a second plurality of the users from the first plurality of the users based on the intrinsic service elements, and
match at least two users of the second plurality of the users based on the environmental elements. 20. The system of claim 19, wherein the intrinsic service element of a user of the second plurality of the users comprises information corresponding to at least one of a reception time of the request of the user, an option of the service set in association with the user, and a skill score set for the user according to a service process of the user. 21. The system of claim 19, wherein the environmental element of a user of the second plurality of the users comprises information corresponding to at least one of a nationality of the user, a race of the user, a gender of the user, an age of the user, a current access location of the user, a residential place of the user, a main access time of the user, a main access day of the user, a service start date of the user, a service use period of the user, an alma mater of the user, and a language of a user. 22. The system of claim 19, wherein, as part of performing the match, the at least one module is configured to:
determine, based on the environment elements, environment weights for pairs of users from the second plurality of the users, each pair comprising the same reference user and a respectively different user from the second plurality of the users; select one pair of users from the pairs of users based on the environment weights; and match the reference user to the respectively different user of the one pair of users. 23. The user matching system of claim 22, wherein the at least one module is further configured to:
select one or more items of the environmental elements based on a service option set for each of the second plurality of the users, wherein the at least one module is configured to determine the environment weights based on the one or more items. 24. A system configured to provide a service to users over at least one network, the system comprising:
at least one storage unit configured to store environmental elements on a user-by-user basis, each environmental element comprising a plurality of environmental element items; and at least one module configured to:
determine individual environmental element item weights for pairs of the users based on comparisons of corresponding environmental element items of the environmental elements associated with each user of a user pair,
determine, for each user pair, an environment weight based on the individual environmental element item weights associated with the user pair,
select one pair from the pairs of the users based on the environment weights, and match users of the one pair,
wherein the comparisons correspond to inter-user differences in values of corresponding environmental element items, and wherein each value is established based on a determined valuation scheme of a corresponding environmental element item. 25. The system of claim 24, wherein the at least one module is further configured to:
select one or more environmental element items of each environmental element based on a service option set for each of the pairs of the users; and determine the environment weights based on the one or more environmental element items. | A method includes: storing, via at least one processor, intrinsic service elements and environmental elements in at least one storage medium on a user-by-user basis; receiving, from a first plurality of users, requests for a service over at least one network; selecting, in response to receiving the requests, a second plurality of users from the first plurality of users based on the intrinsic service elements; and matching at least two users among the second plurality of users based on the environmental elements.1. A method, comprising:
storing, via at least one processor, intrinsic service elements and environmental elements in at least one storage medium on a user-by-user basis; receiving, from a first plurality of users, requests for a service over at least one network; selecting, in response to receiving the requests, a second plurality of users from the first plurality of users based on the intrinsic service elements; and matching at least two users among the second plurality of users based on the environmental elements. 2. The method of claim 1, wherein the intrinsic service element of a user of the second plurality of users comprises information associated with at least one of a reception time of the request of the user, an option of the service set in association with the user, and a skill score set for the user according to a service process of the user. 3. The method of claim 1, wherein the environmental element of a user of the second plurality of users comprises information associated with at least one of a nationality of the user, a race of the user, a gender of the user, an age of the user, a current access location of the user, a residential place of the user, a main access time of the user, a main access day of the user, a service start date of the user, a service use period of the user, an alma mater of the user, and a language of the user. 4. The method of claim 1, wherein matching at least two users among the second plurality of users based on the environmental elements comprises:
determining environment weights with respect pairs of users based on the environmental elements, each pair of users comprising the same reference user and a respectively different user from the second plurality of users; selecting a user pair from the pairs of users based on the environment weights; and matching the reference user to the respectively different user of the user pair. 5. The method of claim 4, wherein:
each environmental element comprises one or more items; and determining an environment weight with respect to pairs of users based on the environment elements comprises:
determining, for each of the one or more items, an individual environmental element item weight based on a comparison of corresponding items associated with each user of a pair of users; and
determining the environment weights based on the individual environmental element item weights. 6. The method of claim 5, wherein:
the comparison corresponds to an inter-user difference in values of the corresponding items; and each value is established based on a determined valuation scheme of a corresponding item. 7. The method of claim 4, wherein matching the at least two users among the second plurality of users based on the environmental elements further comprises:
determining an average environment weight between the reference user and the respectively different user of the user pair; and matching another user with the reference user and the respectively different user based on the average environment weight. 8. The method of claim 4, further comprising:
selecting one or more items of the environmental elements based on a service option set for each of the users of the second plurality of users, wherein the environment weights are determined based on the one or more items. 9. A method, comprising:
determining, via at least one processor, individual environmental element item weights for user pairs based on comparisons of corresponding environmental element items associated with each user of a user pair; determining, for each user pair, an environment weight based on the individual environmental element item weights associated with the user pair; selecting one user pair from the user pairs based on the environment weights; and matching users of the one user pair, wherein the comparisons correspond to inter-user differences in values of corresponding environmental element items, and wherein each value is established based on a determined valuation scheme of a corresponding environmental element item. 10. The method of claim 9, further comprising:
selecting one or more environmental element items of environmental elements based on a service option set for each of the user pairs, wherein the environment weights are determined based on the one or more environmental element items. 11. The method of claim 9, wherein:
a first environmental element item of the environmental element items corresponds to a skill score set of a user associated with a service progress of the user; and a second environmental element item of the environmental element items corresponds to a nationality of the user, a race of the user, a gender of the user, an age of the user, a current access location of the user, a residential place of the user, a main access time of the user, a main access day of the user, a service start date of the user, a service use period of the user, an alma mater of the user, or a language of the user. 12. The method of claim 9, further comprising:
generating a group of users comprising the users of the user pair and at least one other user. 13. The method of claim 12, further comprising:
selecting an advertisement based on the group of users; and providing the advertisement to the users of the group of users. 14. The method of claim 12, further comprising:
selecting a reward based on a service progress result of users in the group of users; and providing the reward to the users in the group of users. 15. At least one non-transitory computer-readable storage medium comprising one or more instructions that, when executed, are configured to implement the method of claim 1. 16. A file distribution system configured to distribute, to a terminal, an installation file that, when executed by the terminal, is configured to install an application on the terminal, the application being configured to implement the method of claim 1. 17. A file distribution system, comprising:
a file manager configured to store an installation file for an application; and a file transmitter configured to transmit the installation file to a user terminal in response to reception of a request associated with the user terminal, wherein:
the application comprises a control module configured to control the user terminal to receive a service via a server; and
the server is configured to:
store intrinsic service elements and environmental elements on a user-by-user basis;
receive, from a first plurality of users, requests for a service over at least one network;
select, in response to reception of the requests, a second plurality of users from the first plurality of users based on the intrinsic service elements; and
match at least two users among the second plurality of users based on the environmental elements. 18. A file distribution system, comprising:
a file manager configured to store an installation file associated with an application; and a file transmitter configured to transmit the installation file to a user terminal in response to reception of a request associated with the user terminal, wherein:
the application comprises a control module configured to control the user terminal to receive a service via a server,
the server is configured to:
determine individual environmental element item weights for user pairs based on comparisons of corresponding environmental element items associated with each user of a user pair;
determine, for each user pair, an environment weight based on the individual environmental element item weights associated with the user pair;
select one user pair from the user pairs based on the environment weights; and
match users of the one user pair;
the comparisons correspond to inter-user differences in values of corresponding environmental element items; and
each value is established based on a determined valuation scheme of a corresponding environmental element item. 19. A system configured to provide a service to users over at least one network, the system comprising:
at least one storage unit configured to store, on a user-by-user basis, intrinsic service elements and environmental elements; and at least one module configured to:
receive, via the at least one network, requests for the service from a first plurality of the users,
select, in response to reception of the requests, a second plurality of the users from the first plurality of the users based on the intrinsic service elements, and
match at least two users of the second plurality of the users based on the environmental elements. 20. The system of claim 19, wherein the intrinsic service element of a user of the second plurality of the users comprises information corresponding to at least one of a reception time of the request of the user, an option of the service set in association with the user, and a skill score set for the user according to a service process of the user. 21. The system of claim 19, wherein the environmental element of a user of the second plurality of the users comprises information corresponding to at least one of a nationality of the user, a race of the user, a gender of the user, an age of the user, a current access location of the user, a residential place of the user, a main access time of the user, a main access day of the user, a service start date of the user, a service use period of the user, an alma mater of the user, and a language of a user. 22. The system of claim 19, wherein, as part of performing the match, the at least one module is configured to:
determine, based on the environment elements, environment weights for pairs of users from the second plurality of the users, each pair comprising the same reference user and a respectively different user from the second plurality of the users; select one pair of users from the pairs of users based on the environment weights; and match the reference user to the respectively different user of the one pair of users. 23. The user matching system of claim 22, wherein the at least one module is further configured to:
select one or more items of the environmental elements based on a service option set for each of the second plurality of the users, wherein the at least one module is configured to determine the environment weights based on the one or more items. 24. A system configured to provide a service to users over at least one network, the system comprising:
at least one storage unit configured to store environmental elements on a user-by-user basis, each environmental element comprising a plurality of environmental element items; and at least one module configured to:
determine individual environmental element item weights for pairs of the users based on comparisons of corresponding environmental element items of the environmental elements associated with each user of a user pair,
determine, for each user pair, an environment weight based on the individual environmental element item weights associated with the user pair,
select one pair from the pairs of the users based on the environment weights, and match users of the one pair,
wherein the comparisons correspond to inter-user differences in values of corresponding environmental element items, and wherein each value is established based on a determined valuation scheme of a corresponding environmental element item. 25. The system of claim 24, wherein the at least one module is further configured to:
select one or more environmental element items of each environmental element based on a service option set for each of the pairs of the users; and determine the environment weights based on the one or more environmental element items. | 2,100 |
4,430 | 14,836,571 | 2,139 | A technique for automating the construction of multiple virtual images with interdependencies includes creating a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI. A second VI instance is created by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI. The first and second VI instances are then deployed to designated machines in a cloud environment for execution. | 1. A method to automate the construction of multiple virtual images with interdependencies, comprising:
creating, using a data processing system, a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI; creating, using the data processing system, a second VI instance by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI; and deploying, using the data processing system, the first and second VI instances to designated virtual machines in a cloud environment for execution. 2. The method of claim 1, further comprising:
creating a third VI instance by extending a third base VI based on input values associated with the third base VI, instance values received from the second VI instance, and software bundles associated with the third base VI. 3. The method of claim 2, further comprising:
creating a fourth VI instance by extending a fourth base VI based on input values associated with a fourth base VI, instance values received from the third VI instance, and software bundles associated with the fourth base VI. 4. The method of claim 1, further comprising:
in response to completing creation of the second VI instance, storing the first and second VI instances in a repository. 5. The method of claim 1, further comprising:
in response to deploying the first and second VI instances, deleting locally stored copies of the first and second VI instances. 6. The method of claim 1, wherein a source control management product executes an automation process that initiates a build image creation process to create the first and second VI instances. 7. The method of claim 6, wherein the source management control product also deploys the dependency instance values of target products in a deployment tool. 8. The method of claim 1, wherein the input values include a host name, a port name, a repository name, one or more user names, and one or more user passwords associated with the first base VI, the software bundles include applications, the instance values received from the first VI instance include a host name, a port name, and a repository name, and the dependency instance values include one or more host names, port names, and repository names for applications that have interdependencies. 9. A method for integrating virtual images (VIs) in a cloud deployment pattern, comprising:
setting, by a data processing system, a variable for each of the VIs in the cloud deployment pattern to a deploy time value to create a name value pair; storing, by the data processing system, the name value pair in an assignment file; and pushing, by the data processing system, the assignment file to virtual machines (VMs) in the cloud deployment pattern. 10. The method of claim 9, wherein the setting a variable, storing the name value pair, and pushing the assignment file are performed by a script package that is executed by one of the VMs, and wherein the assignment file is only pushed to the VMs that do not execute the script package. 11. The method of claim 9, further comprising:
storing the assignment file in a same directory in all of the VMs. 12. The method of claim 9, further comprising:
adding an Internet protocol, fully qualified domain name, short name, and product alias for each of the VIs to a system information file; and pushing the system information file to the VMs. 13. The method of claim 12, wherein each of the VMs is further configured to append contents of the system information file to a mapping file to facilitate communication between the VMs via an alias using secure shell. | A technique for automating the construction of multiple virtual images with interdependencies includes creating a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI. A second VI instance is created by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI. The first and second VI instances are then deployed to designated machines in a cloud environment for execution.1. A method to automate the construction of multiple virtual images with interdependencies, comprising:
creating, using a data processing system, a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI; creating, using the data processing system, a second VI instance by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI; and deploying, using the data processing system, the first and second VI instances to designated virtual machines in a cloud environment for execution. 2. The method of claim 1, further comprising:
creating a third VI instance by extending a third base VI based on input values associated with the third base VI, instance values received from the second VI instance, and software bundles associated with the third base VI. 3. The method of claim 2, further comprising:
creating a fourth VI instance by extending a fourth base VI based on input values associated with a fourth base VI, instance values received from the third VI instance, and software bundles associated with the fourth base VI. 4. The method of claim 1, further comprising:
in response to completing creation of the second VI instance, storing the first and second VI instances in a repository. 5. The method of claim 1, further comprising:
in response to deploying the first and second VI instances, deleting locally stored copies of the first and second VI instances. 6. The method of claim 1, wherein a source control management product executes an automation process that initiates a build image creation process to create the first and second VI instances. 7. The method of claim 6, wherein the source management control product also deploys the dependency instance values of target products in a deployment tool. 8. The method of claim 1, wherein the input values include a host name, a port name, a repository name, one or more user names, and one or more user passwords associated with the first base VI, the software bundles include applications, the instance values received from the first VI instance include a host name, a port name, and a repository name, and the dependency instance values include one or more host names, port names, and repository names for applications that have interdependencies. 9. A method for integrating virtual images (VIs) in a cloud deployment pattern, comprising:
setting, by a data processing system, a variable for each of the VIs in the cloud deployment pattern to a deploy time value to create a name value pair; storing, by the data processing system, the name value pair in an assignment file; and pushing, by the data processing system, the assignment file to virtual machines (VMs) in the cloud deployment pattern. 10. The method of claim 9, wherein the setting a variable, storing the name value pair, and pushing the assignment file are performed by a script package that is executed by one of the VMs, and wherein the assignment file is only pushed to the VMs that do not execute the script package. 11. The method of claim 9, further comprising:
storing the assignment file in a same directory in all of the VMs. 12. The method of claim 9, further comprising:
adding an Internet protocol, fully qualified domain name, short name, and product alias for each of the VIs to a system information file; and pushing the system information file to the VMs. 13. The method of claim 12, wherein each of the VMs is further configured to append contents of the system information file to a mapping file to facilitate communication between the VMs via an alias using secure shell. | 2,100 |
4,431 | 12,632,406 | 2,176 | A mashup widget can include a widget component and a widget container. The widget container can be graphically rendered within widget defined boundaries of a mashup application. The widget component can detect an externally defined video file. The video file can have a native frame size, which is a frame size at which the video file is encoded. The video file can be loaded from a remote data source over an IP network. The native frame size of the video file can be determined. The defined boundaries of an embedded multimedia application can be dynamically adjusted to the native size. The defined boundaries of the widget container can be resized to accommodate the adjusted embedded multimedia application. The video can be rendered and presented within in the adjusted widget container. | 1. A mashup widget comprising:
a computer program product digitally encoded in a storage medium, said computer program product comprising:
a widget container able to be graphically rendered within widget defined boundaries of a mashup application; and
a widget component comprising computer program instructions, which when run by a processor cause a machine to:
detect an externally defined video file, wherein said video file has a native frame size, which is a frame size at which the video file is encoded;
load the video file from a remote data source over an IP network;
determine the native frame size of the video file;
dynamically adjust defined boundaries of an embedded multimedia application to the native size of the video file;
in response to the dynamic adjustment of the embedded multimedia application, dynamically resizing the defined boundaries of the widget container to accommodate the adjusted defined boundaries of the embedded multimedia application; and
render and present the video in the adjusted widget container. 2. The mashup widget of claim 1, wherein said mashup widget conforms to an iWidget standard, which is an open standard for an extensible browser-based component model framework. 3. The mashup widget of claim 1, wherein said widget component comprises logic for performing functions of the embedded multimedia application, said logic being defined within FLASH application source code and JAVASCRIPT source code, said FLASH application source code containing a class file written in a scripting language, said class file comprising a plurality of public functions that are programmatically exposed to the JAVASCRIPT source code for FLASH to JAVASCRIPT communication. 4. The mashup widget of claim 1, wherein said public functions comprise at least five of the following functions:
a loadVideo function for loading a video into the multimedia application directly using a URL path string; a loadXML function taking an XML object and node identifier string as arguments, wherein the loadXML function uses the node identifier strings to pull a value of the corresponding node from the XML object; a loadSkinPath function taking a URL to a pre-compiled playback controls file; a getURLSource function for returning a path string for a source video file that is currently loaded; a loadBackground function taking a URL path string for an image file, wherein said loadBackground function loads the file into a background layer of a video player; a playVideo function for playing a video loaded into the mashup component starting at a current playhead location; a resetVideo function for clearing any currently loaded video and to return the mashup component to its default state and sizing; a setVideoWH function taking width and height values, wherein said setVideoWH applies the width and height values to dimensions of the widget defined boundaries of the widget container after executing an algorithm to modify the width and height values to maintain the loaded video file's aspect ratio; an addComment function for making visible and initializing an interface for adding comments to the loaded video file; a showFullScreen function for making the widget container execute in full screen mode taking over an entire visible area of an end-user's display; a showPrefWH function for resizing the widget defined boundaries of the widget container to a width and height from the loaded video file; and a showDefaultWH function for resizing the widget defined boundaries of the widget container to default widget container dimensions. 5. The mashup widget of claim 1, wherein the computer program instructions when run by the processor cause the machine to:
maintain an aspect ratio of the loaded video file when dynamically adjusting the defined boundaries of the widget container. 6. The mashup widget of claim 1, wherein the computer program instructions when run by the processor cause the machine to:
receive user defined width and height for the widget container boundaries; and dynamically adjust the defined boundaries of the widget container to the user defined width and height. 7. The mashup widget of claim 1, wherein the computer program instructions when run by the processor cause the machine to:
permit a user to add textual comments for a specific time interval of the loaded video file; and transfer the textual comments to a widget-defined remotely located, URL identified network data repository, where the textual comments are accessible by others that play the video file at a future time. 8. The mashup widget of claim 1, wherein said widget component further comprises:
a video display handler for interacting with the video display area of the widget container; an interface customization component for providing a user with customizable settings for the mashup widget, where the customizable settings are maintained and applied for subsequent uses of the mashup widget; a video playback control component comprising functions that allow a user to manipulate playback of the video file within the widget container; and a comment logging system for providing a user with an ability to capture textual comments to user-specified time intervals of a loaded video file. 9. A mashup widget digitally encoded in a storage medium, said mashup widget conforming to an open standard for an extensible browser-based component model framework, said mashup widget comprising:
a JAVASCRIPT module written in JAVASCRIPT source code for interacting with a mashup application in which the mashup widget is contained; a FLASH application for video playback within the mashup widget, said FLASH application being written in FLASH application source code containing a class file written in a scripting language, said class file comprising a plurality of public functions that are programmatically exposed to the JAVASCRIPT source code for FLASH application to JAVASCRIPT module communications, wherein said mashup widget is an interactive video playback component having widget boundaries able to be dynamically adjusted for a frame size of a video loaded into the mashup widget, wherein adjusting the widget boundaries adjusts the frame size of the video when played within the mashup widget, wherein adjusting the widget boundaries results in a change of size of the mashup widget as rendered within a Web browser, said size being a relative size adjustment in variance from relative sizes of other mashup application components presented within the Web browser, wherein the mashup widget and the other mashup application components are all components of a common mashup application, which is presented within the Web browser. 10. The mashup widget of claim 9, wherein one of said public functions permits a remote video file to be identified by URL and loaded directly into the FLASH application. 11. The mashup widget of claim 9, wherein one of said public functions makes visible and initializes an interface for adding comments to video files loaded in the mashup widget. 12. The mashup widget of claim 9, wherein one of the public functions receives values for width and height, wherein received values are applied to dimensions of the video playback component after executing an algorithm to modify the received values to maintain a source video file's aspect ratio. 13. The mashup widget of claim 9, wherein one of the public functions causes a video loaded within the mashup widget to be presented in a full screen mode. 14. The mashup widget of claim 9, wherein said public functions comprise at least five of the following functions:
a loadVideo function for loading a video into the multimedia application directly using a URL path string; a loadXML function taking an XML object and node identifier string as arguments, wherein the loadXML function uses the node identifier strings to pull a value of the corresponding node from the XML object; a loadSkinPath function taking a URL to a pre-compiled playback controls file; a getURLSource function for returning a path string for a source video file that is currently loaded; a loadBackground function taking a URL path string for an image file, wherein said loadBackground function loads the file into a background layer of a video player; a playVideo function for playing a video loaded into the mashup component starting at a current play head location; a resetVideo function for clearing any currently loaded video and to return the mashup component to its default state and sizing; a setVideoWH function taking width and height values, wherein said setVideoWH applies the width and height values of the mashup widget after executing an algorithm to modify the width and height values to maintain the loaded video file's aspect ratio; an addComment function for making visible and initializing an interface for adding comments to the loaded video file; a showFullScreen function for making the widget container execute in full screen mode taking over an entire visible area of an end-user's display; a showPrefWH function for resizing the widget defined boundaries of mashup widget to a width and height from the loaded video file; and a showDefaultWH function for resizing the widget defined boundaries of mashup widget to default dimensions. 15. The mashup widget of claim 9, further comprising:
a video display handler for interacting with the video display area of the widget container; an interface customization component for providing a user with customizable settings for the mashup widget, where the customizable settings are maintained and applied for subsequent uses of the mashup widget; a video playback control component comprising functions that allow a user to manipulate playback of the video file within the mashup widget; and a comment logging system for providing a user with an ability to capture textual comments to user-specified time intervals of a loaded video file. 16. A mashup application digitally encoded as a computer program product stored in a storage medium, wherein said computer program product is executable by a processor, said mashup application comprising:
a plurality of different components, each conforming to a browser based component model, wherein said different components are from more than one URL defined source, wherein each of said different components expose a set of functions to other ones of the different components, where the exposed functions permit the components to interact with one another, wherein said different components have been combined into a single integrated component, which is the mashup application, wherein said different components comprise an interactive video player component, wherein said interactive video player component is able to load and interactively playback video files from URL defined sources, wherein a frame size of loaded videos used during playback is able to be dynamically adjusted using functions exposed by the interactive video player component. 17. The mashup application of claim 16, wherein the interactive video player component comprises:
a widget container able to be graphically rendered within defined boundaries of a interactive video player component; and a widget component comprising computer program instructions, which when run by a processor cause a machine to:
detect an externally defined video file identified by a URL, wherein said video file has a native frame size, which is an frame size at which the video file is encoded;
load the video file from a remote data source over an IP network;
determine the native frame size of the video file;
dynamically adjust defined boundaries of an embedded multimedia application to the native size of the video file;
in response to the dynamic adjustment of the embedded multimedia application, dynamically resizing the defined boundaries of the widget container to accommodate the adjusted defined boundaries of the embedded multimedia application; and
render and present the video in the adjusted widget container. 18. The mashup application of claim 17, wherein the interactive video player component comprises:
a JAVASCRIPT module written in JAVASCRIPT source code for interacting with a mashup application in which the mashup widget is contained; and a FLASH application for video playback within the mashup widget, said FLASH application being written in FLASH application source code containing a class file written in a scripting language said class file comprising a plurality of public functions that are programmatically exposed to the JAVASCRIPT source code for FLASH application to JAVASCRIPT module communications. 19. The mashup application of claim 16, wherein exposed function of the interactive video player component are public functions of a defined class, wherein one of said public functions makes visible and initializes an interface for adding comments to video files loaded in the interactive video player component, and wherein one of the public functions receives values for width and height, wherein received values are applied to dimensions of the interactive video player component after executing an algorithm to modify the received values to maintain a source video file's aspect ratio. 20. The mashup application of claim 16, wherein exposed functions of the interactive video player component are public functions of a defined class, wherein said public functions comprise at least five of the following functions:
a loadVideo function for loading a video into the multimedia application directly using a URL path string; a loadXML function taking an XML object and node identifier string as arguments, wherein the loadXML function uses the node identifier strings to pull a value of the corresponding node from the XML object; a loadSkinPath function taking a URL to a pre-compiled playback controls file; a getURLSource function for returning a path string for a source video file that is currently loaded; a loadBackground function taking a URL path string for an image file, wherein said loadBackground function loads the file into a background layer of a video player; a playVideo function for playing a video loaded into the mashup component starting at a current play head location; a resetVideo function for clearing any currently loaded video and to return the mashup component to its default state and sizing; a setVideoWH function taking width and height values, wherein said setVideoWH applies the width and height values to dimensions of the widget defined boundaries of the interactive video player component after executing an algorithm to modify the width and height values to maintain the loaded video file's aspect ratio; an addComment function for making visible and initializing an interface for adding comments to the loaded video file; a showFullScreen function for making the widget container execute in full screen mode taking over an entire visible area of an end-user's display; a showPrefWH function for resizing the widget defined boundaries of the interactive video player component to a width and height from the loaded video file; and a showDefaultWH function for resizing the widget defined boundaries of the interactive video player component to default widget container dimensions. | A mashup widget can include a widget component and a widget container. The widget container can be graphically rendered within widget defined boundaries of a mashup application. The widget component can detect an externally defined video file. The video file can have a native frame size, which is a frame size at which the video file is encoded. The video file can be loaded from a remote data source over an IP network. The native frame size of the video file can be determined. The defined boundaries of an embedded multimedia application can be dynamically adjusted to the native size. The defined boundaries of the widget container can be resized to accommodate the adjusted embedded multimedia application. The video can be rendered and presented within in the adjusted widget container.1. A mashup widget comprising:
a computer program product digitally encoded in a storage medium, said computer program product comprising:
a widget container able to be graphically rendered within widget defined boundaries of a mashup application; and
a widget component comprising computer program instructions, which when run by a processor cause a machine to:
detect an externally defined video file, wherein said video file has a native frame size, which is a frame size at which the video file is encoded;
load the video file from a remote data source over an IP network;
determine the native frame size of the video file;
dynamically adjust defined boundaries of an embedded multimedia application to the native size of the video file;
in response to the dynamic adjustment of the embedded multimedia application, dynamically resizing the defined boundaries of the widget container to accommodate the adjusted defined boundaries of the embedded multimedia application; and
render and present the video in the adjusted widget container. 2. The mashup widget of claim 1, wherein said mashup widget conforms to an iWidget standard, which is an open standard for an extensible browser-based component model framework. 3. The mashup widget of claim 1, wherein said widget component comprises logic for performing functions of the embedded multimedia application, said logic being defined within FLASH application source code and JAVASCRIPT source code, said FLASH application source code containing a class file written in a scripting language, said class file comprising a plurality of public functions that are programmatically exposed to the JAVASCRIPT source code for FLASH to JAVASCRIPT communication. 4. The mashup widget of claim 1, wherein said public functions comprise at least five of the following functions:
a loadVideo function for loading a video into the multimedia application directly using a URL path string; a loadXML function taking an XML object and node identifier string as arguments, wherein the loadXML function uses the node identifier strings to pull a value of the corresponding node from the XML object; a loadSkinPath function taking a URL to a pre-compiled playback controls file; a getURLSource function for returning a path string for a source video file that is currently loaded; a loadBackground function taking a URL path string for an image file, wherein said loadBackground function loads the file into a background layer of a video player; a playVideo function for playing a video loaded into the mashup component starting at a current playhead location; a resetVideo function for clearing any currently loaded video and to return the mashup component to its default state and sizing; a setVideoWH function taking width and height values, wherein said setVideoWH applies the width and height values to dimensions of the widget defined boundaries of the widget container after executing an algorithm to modify the width and height values to maintain the loaded video file's aspect ratio; an addComment function for making visible and initializing an interface for adding comments to the loaded video file; a showFullScreen function for making the widget container execute in full screen mode taking over an entire visible area of an end-user's display; a showPrefWH function for resizing the widget defined boundaries of the widget container to a width and height from the loaded video file; and a showDefaultWH function for resizing the widget defined boundaries of the widget container to default widget container dimensions. 5. The mashup widget of claim 1, wherein the computer program instructions when run by the processor cause the machine to:
maintain an aspect ratio of the loaded video file when dynamically adjusting the defined boundaries of the widget container. 6. The mashup widget of claim 1, wherein the computer program instructions when run by the processor cause the machine to:
receive user defined width and height for the widget container boundaries; and dynamically adjust the defined boundaries of the widget container to the user defined width and height. 7. The mashup widget of claim 1, wherein the computer program instructions when run by the processor cause the machine to:
permit a user to add textual comments for a specific time interval of the loaded video file; and transfer the textual comments to a widget-defined remotely located, URL identified network data repository, where the textual comments are accessible by others that play the video file at a future time. 8. The mashup widget of claim 1, wherein said widget component further comprises:
a video display handler for interacting with the video display area of the widget container; an interface customization component for providing a user with customizable settings for the mashup widget, where the customizable settings are maintained and applied for subsequent uses of the mashup widget; a video playback control component comprising functions that allow a user to manipulate playback of the video file within the widget container; and a comment logging system for providing a user with an ability to capture textual comments to user-specified time intervals of a loaded video file. 9. A mashup widget digitally encoded in a storage medium, said mashup widget conforming to an open standard for an extensible browser-based component model framework, said mashup widget comprising:
a JAVASCRIPT module written in JAVASCRIPT source code for interacting with a mashup application in which the mashup widget is contained; a FLASH application for video playback within the mashup widget, said FLASH application being written in FLASH application source code containing a class file written in a scripting language, said class file comprising a plurality of public functions that are programmatically exposed to the JAVASCRIPT source code for FLASH application to JAVASCRIPT module communications, wherein said mashup widget is an interactive video playback component having widget boundaries able to be dynamically adjusted for a frame size of a video loaded into the mashup widget, wherein adjusting the widget boundaries adjusts the frame size of the video when played within the mashup widget, wherein adjusting the widget boundaries results in a change of size of the mashup widget as rendered within a Web browser, said size being a relative size adjustment in variance from relative sizes of other mashup application components presented within the Web browser, wherein the mashup widget and the other mashup application components are all components of a common mashup application, which is presented within the Web browser. 10. The mashup widget of claim 9, wherein one of said public functions permits a remote video file to be identified by URL and loaded directly into the FLASH application. 11. The mashup widget of claim 9, wherein one of said public functions makes visible and initializes an interface for adding comments to video files loaded in the mashup widget. 12. The mashup widget of claim 9, wherein one of the public functions receives values for width and height, wherein received values are applied to dimensions of the video playback component after executing an algorithm to modify the received values to maintain a source video file's aspect ratio. 13. The mashup widget of claim 9, wherein one of the public functions causes a video loaded within the mashup widget to be presented in a full screen mode. 14. The mashup widget of claim 9, wherein said public functions comprise at least five of the following functions:
a loadVideo function for loading a video into the multimedia application directly using a URL path string; a loadXML function taking an XML object and node identifier string as arguments, wherein the loadXML function uses the node identifier strings to pull a value of the corresponding node from the XML object; a loadSkinPath function taking a URL to a pre-compiled playback controls file; a getURLSource function for returning a path string for a source video file that is currently loaded; a loadBackground function taking a URL path string for an image file, wherein said loadBackground function loads the file into a background layer of a video player; a playVideo function for playing a video loaded into the mashup component starting at a current play head location; a resetVideo function for clearing any currently loaded video and to return the mashup component to its default state and sizing; a setVideoWH function taking width and height values, wherein said setVideoWH applies the width and height values of the mashup widget after executing an algorithm to modify the width and height values to maintain the loaded video file's aspect ratio; an addComment function for making visible and initializing an interface for adding comments to the loaded video file; a showFullScreen function for making the widget container execute in full screen mode taking over an entire visible area of an end-user's display; a showPrefWH function for resizing the widget defined boundaries of mashup widget to a width and height from the loaded video file; and a showDefaultWH function for resizing the widget defined boundaries of mashup widget to default dimensions. 15. The mashup widget of claim 9, further comprising:
a video display handler for interacting with the video display area of the widget container; an interface customization component for providing a user with customizable settings for the mashup widget, where the customizable settings are maintained and applied for subsequent uses of the mashup widget; a video playback control component comprising functions that allow a user to manipulate playback of the video file within the mashup widget; and a comment logging system for providing a user with an ability to capture textual comments to user-specified time intervals of a loaded video file. 16. A mashup application digitally encoded as a computer program product stored in a storage medium, wherein said computer program product is executable by a processor, said mashup application comprising:
a plurality of different components, each conforming to a browser based component model, wherein said different components are from more than one URL defined source, wherein each of said different components expose a set of functions to other ones of the different components, where the exposed functions permit the components to interact with one another, wherein said different components have been combined into a single integrated component, which is the mashup application, wherein said different components comprise an interactive video player component, wherein said interactive video player component is able to load and interactively playback video files from URL defined sources, wherein a frame size of loaded videos used during playback is able to be dynamically adjusted using functions exposed by the interactive video player component. 17. The mashup application of claim 16, wherein the interactive video player component comprises:
a widget container able to be graphically rendered within defined boundaries of a interactive video player component; and a widget component comprising computer program instructions, which when run by a processor cause a machine to:
detect an externally defined video file identified by a URL, wherein said video file has a native frame size, which is an frame size at which the video file is encoded;
load the video file from a remote data source over an IP network;
determine the native frame size of the video file;
dynamically adjust defined boundaries of an embedded multimedia application to the native size of the video file;
in response to the dynamic adjustment of the embedded multimedia application, dynamically resizing the defined boundaries of the widget container to accommodate the adjusted defined boundaries of the embedded multimedia application; and
render and present the video in the adjusted widget container. 18. The mashup application of claim 17, wherein the interactive video player component comprises:
a JAVASCRIPT module written in JAVASCRIPT source code for interacting with a mashup application in which the mashup widget is contained; and a FLASH application for video playback within the mashup widget, said FLASH application being written in FLASH application source code containing a class file written in a scripting language said class file comprising a plurality of public functions that are programmatically exposed to the JAVASCRIPT source code for FLASH application to JAVASCRIPT module communications. 19. The mashup application of claim 16, wherein exposed function of the interactive video player component are public functions of a defined class, wherein one of said public functions makes visible and initializes an interface for adding comments to video files loaded in the interactive video player component, and wherein one of the public functions receives values for width and height, wherein received values are applied to dimensions of the interactive video player component after executing an algorithm to modify the received values to maintain a source video file's aspect ratio. 20. The mashup application of claim 16, wherein exposed functions of the interactive video player component are public functions of a defined class, wherein said public functions comprise at least five of the following functions:
a loadVideo function for loading a video into the multimedia application directly using a URL path string; a loadXML function taking an XML object and node identifier string as arguments, wherein the loadXML function uses the node identifier strings to pull a value of the corresponding node from the XML object; a loadSkinPath function taking a URL to a pre-compiled playback controls file; a getURLSource function for returning a path string for a source video file that is currently loaded; a loadBackground function taking a URL path string for an image file, wherein said loadBackground function loads the file into a background layer of a video player; a playVideo function for playing a video loaded into the mashup component starting at a current play head location; a resetVideo function for clearing any currently loaded video and to return the mashup component to its default state and sizing; a setVideoWH function taking width and height values, wherein said setVideoWH applies the width and height values to dimensions of the widget defined boundaries of the interactive video player component after executing an algorithm to modify the width and height values to maintain the loaded video file's aspect ratio; an addComment function for making visible and initializing an interface for adding comments to the loaded video file; a showFullScreen function for making the widget container execute in full screen mode taking over an entire visible area of an end-user's display; a showPrefWH function for resizing the widget defined boundaries of the interactive video player component to a width and height from the loaded video file; and a showDefaultWH function for resizing the widget defined boundaries of the interactive video player component to default widget container dimensions. | 2,100 |
4,432 | 14,252,539 | 2,167 | Displaying a representative item for a collection of items includes obtaining, from at least one source, a history of interests associated with a user, analyzing the history of interests associated with the user to determine preference criteria for the user, identifying, based on the preference criteria for the user, a representative item for a collection of items, and displaying, to the user, the representative item. | 1-8. (canceled) 9. A system for displaying a representative item for a collection of items, the system comprising:
an obtaining engine to obtain, from at least one source, a history of interests associated with a user; an analyzing engine to analyze the history of interests associated with the user to determine preference criteria for the user; an identifying engine to identify, based on the preference criteria for the user, a representative item for a collection of items; a representative item displaying engine to display, to the user, the representative item; a changing engine to change the representative item to a different representative item for the collection of items to allow the different representative item to be displayed to the user; and a different representative item displaying engine to display, to a different user, a different representative item for the collection of items. 10. The system of claim 9, in which the analyzing engine analyzes the history of interests associated with the user to determine the preference criteria for the user by applying a natural language processing (NLP) to content within the history of interests to characterize the content. 11. The system of claim 9, in which the changing engine changes the representative item to the different representative item for the collection of items to allow the different representative item to be displayed to the user by changing the representative item to the different representative item according to a number of times the representative item is displayed to the user, changing the representative item to the different representative item randomly, changing the representative item to the different representative item based on a round robin, or combinations thereof. 12. The system of claim 9, in which the obtaining engine obtains, from the at least one source, the history of interests associated with the user by monitoring activities of the user and a similar user to capture explicit interests of the user, implicit interests of the user, explicit interests of the similar user, implicit interests of the similar user, or combinations thereof. 13. The system of claim 9, in which the different representative item displaying engine displays the different representative item for the collection of items based on preference criteria for the different user. 14. A computer program product for displaying a representative item for a collection of items, comprising:
a tangible computer readable storage medium, said tangible computer readable storage medium comprising computer readable program code embodied therewith, said computer readable program code comprising program instructions that, when executed, causes a processor to: analyze a history of interests associated with a user to determine preference criteria for the user; identify, based on the preference criteria for the user, a representative item for a collection of items; and display, to the user, the representative item. 15. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to obtain, from at least one source, the history of interests associated with the user. 16. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to change the representative item to a different representative item for the collection of items to allow the different representative item to be displayed to the user. 17. The product of claim 16, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to change the representative item to the different representative item according to a number of times the representative item is displayed to the user. 18. The product of claim 16, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to randomly change the representative item to the different representative item, change the representative item to the different representative item based on a round robin, or combinations thereof. 19. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to display, to a different user, a different representative item for the collection of items based on preference criteria for the different user. 20. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to apply a natural language processing (NLP) to content within the history of interests to characterize the content. | Displaying a representative item for a collection of items includes obtaining, from at least one source, a history of interests associated with a user, analyzing the history of interests associated with the user to determine preference criteria for the user, identifying, based on the preference criteria for the user, a representative item for a collection of items, and displaying, to the user, the representative item.1-8. (canceled) 9. A system for displaying a representative item for a collection of items, the system comprising:
an obtaining engine to obtain, from at least one source, a history of interests associated with a user; an analyzing engine to analyze the history of interests associated with the user to determine preference criteria for the user; an identifying engine to identify, based on the preference criteria for the user, a representative item for a collection of items; a representative item displaying engine to display, to the user, the representative item; a changing engine to change the representative item to a different representative item for the collection of items to allow the different representative item to be displayed to the user; and a different representative item displaying engine to display, to a different user, a different representative item for the collection of items. 10. The system of claim 9, in which the analyzing engine analyzes the history of interests associated with the user to determine the preference criteria for the user by applying a natural language processing (NLP) to content within the history of interests to characterize the content. 11. The system of claim 9, in which the changing engine changes the representative item to the different representative item for the collection of items to allow the different representative item to be displayed to the user by changing the representative item to the different representative item according to a number of times the representative item is displayed to the user, changing the representative item to the different representative item randomly, changing the representative item to the different representative item based on a round robin, or combinations thereof. 12. The system of claim 9, in which the obtaining engine obtains, from the at least one source, the history of interests associated with the user by monitoring activities of the user and a similar user to capture explicit interests of the user, implicit interests of the user, explicit interests of the similar user, implicit interests of the similar user, or combinations thereof. 13. The system of claim 9, in which the different representative item displaying engine displays the different representative item for the collection of items based on preference criteria for the different user. 14. A computer program product for displaying a representative item for a collection of items, comprising:
a tangible computer readable storage medium, said tangible computer readable storage medium comprising computer readable program code embodied therewith, said computer readable program code comprising program instructions that, when executed, causes a processor to: analyze a history of interests associated with a user to determine preference criteria for the user; identify, based on the preference criteria for the user, a representative item for a collection of items; and display, to the user, the representative item. 15. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to obtain, from at least one source, the history of interests associated with the user. 16. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to change the representative item to a different representative item for the collection of items to allow the different representative item to be displayed to the user. 17. The product of claim 16, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to change the representative item to the different representative item according to a number of times the representative item is displayed to the user. 18. The product of claim 16, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to randomly change the representative item to the different representative item, change the representative item to the different representative item based on a round robin, or combinations thereof. 19. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to display, to a different user, a different representative item for the collection of items based on preference criteria for the different user. 20. The product of claim 14, further comprising computer readable program code comprising program instructions that, when executed, cause said processor to apply a natural language processing (NLP) to content within the history of interests to characterize the content. | 2,100 |
4,433 | 14,543,299 | 2,139 | A technique for automating the construction of multiple virtual images with interdependencies includes creating a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI. A second VI instance is created by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI. The first and second VI instances are then deployed to designated machines in a cloud environment for execution. | 1-8. (canceled) 9. A computer program product for automating the construction of multiple virtual images with interdependencies, the computer program product comprising:
a computer-readable storage device having computer-readable program code embodied thereon, wherein the computer-readable program code, when executed by a data processing system, causes the data processing system to:
create a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI;
create a second VI instance by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI; and
deploy the first and second VI instances to designated virtual machines in a cloud environment for execution. 10. The computer program product of claim 9, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
create a third VI instance by extending a third base VI based on input values associated with the third base VI, instance values received from the second VI instance, and software bundles associated with the third base VI. 11. The computer program product of claim 10, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
create a fourth VI instance by extending a fourth base VI based on input values associated with a fourth base VI, instance values received from the third VI instance, and software bundles associated with the fourth base VI. 12. The computer program product of claim 9, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
in response to completing creation of the second VI instance, store the first and second VI instances in a repository. 13. The computer program product of claim 9, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
in response to deploying the first and second VI instances, delete locally stored copies of the first and second VI instances. 14. The computer program product of claim 9, wherein a source control management product executes an automation process that initiates a build image creation process to create the first and second VI instances. 15. The computer program product of claim 14, wherein the source management control product also deploys the dependency instance values of target products in a deployment tool. 16-20. (canceled) 21. A data processing system, comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
create a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI;
create a second VI instance by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI; and
deploy the first and second VI instances to designated virtual machines in a cloud environment for execution. | A technique for automating the construction of multiple virtual images with interdependencies includes creating a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI. A second VI instance is created by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI. The first and second VI instances are then deployed to designated machines in a cloud environment for execution.1-8. (canceled) 9. A computer program product for automating the construction of multiple virtual images with interdependencies, the computer program product comprising:
a computer-readable storage device having computer-readable program code embodied thereon, wherein the computer-readable program code, when executed by a data processing system, causes the data processing system to:
create a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI;
create a second VI instance by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI; and
deploy the first and second VI instances to designated virtual machines in a cloud environment for execution. 10. The computer program product of claim 9, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
create a third VI instance by extending a third base VI based on input values associated with the third base VI, instance values received from the second VI instance, and software bundles associated with the third base VI. 11. The computer program product of claim 10, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
create a fourth VI instance by extending a fourth base VI based on input values associated with a fourth base VI, instance values received from the third VI instance, and software bundles associated with the fourth base VI. 12. The computer program product of claim 9, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
in response to completing creation of the second VI instance, store the first and second VI instances in a repository. 13. The computer program product of claim 9, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to:
in response to deploying the first and second VI instances, delete locally stored copies of the first and second VI instances. 14. The computer program product of claim 9, wherein a source control management product executes an automation process that initiates a build image creation process to create the first and second VI instances. 15. The computer program product of claim 14, wherein the source management control product also deploys the dependency instance values of target products in a deployment tool. 16-20. (canceled) 21. A data processing system, comprising:
a memory; and a processor coupled to the memory, wherein the processor is configured to:
create a first virtual image (VI) instance by extending a first base VI based on input values associated with the first base VI and software bundles associated with the first base VI;
create a second VI instance by extending a second base VI based on input values associated with the second base VI, instance values received from the first VI instance, dependency instance values received from a deployed dependency instance, and software bundles associated with the second base VI; and
deploy the first and second VI instances to designated virtual machines in a cloud environment for execution. | 2,100 |
4,434 | 14,630,914 | 2,167 | Displaying a representative item for a collection of items includes obtaining, from at least one source, a history of interests associated with a user, analyzing the history of interests associated with the user to determine preference criteria for the user, identifying, based on the preference criteria for the user, a representative item for a collection of items, and displaying, to the user, the representative item. | 1. A method for displaying a representative item for a collection of items, the method comprising:
obtaining, from at least one source, a history of interests associated with a user; analyzing the history of interests associated with the user to determine preference criteria for the user; identifying, based on the preference criteria for the user, a representative item for a collection of items; and displaying, to the user, the representative item. 2. The method of claim 1, in which analyzing the history of interests associated with the user to determine the preference criteria for the user comprises applying a natural language processing (NLP) to content within the history of interests to characterize the content. 3. The method of claim 1, further comprising changing the representative item to a different representative item for the collection of items to allow the different representative item to be displayed to the user. 4. The method of claim 3, in which changing the representative item to the different representative item for the collection of items to allow the different representative item to be displayed to the user comprises changing the representative item to the different representative item according to a number of times the representative item is displayed to the user, changing the representative item to the different representative item randomly, changing the representative item to the different representative item based on a round robin, or combinations thereof. 5. The method of claim 1, in which the collection of items comprises images, uniform resource locators (URL), messages, videos, audio, or combinations thereof. 6. The method of claim 1, in which obtaining, from the at least one source, the history of interests associated with the user comprises monitoring activities of the user and a similar user to capture explicit interests of the user, implicit interests of the user, explicit interests of the similar user, implicit interests of the similar user, or combinations thereof. 7. The method of claim 1, further comprising displaying, to a different user, a different representative item for the collection of items. 8. The method of claim 7, in which the different representative item for the collection of items is based on preference criteria for the different user. | Displaying a representative item for a collection of items includes obtaining, from at least one source, a history of interests associated with a user, analyzing the history of interests associated with the user to determine preference criteria for the user, identifying, based on the preference criteria for the user, a representative item for a collection of items, and displaying, to the user, the representative item.1. A method for displaying a representative item for a collection of items, the method comprising:
obtaining, from at least one source, a history of interests associated with a user; analyzing the history of interests associated with the user to determine preference criteria for the user; identifying, based on the preference criteria for the user, a representative item for a collection of items; and displaying, to the user, the representative item. 2. The method of claim 1, in which analyzing the history of interests associated with the user to determine the preference criteria for the user comprises applying a natural language processing (NLP) to content within the history of interests to characterize the content. 3. The method of claim 1, further comprising changing the representative item to a different representative item for the collection of items to allow the different representative item to be displayed to the user. 4. The method of claim 3, in which changing the representative item to the different representative item for the collection of items to allow the different representative item to be displayed to the user comprises changing the representative item to the different representative item according to a number of times the representative item is displayed to the user, changing the representative item to the different representative item randomly, changing the representative item to the different representative item based on a round robin, or combinations thereof. 5. The method of claim 1, in which the collection of items comprises images, uniform resource locators (URL), messages, videos, audio, or combinations thereof. 6. The method of claim 1, in which obtaining, from the at least one source, the history of interests associated with the user comprises monitoring activities of the user and a similar user to capture explicit interests of the user, implicit interests of the user, explicit interests of the similar user, implicit interests of the similar user, or combinations thereof. 7. The method of claim 1, further comprising displaying, to a different user, a different representative item for the collection of items. 8. The method of claim 7, in which the different representative item for the collection of items is based on preference criteria for the different user. | 2,100 |
4,435 | 12,351,948 | 2,194 | A software transactional memory (STM) test generator is provided that converts existing test code into test code that tests the functionality of an STM system. To generate the STM test code, the generator inserts transactional semantics into the existing test code and replaces any methods of the test code that are not supported by an STM system. The STM test code is compiled and executed to generate an STM test output, and the STM test output is compared to the output of the existing test code to produce STM test results. | 1. A method performed by a software transactional memory (STM) test generator in a computer system to generate STM test code, the method comprising:
inserting first transactional semantics configured to form a first transaction into non-STM test code; and replacing a first method in the non-STM test code that is not supported by an STM system into a second method that is supported by the STM system; and storing the non-STM test code with the first transactional semantics and the second method as the STM code on a computer-readable medium accessible by the computer system. 2. The method of claim 1 further comprising:
performing a functional analysis on the non-STM test code to identify the first method. 3. The method of claim 1 wherein the second method is configured to suppress the first method. 4. The method of claim 1 wherein the second method is a synthesized version of the first method. 5. The method of claim 1 further comprising:
inserting second transactional semantics configured to form a second transaction into the non-STM test code. 6. The method of claim 1 further comprising:
inserting second transactional semantics configured to cause the first transaction to be re-executed into the non-STM test code. 7. The method of claim 1 further comprising:
compiling the STM test code to generate executable STM test code; and executing the executable STM test code to generate an STM test output. 8. The method of claim 7 further comprising:
comparing the STM test output to a non-STM test output corresponding to the non-STM test code to generate an STM test result; and storing the STM test result in the computer-readable medium. 9. A method performed by a computer system, the method comprising:
compiling software transactional memory (STM) test code to generate executable STM test code, the STM test code generated from non-STM test code; executing the executable STM test code to generate an STM test output; and storing the STM test output in a computer-readable medium accessible by the computer system. 10. The method of claim 9 wherein executing the executable STM test code includes executing a transaction of the STM test code using an STM system in the computer system. 11. The method of claim 10 wherein executing the executable STM test code includes re-executing the transaction of the STM test code using the STM system. 12. The method of claim 9 wherein executing the executable STM test code includes executing a first version of a method in the STM test code that differs from a second version of the method in the non-STM test code. 13. The method of claim 9 further comprising:
comparing the STM test output to a non-STM test output corresponding to the non-STM test code to generate an STM test result; and storing the STM test result in the computer-readable medium. 14. The method of claim 13 further comprising:
compiling the non-STM test code to generate executable non-STM test code; executing the executable non-STM test code to generate a non-STM test output; and storing the non-STM test output in the computer-readable medium. 15. A computer readable storage medium storing computer-executable instructions that, when executed by a computer system, perform a method of generating software transactional memory (STM) test code comprising:
inserting first transactional semantics configured to form a first transaction into non-STM test code; and replacing a first method in the non-STM test code that is not supported by an STM system into a second method that is supported by the STM system; and storing the non-STM test code with the first transactional semantics and the second method as the STM code on a computer-readable medium accessible by the computer system. 16. The computer readable storage medium of claim 15, wherein the second method is configured to suppress the first method. 17. The computer readable storage medium of claim 15, wherein the second method is a synthesized version of the first method. 18. The computer readable storage medium of claim 15, the method further comprising:
performing a functional analysis on the non-STM test code to identify the first method. 19. The computer readable storage medium of claim 18, the method further comprising:
inserting second transactional semantics configured to form a second transaction into the non-STM test code; and inserting third transactional semantics configured to cause the first transaction to be re-executed into the non-STM test code. 20. The computer readable storage medium of claim 15, the method further comprising:
compiling the STM test code to generate executable STM test code; and executing the executable STM test code to generate an STM test output. | A software transactional memory (STM) test generator is provided that converts existing test code into test code that tests the functionality of an STM system. To generate the STM test code, the generator inserts transactional semantics into the existing test code and replaces any methods of the test code that are not supported by an STM system. The STM test code is compiled and executed to generate an STM test output, and the STM test output is compared to the output of the existing test code to produce STM test results.1. A method performed by a software transactional memory (STM) test generator in a computer system to generate STM test code, the method comprising:
inserting first transactional semantics configured to form a first transaction into non-STM test code; and replacing a first method in the non-STM test code that is not supported by an STM system into a second method that is supported by the STM system; and storing the non-STM test code with the first transactional semantics and the second method as the STM code on a computer-readable medium accessible by the computer system. 2. The method of claim 1 further comprising:
performing a functional analysis on the non-STM test code to identify the first method. 3. The method of claim 1 wherein the second method is configured to suppress the first method. 4. The method of claim 1 wherein the second method is a synthesized version of the first method. 5. The method of claim 1 further comprising:
inserting second transactional semantics configured to form a second transaction into the non-STM test code. 6. The method of claim 1 further comprising:
inserting second transactional semantics configured to cause the first transaction to be re-executed into the non-STM test code. 7. The method of claim 1 further comprising:
compiling the STM test code to generate executable STM test code; and executing the executable STM test code to generate an STM test output. 8. The method of claim 7 further comprising:
comparing the STM test output to a non-STM test output corresponding to the non-STM test code to generate an STM test result; and storing the STM test result in the computer-readable medium. 9. A method performed by a computer system, the method comprising:
compiling software transactional memory (STM) test code to generate executable STM test code, the STM test code generated from non-STM test code; executing the executable STM test code to generate an STM test output; and storing the STM test output in a computer-readable medium accessible by the computer system. 10. The method of claim 9 wherein executing the executable STM test code includes executing a transaction of the STM test code using an STM system in the computer system. 11. The method of claim 10 wherein executing the executable STM test code includes re-executing the transaction of the STM test code using the STM system. 12. The method of claim 9 wherein executing the executable STM test code includes executing a first version of a method in the STM test code that differs from a second version of the method in the non-STM test code. 13. The method of claim 9 further comprising:
comparing the STM test output to a non-STM test output corresponding to the non-STM test code to generate an STM test result; and storing the STM test result in the computer-readable medium. 14. The method of claim 13 further comprising:
compiling the non-STM test code to generate executable non-STM test code; executing the executable non-STM test code to generate a non-STM test output; and storing the non-STM test output in the computer-readable medium. 15. A computer readable storage medium storing computer-executable instructions that, when executed by a computer system, perform a method of generating software transactional memory (STM) test code comprising:
inserting first transactional semantics configured to form a first transaction into non-STM test code; and replacing a first method in the non-STM test code that is not supported by an STM system into a second method that is supported by the STM system; and storing the non-STM test code with the first transactional semantics and the second method as the STM code on a computer-readable medium accessible by the computer system. 16. The computer readable storage medium of claim 15, wherein the second method is configured to suppress the first method. 17. The computer readable storage medium of claim 15, wherein the second method is a synthesized version of the first method. 18. The computer readable storage medium of claim 15, the method further comprising:
performing a functional analysis on the non-STM test code to identify the first method. 19. The computer readable storage medium of claim 18, the method further comprising:
inserting second transactional semantics configured to form a second transaction into the non-STM test code; and inserting third transactional semantics configured to cause the first transaction to be re-executed into the non-STM test code. 20. The computer readable storage medium of claim 15, the method further comprising:
compiling the STM test code to generate executable STM test code; and executing the executable STM test code to generate an STM test output. | 2,100 |
4,436 | 13,691,620 | 2,177 | Systems and methods for creating a customized digital publication are disclosed. For example, one disclosed method for creating a customized digital publication comprises receiving, at an application builder executed by a processor, a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application, and custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell, and producing the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code. | 1. A method comprising:
receiving, at an application builder executed by a processor,
a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application; and
custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell; and
producing the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code. 2. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to create the custom feature included in the produced digital publication application. 3. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to set or retrieve an application state. 4. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to control the starting or use an application process. 5. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to respond to a change that originates within native code of the digital publication application shell. 6. The method of claim 1 wherein the custom feature code exposes a feature set for use by the application builder in editing the digital publication application. 7. The method of claim 1 wherein the custom feature code exposes a feature set for use by the application builder in editing the digital publication application, wherein the application builder provides a user interface for editing the digital publication application with one or more features of the feature set 8. The method of claim 1 wherein the custom feature code exposes the custom feature for use by the application builder in editing the digital publication application, wherein input received at the application builder specifies inclusion of the custom feature in the digital publication application. 9. The method of claim 1 wherein the custom feature code exposes the custom feature for use by the application builder in editing the digital publication application, wherein input received at the application builder specifies an attribute of the custom feature in the digital publication application. 10. The method of claim 1 wherein the custom feature code exposes the custom feature for use by the application builder in editing the digital publication application, wherein the application builder provides a user interface comprising a selectable icon or button for including the custom feature in the digital publication application. 11. The method of claim 1 wherein the application builder further comprises an interface for creating the custom feature code. 12. The method of claim 1 further comprising receiving input at the application builder to include the custom feature in the digital publication application. 13. The method of claim 1 wherein the custom feature code comprises Hyper-Text Markup Language (HTML) code. 14. The method of claim 1 further comprising:
receiving, at the application builder, additional custom feature code specifying one or more additional custom features for the digital publication application; and
generating the digital publication application based at least in part on the digital publication application shell, the custom feature code and the additional custom feature code, wherein the digital publication application comprises at least some of the standard functionality and appearance features specified by the digital publication application shell, the custom feature specified by the custom feature code, and the one or more additional custom features specified by the additional custom feature code. 15. The method of claim 1 wherein the digital publication application is a library providing an interface for accessing items of electronic content. 16. The method of claim 1 wherein the custom feature code has a first format, the digital publication application has a second format different from the first format, and wherein the digital publication application is configured for use in an environment in which the first format is not operable. 17. A non-transitory computer-readable medium on which is encoded program code, the program code comprising:
program code for receiving, at an application builder,
a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application; and
custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell; and
program code for producing the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code. 18. The computer-readable medium of claim 17 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to create the custom feature included in the produced digital publication application. 19. The computer-readable medium of claim 17 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to set or retrieve an application state. 20. A system comprising:
a computer-readable medium; and a processor in communication with the computer-readable medium, the processor configured to, when executed by a processor:
receive, at an application builder executed by a processor,
a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application; and
custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell; and
produce the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code. | Systems and methods for creating a customized digital publication are disclosed. For example, one disclosed method for creating a customized digital publication comprises receiving, at an application builder executed by a processor, a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application, and custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell, and producing the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code.1. A method comprising:
receiving, at an application builder executed by a processor,
a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application; and
custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell; and
producing the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code. 2. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to create the custom feature included in the produced digital publication application. 3. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to set or retrieve an application state. 4. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to control the starting or use an application process. 5. The method of claim 1 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to respond to a change that originates within native code of the digital publication application shell. 6. The method of claim 1 wherein the custom feature code exposes a feature set for use by the application builder in editing the digital publication application. 7. The method of claim 1 wherein the custom feature code exposes a feature set for use by the application builder in editing the digital publication application, wherein the application builder provides a user interface for editing the digital publication application with one or more features of the feature set 8. The method of claim 1 wherein the custom feature code exposes the custom feature for use by the application builder in editing the digital publication application, wherein input received at the application builder specifies inclusion of the custom feature in the digital publication application. 9. The method of claim 1 wherein the custom feature code exposes the custom feature for use by the application builder in editing the digital publication application, wherein input received at the application builder specifies an attribute of the custom feature in the digital publication application. 10. The method of claim 1 wherein the custom feature code exposes the custom feature for use by the application builder in editing the digital publication application, wherein the application builder provides a user interface comprising a selectable icon or button for including the custom feature in the digital publication application. 11. The method of claim 1 wherein the application builder further comprises an interface for creating the custom feature code. 12. The method of claim 1 further comprising receiving input at the application builder to include the custom feature in the digital publication application. 13. The method of claim 1 wherein the custom feature code comprises Hyper-Text Markup Language (HTML) code. 14. The method of claim 1 further comprising:
receiving, at the application builder, additional custom feature code specifying one or more additional custom features for the digital publication application; and
generating the digital publication application based at least in part on the digital publication application shell, the custom feature code and the additional custom feature code, wherein the digital publication application comprises at least some of the standard functionality and appearance features specified by the digital publication application shell, the custom feature specified by the custom feature code, and the one or more additional custom features specified by the additional custom feature code. 15. The method of claim 1 wherein the digital publication application is a library providing an interface for accessing items of electronic content. 16. The method of claim 1 wherein the custom feature code has a first format, the digital publication application has a second format different from the first format, and wherein the digital publication application is configured for use in an environment in which the first format is not operable. 17. A non-transitory computer-readable medium on which is encoded program code, the program code comprising:
program code for receiving, at an application builder,
a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application; and
custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell; and
program code for producing the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code. 18. The computer-readable medium of claim 17 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to create the custom feature included in the produced digital publication application. 19. The computer-readable medium of claim 17 wherein custom feature code comprises an API command that communicates with the API of the digital publication shell, wherein the application builder interprets the API command to set or retrieve an application state. 20. A system comprising:
a computer-readable medium; and a processor in communication with the computer-readable medium, the processor configured to, when executed by a processor:
receive, at an application builder executed by a processor,
a digital publication application shell comprising an application programming interface (API), the digital publication application shell specifying standard functionality or appearance features for a digital publication application; and
custom feature code specifying a custom feature based at least in part on a reference to the API of the digital publication shell; and
produce the digital publication application based at least in part on the digital publication application shell and the custom feature code, wherein the digital publication application comprises at least some of the standard functionality or appearance features specified by the digital publication application shell and the custom feature specified by the custom feature code. | 2,100 |
4,437 | 14,285,122 | 2,177 | A custom design system is provided that allows real-time design of products by a user and improves the design experience for designing custom products. In one implementation, a system is provided that is capable of scaling vector-based images for various outputs (e.g., printing, display, etc.) without human intervention and without appreciable image degradation. In another implementation, it would be beneficial to allow real-time editing of design data in relation to custom product creation within a client's web browser application. It is appreciated that if a custom product may be designed within a web browser experience, a more seamless design experience may be created for the user. In particular, if design processing were offloaded to the client (e.g., within the web browser), delays in performing certain operations such as saves and updates would be reduced. To this end, a system that provides such capability using vector-based design image formats may be used. | 1. A system for creating a custom design, the system comprising:
a client system including at least one processor operatively connected to a memory; an interface configured to receive one or more inputs, the one or more inputs being used to create a design, the design including at least one vector-based design element; wherein the memory of the client system is adapted to store the at least one vector-based design element; a component adapted to modify the at least one vector-based design element and store the modification in the memory of the client system; and a component adapted to render the modification of the at least one vector-based design element within the interface. 2. The system according to claim 1, wherein the component adapted to modify the at least one vector-based design element and store the modification in the memory of the client system and the component adapted to render the modification of the at least one vector-based design element within the interface are operable on the client without the need for server-based processing. 3. The system according to claim 1, wherein the at least one vector-based design element includes image information in at least one of a group of formats comprising:
Small Web Format (SWF); Scalable Vector Graphics (SVG); Encapsulated Postscript (EPS); and Postscript (PS). 4. The system according to claim 1, wherein the interface configured to accept from the user a design including the at least one vector-based design element includes a browser-based interface through which the at least one vector-based design element is created. 5. The system according to claim 4, wherein the at least one vector-based design element is manipulated using a browser-based editing component. 6. The system according to claim 5, wherein the browser-based editing component is implemented using at least one of Flash programming and HTML5 programming. 7. The system according to claim 1, further comprising a preview interface that is adapted to display, in real-time, an update of the at least one vector-based design element in relation to a base custom product. 8. The system according to claim 7, further comprising a component adapted to apply a transformation to the at least one vector-based design element to display a modified at least one vector-based design element in relation to the base custom product. 9. The system according to claim 1, wherein the memory of the client system includes a cache that stores the at least one vector-based design element. 10. The system according to claim 9, wherein operations performed within the interface of the client system are applied directly to the at least one vector-based design element and updates to a displayed representation of the at least one vector-based design are performed responsive to the operations performed within the interface of the client system without receiving updates from system other than the client system. 11. The system according to claim 1, further comprising a plurality of custom product templates upon which the at least one vector-based design element may be rendered. 12. The system according to claim 11, wherein at least one of the plurality of custom product templates includes information describing a surface of a custom product, and wherein the processor applies a transformation of the at least one vector-based design element to display the at least one vector-based design element on the surface of the custom product. 13. The system according to claim 12, further comprising an interface that is adapted to display the at least one vector-based design element on the surface of the custom product to the user. 14. The system according to claim 1, further comprising a component adapted to import a raster-based image file and associating the raster-based image file with the at least one vector-based design element. 15. The system according to claim 14, wherein the component adapted to import the raster-based image file is configured to determine a maximum scaling size of the image file relative to an acceptable printing quality of a particular custom product. 16. The system according to claim 8, wherein the transformation is performed independently by the client system. 17. The system according to claim 1, further comprising a component that automatically applies a transformation to the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 18. The system according to claim 1, further comprising a component adapted to sample one or more aspects of the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 19. The system according to claim 18, wherein the one or more aspects of the at least one vector-based design element include a color associated with the at least one vector-based design element. 20. The system according to claim 1, further comprising a conversion component that is adapted to convert the at least one vector-based design element to an output file having a format. 21. The system according to claim 20, wherein the output file format includes a file format that can be printed on a base product by a production system. 22. The system according to claim 20, wherein the output file is capable of being downloaded to a client system. 23. The system according to claim 20, wherein the output file may be displayed within an interface of a computer system. 24. The system according to claim 20, wherein the file format includes at least one of a vector image format and a raster image format. 25. The system according to claim 1, wherein the one or more inputs include inputs provided by a user. 26. The system according to claim 1, wherein the one or more inputs include at least one of a group comprising:
an image; a modification of an image; and a text input. 27. The system according to claim 1, wherein the one or more inputs include inputs provided by a user. 28. The system according to claim 1, wherein the one or more inputs are received automatically by the system. 29. The system according to claim 21, wherein the conversion component operates without operator intervention. 30. A method for designing a custom product, the method comprising acts of:
receiving one or more inputs; creating, using the one or more inputs, a design of at least one custom product, the design including at least one vector-based design element; storing, in a memory of the client system, the at least one vector-based design element; modifying the at least one vector-based design element and storing the modification in the memory of the client system; and rendering the modification of the at least one vector-based design element within the client interface. 31. The method according to claim 30, wherein the acts of modifying the at least one vector-based design element, storing the modification in the memory of the client system and rendering the modification of the at least one vector-based design element within the client interface are operable on the client system without the need for server-based processing. 32. The method according to claim 30, wherein the at least one vector-based design element includes image information in at least one of a group of formats comprising:
Small Web Format (SWF); Scalable Vector Graphics (SVG); Encapsulated Postscript (EPS); and Postscript (PS). 33. The method according to claim 30, wherein the client interface includes a browser-based interface through which the at least one vector-based design element is created. 34. The method according to claim 33, further comprising an act of manipulating the at least one vector-based design element using a browser-based editing component. 35. The method according to claim 34, wherein the browser-based editing component is implemented using at least one of Flash programming and HTML5 programming. 36. The method according to claim 30, further comprising an act of displaying, in real-time, an update of the at least one vector-based design element in relation to a base custom product. 37. The method according to claim 36, further comprising an act of applying a transformation to the at least one vector-based design element to display a modified at least one vector-based design element in relation to the base custom product. 38. The method according to claim 30, further comprising an act of storing, in a cache associated with the memory of the client system, the at least one vector-based design element. 39. The method according to claim 38, further comprising applying operations performed within the interface of the client system directly to the at least one vector-based design element and updating a displayed representation of the at least one vector-based design responsive to the operations performed within the interface of the client system without receiving updates from system other than the client system. 40. The method according to claim 30, further comprising maintaining a plurality of custom product templates upon which the at least one vector-based design element may be rendered. 41. The method according to claim 40, wherein at least one of the plurality of custom product templates includes information describing a surface of a custom product, and wherein the method further comprises an act of applying a transformation of the at least one vector-based design element to display the at least one vector-based design element on the surface of the custom product. 42. The method according to claim 41, further comprising an act of displaying the at least one vector-based design element on the surface of the custom product to the user. 43. The method according to claim 30, further comprising an act of importing a raster-based image file and associating the raster-based image file with the at least one vector-based design element. 44. The method according to claim 43, further comprising an act of determining a maximum scaling size of the raster-based image file relative to an acceptable printing quality of a particular custom product. 45. The method according to claim 38, wherein the transformation is performed independently by the client system. 46. The method according to claim 30, further comprising an act of automatically applying a transformation to the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 47. The method according to claim 30, further comprising an act of sampling one or more aspects of the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 48. The method according to claim 47, wherein the one or more aspects of the at least one vector-based design element include a color associated with the at least one vector-based design element. 49. The method according to claim 30, further comprising an act of converting the at least one vector-based design element to an output file having a format. 50. The method according to claim 49, wherein the output file format includes a file format that can be printed on a base product by a production system. 51. The system according to claim 49, wherein the output file may be downloaded to a client system. 52. The method according to claim 49, further comprising displaying the output file within an interface of a computer system. 53. The method according to claim 49, wherein the file format includes at least one of a vector image format and a raster image format. 54. The method according to claim 30, wherein the one or more inputs include inputs provided by a user. 55. The method according to claim 30, wherein the one or more inputs include at least one of a group comprising:
an image; a modification of an image; and a text input. 56. The method according to claim 30, wherein the one or more inputs include inputs provided by a user. 57. The method according to claim 30, wherein the one or more inputs are received automatically. 58. The method according to claim 43, wherein the conversion component operates without operator intervention. | A custom design system is provided that allows real-time design of products by a user and improves the design experience for designing custom products. In one implementation, a system is provided that is capable of scaling vector-based images for various outputs (e.g., printing, display, etc.) without human intervention and without appreciable image degradation. In another implementation, it would be beneficial to allow real-time editing of design data in relation to custom product creation within a client's web browser application. It is appreciated that if a custom product may be designed within a web browser experience, a more seamless design experience may be created for the user. In particular, if design processing were offloaded to the client (e.g., within the web browser), delays in performing certain operations such as saves and updates would be reduced. To this end, a system that provides such capability using vector-based design image formats may be used.1. A system for creating a custom design, the system comprising:
a client system including at least one processor operatively connected to a memory; an interface configured to receive one or more inputs, the one or more inputs being used to create a design, the design including at least one vector-based design element; wherein the memory of the client system is adapted to store the at least one vector-based design element; a component adapted to modify the at least one vector-based design element and store the modification in the memory of the client system; and a component adapted to render the modification of the at least one vector-based design element within the interface. 2. The system according to claim 1, wherein the component adapted to modify the at least one vector-based design element and store the modification in the memory of the client system and the component adapted to render the modification of the at least one vector-based design element within the interface are operable on the client without the need for server-based processing. 3. The system according to claim 1, wherein the at least one vector-based design element includes image information in at least one of a group of formats comprising:
Small Web Format (SWF); Scalable Vector Graphics (SVG); Encapsulated Postscript (EPS); and Postscript (PS). 4. The system according to claim 1, wherein the interface configured to accept from the user a design including the at least one vector-based design element includes a browser-based interface through which the at least one vector-based design element is created. 5. The system according to claim 4, wherein the at least one vector-based design element is manipulated using a browser-based editing component. 6. The system according to claim 5, wherein the browser-based editing component is implemented using at least one of Flash programming and HTML5 programming. 7. The system according to claim 1, further comprising a preview interface that is adapted to display, in real-time, an update of the at least one vector-based design element in relation to a base custom product. 8. The system according to claim 7, further comprising a component adapted to apply a transformation to the at least one vector-based design element to display a modified at least one vector-based design element in relation to the base custom product. 9. The system according to claim 1, wherein the memory of the client system includes a cache that stores the at least one vector-based design element. 10. The system according to claim 9, wherein operations performed within the interface of the client system are applied directly to the at least one vector-based design element and updates to a displayed representation of the at least one vector-based design are performed responsive to the operations performed within the interface of the client system without receiving updates from system other than the client system. 11. The system according to claim 1, further comprising a plurality of custom product templates upon which the at least one vector-based design element may be rendered. 12. The system according to claim 11, wherein at least one of the plurality of custom product templates includes information describing a surface of a custom product, and wherein the processor applies a transformation of the at least one vector-based design element to display the at least one vector-based design element on the surface of the custom product. 13. The system according to claim 12, further comprising an interface that is adapted to display the at least one vector-based design element on the surface of the custom product to the user. 14. The system according to claim 1, further comprising a component adapted to import a raster-based image file and associating the raster-based image file with the at least one vector-based design element. 15. The system according to claim 14, wherein the component adapted to import the raster-based image file is configured to determine a maximum scaling size of the image file relative to an acceptable printing quality of a particular custom product. 16. The system according to claim 8, wherein the transformation is performed independently by the client system. 17. The system according to claim 1, further comprising a component that automatically applies a transformation to the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 18. The system according to claim 1, further comprising a component adapted to sample one or more aspects of the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 19. The system according to claim 18, wherein the one or more aspects of the at least one vector-based design element include a color associated with the at least one vector-based design element. 20. The system according to claim 1, further comprising a conversion component that is adapted to convert the at least one vector-based design element to an output file having a format. 21. The system according to claim 20, wherein the output file format includes a file format that can be printed on a base product by a production system. 22. The system according to claim 20, wherein the output file is capable of being downloaded to a client system. 23. The system according to claim 20, wherein the output file may be displayed within an interface of a computer system. 24. The system according to claim 20, wherein the file format includes at least one of a vector image format and a raster image format. 25. The system according to claim 1, wherein the one or more inputs include inputs provided by a user. 26. The system according to claim 1, wherein the one or more inputs include at least one of a group comprising:
an image; a modification of an image; and a text input. 27. The system according to claim 1, wherein the one or more inputs include inputs provided by a user. 28. The system according to claim 1, wherein the one or more inputs are received automatically by the system. 29. The system according to claim 21, wherein the conversion component operates without operator intervention. 30. A method for designing a custom product, the method comprising acts of:
receiving one or more inputs; creating, using the one or more inputs, a design of at least one custom product, the design including at least one vector-based design element; storing, in a memory of the client system, the at least one vector-based design element; modifying the at least one vector-based design element and storing the modification in the memory of the client system; and rendering the modification of the at least one vector-based design element within the client interface. 31. The method according to claim 30, wherein the acts of modifying the at least one vector-based design element, storing the modification in the memory of the client system and rendering the modification of the at least one vector-based design element within the client interface are operable on the client system without the need for server-based processing. 32. The method according to claim 30, wherein the at least one vector-based design element includes image information in at least one of a group of formats comprising:
Small Web Format (SWF); Scalable Vector Graphics (SVG); Encapsulated Postscript (EPS); and Postscript (PS). 33. The method according to claim 30, wherein the client interface includes a browser-based interface through which the at least one vector-based design element is created. 34. The method according to claim 33, further comprising an act of manipulating the at least one vector-based design element using a browser-based editing component. 35. The method according to claim 34, wherein the browser-based editing component is implemented using at least one of Flash programming and HTML5 programming. 36. The method according to claim 30, further comprising an act of displaying, in real-time, an update of the at least one vector-based design element in relation to a base custom product. 37. The method according to claim 36, further comprising an act of applying a transformation to the at least one vector-based design element to display a modified at least one vector-based design element in relation to the base custom product. 38. The method according to claim 30, further comprising an act of storing, in a cache associated with the memory of the client system, the at least one vector-based design element. 39. The method according to claim 38, further comprising applying operations performed within the interface of the client system directly to the at least one vector-based design element and updating a displayed representation of the at least one vector-based design responsive to the operations performed within the interface of the client system without receiving updates from system other than the client system. 40. The method according to claim 30, further comprising maintaining a plurality of custom product templates upon which the at least one vector-based design element may be rendered. 41. The method according to claim 40, wherein at least one of the plurality of custom product templates includes information describing a surface of a custom product, and wherein the method further comprises an act of applying a transformation of the at least one vector-based design element to display the at least one vector-based design element on the surface of the custom product. 42. The method according to claim 41, further comprising an act of displaying the at least one vector-based design element on the surface of the custom product to the user. 43. The method according to claim 30, further comprising an act of importing a raster-based image file and associating the raster-based image file with the at least one vector-based design element. 44. The method according to claim 43, further comprising an act of determining a maximum scaling size of the raster-based image file relative to an acceptable printing quality of a particular custom product. 45. The method according to claim 38, wherein the transformation is performed independently by the client system. 46. The method according to claim 30, further comprising an act of automatically applying a transformation to the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 47. The method according to claim 30, further comprising an act of sampling one or more aspects of the at least one vector-based design element to render an alternative custom product for presentation to the user within the interface. 48. The method according to claim 47, wherein the one or more aspects of the at least one vector-based design element include a color associated with the at least one vector-based design element. 49. The method according to claim 30, further comprising an act of converting the at least one vector-based design element to an output file having a format. 50. The method according to claim 49, wherein the output file format includes a file format that can be printed on a base product by a production system. 51. The system according to claim 49, wherein the output file may be downloaded to a client system. 52. The method according to claim 49, further comprising displaying the output file within an interface of a computer system. 53. The method according to claim 49, wherein the file format includes at least one of a vector image format and a raster image format. 54. The method according to claim 30, wherein the one or more inputs include inputs provided by a user. 55. The method according to claim 30, wherein the one or more inputs include at least one of a group comprising:
an image; a modification of an image; and a text input. 56. The method according to claim 30, wherein the one or more inputs include inputs provided by a user. 57. The method according to claim 30, wherein the one or more inputs are received automatically. 58. The method according to claim 43, wherein the conversion component operates without operator intervention. | 2,100 |
4,438 | 13,634,013 | 2,158 | Technologies related to multiple variable coverage memory for database indexing are generally described. Disclosed methods may be performed to implement high-speed database access to digital service provider customer data as the digital service provider builds an optimized index for a database. Initially, the digital service provider may maintain an appropriate level of service by keeping a relatively slow performing, basic index in a relatively high performance first memory. As the digital service provider builds the optimized index, the digital service provider may maintain the appropriate level of service by gradually shifting from use of the first memory to the use of a relatively lower performance second memory. | 1. A method comprising:
storing, in a first memory associated with a first performance level, an index configured to locate data records in a database; receiving queries comprising requests for one or more of the data records in the database; modifying the index using query data corresponding to received queries to configure the index to provide faster responses to received queries; storing one or more portions of the index in a second memory associated with a second performance level, wherein the second performance level is lower than the first performance level; increasing the portions of the index stored in the second memory as the index is modified; and retrieving requested data records in response to received queries, wherein during the modifying of the index, the retrieving is performed using portions of the index in the first and the second memories, and wherein the retrieving increasingly uses the portions of the index in the second memory as the portions of the index in the second memory are increased. 2. The method of claim 1, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records with fewer table lookups or in shorter times than portions of the index stored in the first memory. 3. The method of claim 2, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records with 5 or fewer table lookups. 4. The method of claim 2, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records in a time of 50 milliseconds or shorter. 5. The method of claim 2, wherein the portions of the index stored in the second memory comprise modified portions of the index which are configured to provide the faster responses to received queries. 6. The method of claim 1, further comprising:
measuring a time or number of table lookups involved in retrieving a requested data record using a portion of the index stored in the first memory; comparing the time or number of table lookups to a performance requirement; and moving the portion of the index associated with retrieving the requested data record to the second memory when the time or number of table lookups meets the performance requirement. 7. The method of claim 1, wherein the data records are associated with a customer of a digital service provider, and further comprising receiving, by the digital service provider, the data records from a prior digital service provider. 8. The method of claim 1, further comprising discontinuing the index in the first memory, and subsequently retrieving requested data records using the portions of the index in the second memory and not the portions of the index in the first memory. 9. The method of claim 1, wherein the first memory comprises a cache-type memory. 10. The method of claim 1, wherein the second memory comprises a disk-type memory. 11. The method of claim 1, wherein a response time for retrieving requested data records in response to received queries is maintained approximately constant. 12. The method of claim 1, wherein the modifying the index using query data corresponding to received queries to configure the index to provide faster responses to received queries is performed by a database index optimization tool. 13. The method of claim 1, further comprising maintaining a table identifying the portions of the index in the first memory and the portions of the index in the second memory and using the table to determine a memory having a portion of the index for use in retrieving a requested data record. 14. A non-transitory computer readable storage medium having computer executable instructions executable by a processor, the instructions that, when executed by the processor, cause the processor to:
store, in a first memory associated with a first performance level, an index configured to locate data records in a database; receive queries comprising requests for one or more of the data records in the database; modify the index using query data corresponding to received queries to configure the index to provide faster responses to received queries; store one or more portions of the index in a second memory associated with a second performance level, wherein the second performance level is lower than the first performance level; increase the portions of the index stored in the second memory as the index is modified; and retrieve requested data records in response to received queries, wherein during the modifying of the index, the retrieving is performed using portions of the index in the first and the second memories, and wherein the retrieving increasingly uses the portions of the index in the second memory as the portions of the index in the second memory are increased. 15-26. (canceled) 27. A server computer comprising:
a processor; a memory; and a database performance balancing tool stored in the memory and executable by the processor, wherein the database performance balancing tool is configured to:
store, in a first memory associated with a first performance level, an index configured to locate data records in a database;
receive queries comprising requests for one or more of the data records in the database;
modify the index using query data corresponding to received queries to configure the index to provide faster responses to received queries;
store one or more portions of the index in a second memory associated with a second performance level, wherein the second performance level is lower than the first performance level;
increase the portions of the index stored in the second memory as the index is modified; and
retrieve requested data records in response to received queries, wherein during the modifying of the index, the retrieving is performed using portions of the index in the first and the second memories, and wherein the retrieving increasingly uses the portions of the index in the second memory as the portions of the index in the second memory are increased. 28. The server computer of claim 27, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records with fewer table lookups or in shorter times than portions of the index stored in the first memory. 29-31. (canceled) 32. The server computer of claim 27, wherein the database performance balancing tool is configured to:
measure a time or number of table lookups involved in retrieving a requested data record using a portion of the index stored in the first memory; compare the time or number of table lookups to a performance requirement; and move the portion of the index associated with retrieving the requested data record to the second memory when the time or number of table lookups meets the performance requirement. 33. The server computer of claim 27, wherein the data records are associated with a customer of a digital service provider, and wherein the database performance balancing tool is configured to receive, by the digital service provider, the data records from a prior digital service provider. 34. The server computer of claim 27, wherein the database performance balancing tool is configured to discontinue the index in the first memory, and subsequently retrieve requested data records using the portions of the index in the second memory and not the portions of the index in the first memory. 35. The server computer of claim 27, wherein the first memory comprises a cache-type memory and wherein the second memory comprises a disk-type memory. 36-75. (canceled) | Technologies related to multiple variable coverage memory for database indexing are generally described. Disclosed methods may be performed to implement high-speed database access to digital service provider customer data as the digital service provider builds an optimized index for a database. Initially, the digital service provider may maintain an appropriate level of service by keeping a relatively slow performing, basic index in a relatively high performance first memory. As the digital service provider builds the optimized index, the digital service provider may maintain the appropriate level of service by gradually shifting from use of the first memory to the use of a relatively lower performance second memory.1. A method comprising:
storing, in a first memory associated with a first performance level, an index configured to locate data records in a database; receiving queries comprising requests for one or more of the data records in the database; modifying the index using query data corresponding to received queries to configure the index to provide faster responses to received queries; storing one or more portions of the index in a second memory associated with a second performance level, wherein the second performance level is lower than the first performance level; increasing the portions of the index stored in the second memory as the index is modified; and retrieving requested data records in response to received queries, wherein during the modifying of the index, the retrieving is performed using portions of the index in the first and the second memories, and wherein the retrieving increasingly uses the portions of the index in the second memory as the portions of the index in the second memory are increased. 2. The method of claim 1, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records with fewer table lookups or in shorter times than portions of the index stored in the first memory. 3. The method of claim 2, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records with 5 or fewer table lookups. 4. The method of claim 2, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records in a time of 50 milliseconds or shorter. 5. The method of claim 2, wherein the portions of the index stored in the second memory comprise modified portions of the index which are configured to provide the faster responses to received queries. 6. The method of claim 1, further comprising:
measuring a time or number of table lookups involved in retrieving a requested data record using a portion of the index stored in the first memory; comparing the time or number of table lookups to a performance requirement; and moving the portion of the index associated with retrieving the requested data record to the second memory when the time or number of table lookups meets the performance requirement. 7. The method of claim 1, wherein the data records are associated with a customer of a digital service provider, and further comprising receiving, by the digital service provider, the data records from a prior digital service provider. 8. The method of claim 1, further comprising discontinuing the index in the first memory, and subsequently retrieving requested data records using the portions of the index in the second memory and not the portions of the index in the first memory. 9. The method of claim 1, wherein the first memory comprises a cache-type memory. 10. The method of claim 1, wherein the second memory comprises a disk-type memory. 11. The method of claim 1, wherein a response time for retrieving requested data records in response to received queries is maintained approximately constant. 12. The method of claim 1, wherein the modifying the index using query data corresponding to received queries to configure the index to provide faster responses to received queries is performed by a database index optimization tool. 13. The method of claim 1, further comprising maintaining a table identifying the portions of the index in the first memory and the portions of the index in the second memory and using the table to determine a memory having a portion of the index for use in retrieving a requested data record. 14. A non-transitory computer readable storage medium having computer executable instructions executable by a processor, the instructions that, when executed by the processor, cause the processor to:
store, in a first memory associated with a first performance level, an index configured to locate data records in a database; receive queries comprising requests for one or more of the data records in the database; modify the index using query data corresponding to received queries to configure the index to provide faster responses to received queries; store one or more portions of the index in a second memory associated with a second performance level, wherein the second performance level is lower than the first performance level; increase the portions of the index stored in the second memory as the index is modified; and retrieve requested data records in response to received queries, wherein during the modifying of the index, the retrieving is performed using portions of the index in the first and the second memories, and wherein the retrieving increasingly uses the portions of the index in the second memory as the portions of the index in the second memory are increased. 15-26. (canceled) 27. A server computer comprising:
a processor; a memory; and a database performance balancing tool stored in the memory and executable by the processor, wherein the database performance balancing tool is configured to:
store, in a first memory associated with a first performance level, an index configured to locate data records in a database;
receive queries comprising requests for one or more of the data records in the database;
modify the index using query data corresponding to received queries to configure the index to provide faster responses to received queries;
store one or more portions of the index in a second memory associated with a second performance level, wherein the second performance level is lower than the first performance level;
increase the portions of the index stored in the second memory as the index is modified; and
retrieve requested data records in response to received queries, wherein during the modifying of the index, the retrieving is performed using portions of the index in the first and the second memories, and wherein the retrieving increasingly uses the portions of the index in the second memory as the portions of the index in the second memory are increased. 28. The server computer of claim 27, wherein the portions of the index stored in the second memory comprise portions of the index that are configured to locate data records with fewer table lookups or in shorter times than portions of the index stored in the first memory. 29-31. (canceled) 32. The server computer of claim 27, wherein the database performance balancing tool is configured to:
measure a time or number of table lookups involved in retrieving a requested data record using a portion of the index stored in the first memory; compare the time or number of table lookups to a performance requirement; and move the portion of the index associated with retrieving the requested data record to the second memory when the time or number of table lookups meets the performance requirement. 33. The server computer of claim 27, wherein the data records are associated with a customer of a digital service provider, and wherein the database performance balancing tool is configured to receive, by the digital service provider, the data records from a prior digital service provider. 34. The server computer of claim 27, wherein the database performance balancing tool is configured to discontinue the index in the first memory, and subsequently retrieve requested data records using the portions of the index in the second memory and not the portions of the index in the first memory. 35. The server computer of claim 27, wherein the first memory comprises a cache-type memory and wherein the second memory comprises a disk-type memory. 36-75. (canceled) | 2,100 |
4,439 | 14,508,579 | 2,163 | Provided are techniques that ensure efficient database accesses by partitioning. The techniques includes a partition generating unit which generates a value partition in which a unit subtree including target data to be partitioned is separated and registered according to the target data, and a base partition which includes an index for uniquely identifying the unit subtree, an XML parser which identifies positions of a start to and an end tag defining an attribute value of the structured document and generates a cutting position list Corresponding to the hierarchical structure of the attribute value for registration in a storage area, an XML cutting unit which identifies the start tag position and the end tag position of the unit subtree to be cut, and separates the unit subtree and its index from the structured document, and a cut-XML registration unit which registers the unit subtree and the index in the separate partitions. | 1. An information processing apparatus, comprising:
a processor; a non-transitive storage area; a database, stored in the non-transitive storage area, storing a plurality of stored values having a hierarchical structure., wherein the plurality of stored values represent data stored in a particular field of the database and wherein the stored, values do not represent addresses to data stored in the database; a partition generating unit, executed on the processor, which generates a value partition, the value partition having a unit subtree, the unit subtree having target data of the plurality of stored values to be partitioned in the structured document separated and registered according to a stored value of the plurality of stored values of the target data, and generates a base partition which includes a second subtree distinct from the unit subtree and an index for uniquely identifying the unit subtree; a parser unit, executed on the processor, which identifies positions of a start tag and an end tag, the start tag and the end tag defining a start value and an end value, the start, value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document, to generate a cutting position list corresponding to the hierarchical structure and register the cutting position list in a storage area; a cutting unit, executed on the processor, which separates the unit subtree and the index for referring to the unit subtree from the structured document by referring to the cutting position list to identify the start tag position and the end tag position of the unit subtree to be cut, the unit subtree including the target data; and a registration unit, executed on the processor, which registers the unit subtree and the index for identifying the unit subtree, separated by the cutting unit, in the value and base partitions. 2. The information processing apparatus according to claim 1, wherein the unit subtree includes a plurality of the start tags, and the index is generated from a first one of the start tags in the unit subtree. 3. The information processing apparatus according to claim 2, wherein the registration unit adds pointers to the unit subtree and the index for uniquely identifying the unit subtree to allow cross-reference between the unit subtree and the index, before registering the unit subtree and the index in the value and base partitions. 4. The information processing apparatus according to claim 3, wherein in order to separate the unit subtree for registration in the value and base partitions by referring to the cutting position list, the cutting unit generates a subtree data list and registers the generated list in the storage area, the subtree data list including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. 5. The information processing apparatus according to claim 4, further comprising:
an SQL processing unit which uses the target data to search for the unit subtree registered in the value partition; and a search result generating unit which generates a result of the search performed by the SQL processing unit. 6. The information processing apparatus according to claim 4, wherein the structured document is described in XML, and the database is an XMLDB which enables storage and search of XML documents. 7. A database system, comprising;
a database, stored in a non-transitory storage area, storing a plurality of stored values having a hierarchical structure, wherein the plurality of stored values represent data stored, in a particular field of the database and wherein the stored values do not represent addresses to data stored in the database; a data management unit, executed on a processor, which generates and manages a value partition in which a unit subtree including target data of the plurality of stored values to be partitioned in the structured document is separated and registered according to a stored value of the plurality of stored values of the target data, and a base partition which includes a subtree other than the unit subtree and an index for uniquely identifying the unit subtree; an SQL processing unit, executed on the processor, which processes a search request for searching the structured document registered in the database, the search request designating the hierarchical structure of the structured document; and a search result generating unit, executed on the processor, which generates a search result with respect to the search request by using a result of individual search performed on the value partition by the SQL processing unit; the data management unit including:
a partition generating unit which generates the partitions;
a parser unit which identifies positions of a start tag and an end tag defining a start value and an end value, the start value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document, to generate a cutting position list corresponding to the hierarchical structure and register the cutting position list in a storage area;
a cutting unit which separates the unit subtree and the index for referring to the unit subtree from the structured document by referring to the cutting position list to identity the start tag position and the end tag position of the unit subtree to be cut the unit subtree including the target data; and
a registration unit which registers the unit subtree and the index for Identifying the unit subtree, separated by the cutting unit, in the separate partitions. 8. The database system according to claim 7, wherein the unit subtree includes a plurality of start tags, and the index is generated from a first one of the start, tags in the unit subtree. 9. The database system according to claim 8, wherein the registration unit adds pointers to the unit subtree and the index for uniquely identifying the unit, subtree to allow cross-reference between the unit subtree and the index, before registering the unit subtree and the index in the separate partitions. 10. The database system according to claim 9, wherein in. order to separate the unit subtree for registration in the separate partition by referring to the cutting position list, the cutting unit generates a subtree data list and registers the generated list in the storage area, the subtree data list including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. 11. The database system according to claim 10, further comprising:
an SQL processing unit which rises the target data to search for the unit subtree registered in the value partition; and a search result generating unit which generates a result of the search performed by the SQL processing unit. 12. The database system according to claim 11, wherein the structured document is described in XML, and the database is an XMLDB which enables storage and search of XML documents. 13. A method having a database, the database including a structured document, the method comprising:
separating target data into partitioned data based on a plurality of values associated with the target data, wherein the plurality of values represent data stored in a particular field of the database and wherein the stored values do not represent addresses to data stored in the database; generating a value partition having a unit subtree, the unit subtree having the partitioned data therein; generating a base partition, the base partition having a first subtree distinct from the unit subtree and an index associated with the unit subtree; identifying positions of a start tag and an end tag associated with a start value and an end value, the start value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document; generating a cutting position list corresponding to the hierarchical structure based on the start tag and the end tag; storing the cutting position list in a storage area; separating the unit subtree and. the index from the structured document based on the cutting position list to identify the start tag position and the end tag position of the unit subtree to be cut; and registering the unit subtree and the index to identify the unit subtree, separated in the separating step, in the base and value partitions; searching the database based on at least one of the value partition and the base partition; and displaying the results of the search. 14. The information processing method according to claim 13, wherein the Index uniquely identifies the unit subtree and wherein the unit subtree includes a plurality of start tags, and generating the base and value partitions further includes the step of generating the index by identifying a first, one of the start tags in the unit subtree. 15. The information processing method according to claim 14, wherein in order to separate the unit subtree for registration in the base and value partitions by referring to the cutting position list, separating the unit subtree and the index further includes generating a subtree data list and registering the generated subtree data list In the storage area, the subtree data list, including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. 16. The information processing method according to claim 15, wherein storing the cutting position list includes adding pointers to the unit subtree and the index for uniquely identifying the unit subtree to allow cross-reference between the unit subtree and the index, before registering the unit subtree and the index in the separate partitions. 17. The information processing method, according to claim 16 and further comprising:
searching for the unit subtree registered in the value partition by using the target data; and
generating a search result by merging a result of individual search performed on the value partition in the searching step. 18. A computer program product, 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 execute on a processor to:
generate a value partition in which a unit subtree including target data stored in a database, to be partitioned in a structured document is separated and registered according to a plurality of values of the target data, wherein the plurality of values represent data stored in a particular filed of the database and wherein the stored values do not represent addresses to data stored in the database, and a base partition which includes a subtree other than the unit subtree and an index for uniquely identifying the unit subtree;
identify positions of a start tag and an end tag defining a start value and an end value, the start value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document to generate a cutting position list corresponding to a hierarchical structure of the plurality of values and register the cutting position list in a storage area;
separate the unit subtree and the index for referring to the unit subtree from the structured document by referring to the cutting position list to identify the start, tag position and the end tag position of the unit subtree to be cut, the unit subtree including the target data; and
register the unit subtree and the index for identifying the unit subtree, separated in the separating step, in the separate partitions. 19. The computer program product according to claim 18, wherein the unit subtree includes a plurality of start tags, and generating the value and base partitions includes generating the index by identifying a first one of the start tags in the unit subtree. 20. The computer program product according to claim 19, wherein in order to separate the unit subtree for registration in the separate partition by referring to the cutting position list, separating the unit subtree and index includes generating a subtree data list and registering the generated list in the storage area, the subtree data list including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. | Provided are techniques that ensure efficient database accesses by partitioning. The techniques includes a partition generating unit which generates a value partition in which a unit subtree including target data to be partitioned is separated and registered according to the target data, and a base partition which includes an index for uniquely identifying the unit subtree, an XML parser which identifies positions of a start to and an end tag defining an attribute value of the structured document and generates a cutting position list Corresponding to the hierarchical structure of the attribute value for registration in a storage area, an XML cutting unit which identifies the start tag position and the end tag position of the unit subtree to be cut, and separates the unit subtree and its index from the structured document, and a cut-XML registration unit which registers the unit subtree and the index in the separate partitions.1. An information processing apparatus, comprising:
a processor; a non-transitive storage area; a database, stored in the non-transitive storage area, storing a plurality of stored values having a hierarchical structure., wherein the plurality of stored values represent data stored in a particular field of the database and wherein the stored, values do not represent addresses to data stored in the database; a partition generating unit, executed on the processor, which generates a value partition, the value partition having a unit subtree, the unit subtree having target data of the plurality of stored values to be partitioned in the structured document separated and registered according to a stored value of the plurality of stored values of the target data, and generates a base partition which includes a second subtree distinct from the unit subtree and an index for uniquely identifying the unit subtree; a parser unit, executed on the processor, which identifies positions of a start tag and an end tag, the start tag and the end tag defining a start value and an end value, the start, value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document, to generate a cutting position list corresponding to the hierarchical structure and register the cutting position list in a storage area; a cutting unit, executed on the processor, which separates the unit subtree and the index for referring to the unit subtree from the structured document by referring to the cutting position list to identify the start tag position and the end tag position of the unit subtree to be cut, the unit subtree including the target data; and a registration unit, executed on the processor, which registers the unit subtree and the index for identifying the unit subtree, separated by the cutting unit, in the value and base partitions. 2. The information processing apparatus according to claim 1, wherein the unit subtree includes a plurality of the start tags, and the index is generated from a first one of the start tags in the unit subtree. 3. The information processing apparatus according to claim 2, wherein the registration unit adds pointers to the unit subtree and the index for uniquely identifying the unit subtree to allow cross-reference between the unit subtree and the index, before registering the unit subtree and the index in the value and base partitions. 4. The information processing apparatus according to claim 3, wherein in order to separate the unit subtree for registration in the value and base partitions by referring to the cutting position list, the cutting unit generates a subtree data list and registers the generated list in the storage area, the subtree data list including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. 5. The information processing apparatus according to claim 4, further comprising:
an SQL processing unit which uses the target data to search for the unit subtree registered in the value partition; and a search result generating unit which generates a result of the search performed by the SQL processing unit. 6. The information processing apparatus according to claim 4, wherein the structured document is described in XML, and the database is an XMLDB which enables storage and search of XML documents. 7. A database system, comprising;
a database, stored in a non-transitory storage area, storing a plurality of stored values having a hierarchical structure, wherein the plurality of stored values represent data stored, in a particular field of the database and wherein the stored values do not represent addresses to data stored in the database; a data management unit, executed on a processor, which generates and manages a value partition in which a unit subtree including target data of the plurality of stored values to be partitioned in the structured document is separated and registered according to a stored value of the plurality of stored values of the target data, and a base partition which includes a subtree other than the unit subtree and an index for uniquely identifying the unit subtree; an SQL processing unit, executed on the processor, which processes a search request for searching the structured document registered in the database, the search request designating the hierarchical structure of the structured document; and a search result generating unit, executed on the processor, which generates a search result with respect to the search request by using a result of individual search performed on the value partition by the SQL processing unit; the data management unit including:
a partition generating unit which generates the partitions;
a parser unit which identifies positions of a start tag and an end tag defining a start value and an end value, the start value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document, to generate a cutting position list corresponding to the hierarchical structure and register the cutting position list in a storage area;
a cutting unit which separates the unit subtree and the index for referring to the unit subtree from the structured document by referring to the cutting position list to identity the start tag position and the end tag position of the unit subtree to be cut the unit subtree including the target data; and
a registration unit which registers the unit subtree and the index for Identifying the unit subtree, separated by the cutting unit, in the separate partitions. 8. The database system according to claim 7, wherein the unit subtree includes a plurality of start tags, and the index is generated from a first one of the start, tags in the unit subtree. 9. The database system according to claim 8, wherein the registration unit adds pointers to the unit subtree and the index for uniquely identifying the unit, subtree to allow cross-reference between the unit subtree and the index, before registering the unit subtree and the index in the separate partitions. 10. The database system according to claim 9, wherein in. order to separate the unit subtree for registration in the separate partition by referring to the cutting position list, the cutting unit generates a subtree data list and registers the generated list in the storage area, the subtree data list including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. 11. The database system according to claim 10, further comprising:
an SQL processing unit which rises the target data to search for the unit subtree registered in the value partition; and a search result generating unit which generates a result of the search performed by the SQL processing unit. 12. The database system according to claim 11, wherein the structured document is described in XML, and the database is an XMLDB which enables storage and search of XML documents. 13. A method having a database, the database including a structured document, the method comprising:
separating target data into partitioned data based on a plurality of values associated with the target data, wherein the plurality of values represent data stored in a particular field of the database and wherein the stored values do not represent addresses to data stored in the database; generating a value partition having a unit subtree, the unit subtree having the partitioned data therein; generating a base partition, the base partition having a first subtree distinct from the unit subtree and an index associated with the unit subtree; identifying positions of a start tag and an end tag associated with a start value and an end value, the start value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document; generating a cutting position list corresponding to the hierarchical structure based on the start tag and the end tag; storing the cutting position list in a storage area; separating the unit subtree and. the index from the structured document based on the cutting position list to identify the start tag position and the end tag position of the unit subtree to be cut; and registering the unit subtree and the index to identify the unit subtree, separated in the separating step, in the base and value partitions; searching the database based on at least one of the value partition and the base partition; and displaying the results of the search. 14. The information processing method according to claim 13, wherein the Index uniquely identifies the unit subtree and wherein the unit subtree includes a plurality of start tags, and generating the base and value partitions further includes the step of generating the index by identifying a first, one of the start tags in the unit subtree. 15. The information processing method according to claim 14, wherein in order to separate the unit subtree for registration in the base and value partitions by referring to the cutting position list, separating the unit subtree and the index further includes generating a subtree data list and registering the generated subtree data list In the storage area, the subtree data list, including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. 16. The information processing method according to claim 15, wherein storing the cutting position list includes adding pointers to the unit subtree and the index for uniquely identifying the unit subtree to allow cross-reference between the unit subtree and the index, before registering the unit subtree and the index in the separate partitions. 17. The information processing method, according to claim 16 and further comprising:
searching for the unit subtree registered in the value partition by using the target data; and
generating a search result by merging a result of individual search performed on the value partition in the searching step. 18. A computer program product, 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 execute on a processor to:
generate a value partition in which a unit subtree including target data stored in a database, to be partitioned in a structured document is separated and registered according to a plurality of values of the target data, wherein the plurality of values represent data stored in a particular filed of the database and wherein the stored values do not represent addresses to data stored in the database, and a base partition which includes a subtree other than the unit subtree and an index for uniquely identifying the unit subtree;
identify positions of a start tag and an end tag defining a start value and an end value, the start value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document to generate a cutting position list corresponding to a hierarchical structure of the plurality of values and register the cutting position list in a storage area;
separate the unit subtree and the index for referring to the unit subtree from the structured document by referring to the cutting position list to identify the start, tag position and the end tag position of the unit subtree to be cut, the unit subtree including the target data; and
register the unit subtree and the index for identifying the unit subtree, separated in the separating step, in the separate partitions. 19. The computer program product according to claim 18, wherein the unit subtree includes a plurality of start tags, and generating the value and base partitions includes generating the index by identifying a first one of the start tags in the unit subtree. 20. The computer program product according to claim 19, wherein in order to separate the unit subtree for registration in the separate partition by referring to the cutting position list, separating the unit subtree and index includes generating a subtree data list and registering the generated list in the storage area, the subtree data list including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered. | 2,100 |
4,440 | 13,947,818 | 2,129 | A method for creating and using a fault model comprising one or more fault model components is provided. The method comprises creating a reusable fault model component and incorporating the reusable fault model component into the fault model. | 1. A method for creating and using a fault model comprising one or more fault model components, the method comprising:
creating a reusable fault model component; and incorporating the reusable fault model component into the fault model. 2. The method of claim 1, further comprising:
maintaining a database comprising a plurality of reusable fault model components; and performing a lookup to determine whether the reusable fault model component exists in the database, wherein the creating is performed when the reusable fault model component does not exist in the database. 3. The method of claim 2, wherein the step of performing a lookup further comprises:
determining a designation associated with the reusable fault model component; comparing the designation with a plurality of designations associated with the database to locate a match; and when there is not a match, determining that the reusable fault model component does not exist. 4. The method of claim 1, further comprising:
analyzing a fault model assembly using predefined component failure criteria; and identifying the reusable fault model component based on the predefined component failure criteria. 5. The method of claim 1, wherein the step of creating the reusable fault model component further comprises:
creating a reusable fault model component shell; and incorporating one or more additional features to the reusable fault model component shell to create the reusable fault model component. 6. The method of claim 5, further comprising retrieving the one or more additional features from a memory storage location. 7. The method of claim 5, further comprising receiving the one or more additional features from user input. 8. The method of claim 1, wherein:
the reusable fault model component comprises a plurality of subcomponents; and at least one of the plurality of subcomponents comprises a second reusable fault model component. 9. A method for creating reusable sub-assemblies for use in a fault model, the method comprising:
importing design data for an assembly of the fault model, the assembly comprising a plurality of sub-assemblies, wherein each of the plurality of sub-assemblies is associated with a sub-assembly type; analyzing the design data to identify one of the plurality of sub-assemblies based on pre-determined criteria; identifying a sub-assembly type associated with the one of the plurality of sub-assemblies; comparing the identified sub-assembly type to a plurality of types, wherein the plurality of types is associated with a plurality of complete reusable sub-assemblies; and when the identified sub-assembly type does not match one of the plurality of types,
creating a complete reusable sub-assembly; and
incorporating the complete reusable sub-assembly into the assembly of the fault model. 10. The method of claim 9, further comprising storing the complete reusable assembly for use in one or more additional fault models. 11. The method of claim 9, wherein creating a complete reusable sub-assembly further comprises:
creating an incomplete reusable sub-assembly; receiving completion information from a user; and completing the incomplete reusable sub-assembly to create a complete reusable sub assembly, based on the completion information. 12. The method of claim 9, wherein creating a complete reusable sub-assembly further comprises:
creating an incomplete reusable sub-assembly; retrieving stored completion information from memory; and completing the incomplete reusable sub-assembly to create a complete reusable sub assembly, based on the completion information. 13. The method of claim 9, further comprising:
when a match has been located,
retrieving a complete reusable sub-assembly associated with the match; and
incorporating the complete reusable sub-assembly into the assembly of the fault model. 14. The method of claim 9, further comprising:
identifying a part classification associated with the one of the plurality of sub-assemblies; and comparing the identified part classification to a plurality of part classifications associated with complete reusable sub-assemblies to locate a match. 15. The method of claim 9, further comprising:
identifying a specific product structure associated with the one of the plurality of sub-assemblies; and comparing the identified specific product structure to a plurality of specific product structures associated with complete reusable sub-assemblies to locate a match. 16. A non-transitory computer-readable storage medium having one or more instructions thereon for creating and using a fault model, the instructions, when executed by a processor, causing the processor to:
import design data for an assembly, the assembly comprising a plurality of sub-assemblies, wherein each of the plurality of sub-assemblies is associated with a sub-assembly type; analyze the design data to identify one of the plurality of sub-assemblies based on pre-determined criteria; identify a sub-assembly type associated with the one of the plurality of sub-assemblies; compare the identified sub-assembly type to a plurality of types associated with complete reusable sub-assemblies; and when the identified sub-assembly type does not match one of the plurality of types,
create a complete reusable sub-assembly; and
place the complete reusable sub-assembly into an appropriate slot in the fault model. 17. The non-transitory computer-readable storage medium of claim 16, the one or more instructions further causing the processor to:
analyze the design data to identify one of the plurality of sub-assemblies having one or more parts associated with a pre-defined rate of failure. 18. The non-transitory computer-readable storage medium of claim 16, wherein the pre-determined criteria comprises one or more electrical connections. 19. The non-transitory computer-readable storage medium of claim 16, wherein the pre-determined criteria comprises one or more hydraulic connections. 20. The non-transitory computer-readable storage medium of claim 16, wherein each of the plurality of sub-assemblies further comprise one or more sub-sub-assemblies. | A method for creating and using a fault model comprising one or more fault model components is provided. The method comprises creating a reusable fault model component and incorporating the reusable fault model component into the fault model.1. A method for creating and using a fault model comprising one or more fault model components, the method comprising:
creating a reusable fault model component; and incorporating the reusable fault model component into the fault model. 2. The method of claim 1, further comprising:
maintaining a database comprising a plurality of reusable fault model components; and performing a lookup to determine whether the reusable fault model component exists in the database, wherein the creating is performed when the reusable fault model component does not exist in the database. 3. The method of claim 2, wherein the step of performing a lookup further comprises:
determining a designation associated with the reusable fault model component; comparing the designation with a plurality of designations associated with the database to locate a match; and when there is not a match, determining that the reusable fault model component does not exist. 4. The method of claim 1, further comprising:
analyzing a fault model assembly using predefined component failure criteria; and identifying the reusable fault model component based on the predefined component failure criteria. 5. The method of claim 1, wherein the step of creating the reusable fault model component further comprises:
creating a reusable fault model component shell; and incorporating one or more additional features to the reusable fault model component shell to create the reusable fault model component. 6. The method of claim 5, further comprising retrieving the one or more additional features from a memory storage location. 7. The method of claim 5, further comprising receiving the one or more additional features from user input. 8. The method of claim 1, wherein:
the reusable fault model component comprises a plurality of subcomponents; and at least one of the plurality of subcomponents comprises a second reusable fault model component. 9. A method for creating reusable sub-assemblies for use in a fault model, the method comprising:
importing design data for an assembly of the fault model, the assembly comprising a plurality of sub-assemblies, wherein each of the plurality of sub-assemblies is associated with a sub-assembly type; analyzing the design data to identify one of the plurality of sub-assemblies based on pre-determined criteria; identifying a sub-assembly type associated with the one of the plurality of sub-assemblies; comparing the identified sub-assembly type to a plurality of types, wherein the plurality of types is associated with a plurality of complete reusable sub-assemblies; and when the identified sub-assembly type does not match one of the plurality of types,
creating a complete reusable sub-assembly; and
incorporating the complete reusable sub-assembly into the assembly of the fault model. 10. The method of claim 9, further comprising storing the complete reusable assembly for use in one or more additional fault models. 11. The method of claim 9, wherein creating a complete reusable sub-assembly further comprises:
creating an incomplete reusable sub-assembly; receiving completion information from a user; and completing the incomplete reusable sub-assembly to create a complete reusable sub assembly, based on the completion information. 12. The method of claim 9, wherein creating a complete reusable sub-assembly further comprises:
creating an incomplete reusable sub-assembly; retrieving stored completion information from memory; and completing the incomplete reusable sub-assembly to create a complete reusable sub assembly, based on the completion information. 13. The method of claim 9, further comprising:
when a match has been located,
retrieving a complete reusable sub-assembly associated with the match; and
incorporating the complete reusable sub-assembly into the assembly of the fault model. 14. The method of claim 9, further comprising:
identifying a part classification associated with the one of the plurality of sub-assemblies; and comparing the identified part classification to a plurality of part classifications associated with complete reusable sub-assemblies to locate a match. 15. The method of claim 9, further comprising:
identifying a specific product structure associated with the one of the plurality of sub-assemblies; and comparing the identified specific product structure to a plurality of specific product structures associated with complete reusable sub-assemblies to locate a match. 16. A non-transitory computer-readable storage medium having one or more instructions thereon for creating and using a fault model, the instructions, when executed by a processor, causing the processor to:
import design data for an assembly, the assembly comprising a plurality of sub-assemblies, wherein each of the plurality of sub-assemblies is associated with a sub-assembly type; analyze the design data to identify one of the plurality of sub-assemblies based on pre-determined criteria; identify a sub-assembly type associated with the one of the plurality of sub-assemblies; compare the identified sub-assembly type to a plurality of types associated with complete reusable sub-assemblies; and when the identified sub-assembly type does not match one of the plurality of types,
create a complete reusable sub-assembly; and
place the complete reusable sub-assembly into an appropriate slot in the fault model. 17. The non-transitory computer-readable storage medium of claim 16, the one or more instructions further causing the processor to:
analyze the design data to identify one of the plurality of sub-assemblies having one or more parts associated with a pre-defined rate of failure. 18. The non-transitory computer-readable storage medium of claim 16, wherein the pre-determined criteria comprises one or more electrical connections. 19. The non-transitory computer-readable storage medium of claim 16, wherein the pre-determined criteria comprises one or more hydraulic connections. 20. The non-transitory computer-readable storage medium of claim 16, wherein each of the plurality of sub-assemblies further comprise one or more sub-sub-assemblies. | 2,100 |
4,441 | 13,491,781 | 2,183 | A method of sharing a plurality of registers in a shared register pool among a plurality of microprocessor threads begins with a determination that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register. Next a determination is made that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register. A first physical register in the shared register pool is allocated to the first microprocessor thread for execution of the first instruction and the first logical register is mapped to the first physical register. A second physical register in the shared register pool is allocated to the second microprocessor thread for execution of the second instruction. Finally, the second logical register is mapped to the second physical register. | 1. A method of sharing a plurality of registers in a shared register pool among a plurality of microprocessor threads, comprising:
determining that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register; determining that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register; allocating a first physical register in the shared register pool to the first microprocessor thread for execution of the first instruction; mapping the first logical register to the first physical register; allocating a second physical register in the shared register pool to the second microprocessor thread for execution of the second instruction; and mapping the second logical register to the second physical register. 2. The method of claim 1, wherein:
determining that the first instruction requires a first logical register comprises determining that a first single instruction multiple data (SIMD) instruction requires a first logical SIMD register, and determining that the second instruction requires a second logical register comprises determining that a second SIMD instruction requires a second logical SIMD register. 3. The method of claim 1, further comprising:
determining that a third instruction to be executed by the microprocessor in a third microprocessor thread requires a third logical register; storing a value of the first physical register; pausing execution of the first instruction by the first microprocessor thread; deallocating the first physical register in the shared register pool; allocating the first physical register in the shared register pool to the third microprocessor thread for execution of the third instruction; and mapping the third logical register to the first physical register. 4. The method of claim 3, further comprising:
determining whether to resume execution of the first instruction based on physical registers available in the shared register pool, wherein execution of the first instruction is resumed by the microprocessor only when a physical register is available for allocation from the shared register pool. 5. The method of claim 1, further comprising before the second physical register is allocated for execution of the second instruction:
determining whether a physical register is available for allocation in the shared register pool, wherein the second physical register is only allocated when it is available and the second instruction is only executed when the first or second physical register is allocated to the second instruction. 6. The method of claim 1, wherein:
the first thread requires a maximum first number of logical registers, the second thread requires a maximum second number of logical registers, and the shared register pool has a number of registers fewer than the total of the first number and the second number. 7. The method of claim 1, wherein allocating a first physical register in the shared register pool comprises allocating a first physical register in a shared register pool comprising a plurality of register files. 8. The method of claim 1 wherein determining that the first instruction requires a first logical register comprises determining that the first instruction requires a first logical register having a bit-width greater than 256-bits, and determining that the second instruction requires a second logical register comprises determining that the second instruction requires a first logical register having a bit-width greater than 256-bits. 9. The method of claim 1, wherein:
determining that the first instruction requires a first logical register comprises determining that the first instruction requires a first logical vector register, and determining that the second instruction requires a second logical register comprises determining that the second instruction requires a second logical vector register. 10. The method of claim 1, wherein physical registers are allocated in the shared register pool in groups of two or more physical registers. 11. A system of sharing a plurality of registers in a shared register pool among a plurality of microprocessor threads, comprising:
a thread processing resource configured to execute a first and second microprocessor thread; a register determiner configured to determine that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register, and that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register; a register allocator configured to allocate a first physical register in the shared register pool to the first microprocessor thread for execution of the first instruction, and allocate a second physical register in the shared register pool to the second microprocessor thread for execution of the second instruction; and a register mapper configured to map the first logical register to the first physical register, and map the second logical register to the second physical register. 12. The system of claim 11, wherein the first and second instructions are SIMD instructions and the first and second logical registers are logical SIMD registers. 13. The system of claim 11, wherein:
the register determiner is further configured to determine that a third instruction to be executed by the microprocessor in a third microprocessor thread requires a third logical register; the thread processing resource is further configured to execute the third microprocessor thread, store a value of the first physical register in a storage location, and pause execution of the first instruction by the first microprocessor thread, and the register allocator is further configured to:
deallocate the first physical register in the shared register pool and allocate the first physical register in the shared register pool to the third microprocessor thread for execution of the third instruction; and
map the third logical register to the first physical register. 14. The system of claim 13, further comprising:
a thread scheduler configured to determine whether to resume execution of the first instruction by the first microprocessor thread based on a signal from the register allocator that a physical register is available in the shared register pool for the first instruction, wherein the thread scheduler is configured to determine that execution of the first instruction be resumed only when a physical register is available for allocation to the first thread from the shared register pool. 15. The system of claim 11, further comprising:
a thread scheduler configured to determine whether to execute the second instruction by the second microprocessor thread based on a signal from the register allocator that a physical register is available for allocation in the shared register pool, wherein the thread scheduler is configured to determine that execution of the second instruction occur only when the first or second physical register is available for allocation to the second thread from the shared register pool. 16. The system of claim 11, wherein:
the first thread requires a maximum first number of logical registers, the second thread requires a maximum second number of logical registers, and the shared register pool has a number of registers fewer than the total of the first number and the second number. 17. The system of claim 11, wherein the register allocator is configured to allocate registers from a shared register pool comprising a plurality of register files. 18. The system of claim 11, wherein the first instruction requires a first logical register having a bit-width greater than 256-bits, and the second instruction requires a second logical register having a bit-width greater than 256-bits. 19. The system of claim 11, wherein the logical registers are logical vector registers and the physical registers are physical vector registers. 20. The system of claim 11, wherein the register allocator is configured to allocate physical registers in the shared register pool in groups of two or more physical registers. 21. A non-transitory computer readable storage medium having encoded thereon computer readable program code for generating a computer processor comprising:
a thread processing resource configured to execute a first and second microprocessor thread; a register determiner configured to determine that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register, and that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register; a register allocator configured to allocate a first physical register in the shared register pool to the first microprocessor thread for execution of the first instruction, and allocate a second physical register in the shared register pool to the second microprocessor thread for execution of the second instruction; and a register mapper configured to map the first logical register to the first physical register, and map the second logical register to the second physical register. | A method of sharing a plurality of registers in a shared register pool among a plurality of microprocessor threads begins with a determination that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register. Next a determination is made that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register. A first physical register in the shared register pool is allocated to the first microprocessor thread for execution of the first instruction and the first logical register is mapped to the first physical register. A second physical register in the shared register pool is allocated to the second microprocessor thread for execution of the second instruction. Finally, the second logical register is mapped to the second physical register.1. A method of sharing a plurality of registers in a shared register pool among a plurality of microprocessor threads, comprising:
determining that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register; determining that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register; allocating a first physical register in the shared register pool to the first microprocessor thread for execution of the first instruction; mapping the first logical register to the first physical register; allocating a second physical register in the shared register pool to the second microprocessor thread for execution of the second instruction; and mapping the second logical register to the second physical register. 2. The method of claim 1, wherein:
determining that the first instruction requires a first logical register comprises determining that a first single instruction multiple data (SIMD) instruction requires a first logical SIMD register, and determining that the second instruction requires a second logical register comprises determining that a second SIMD instruction requires a second logical SIMD register. 3. The method of claim 1, further comprising:
determining that a third instruction to be executed by the microprocessor in a third microprocessor thread requires a third logical register; storing a value of the first physical register; pausing execution of the first instruction by the first microprocessor thread; deallocating the first physical register in the shared register pool; allocating the first physical register in the shared register pool to the third microprocessor thread for execution of the third instruction; and mapping the third logical register to the first physical register. 4. The method of claim 3, further comprising:
determining whether to resume execution of the first instruction based on physical registers available in the shared register pool, wherein execution of the first instruction is resumed by the microprocessor only when a physical register is available for allocation from the shared register pool. 5. The method of claim 1, further comprising before the second physical register is allocated for execution of the second instruction:
determining whether a physical register is available for allocation in the shared register pool, wherein the second physical register is only allocated when it is available and the second instruction is only executed when the first or second physical register is allocated to the second instruction. 6. The method of claim 1, wherein:
the first thread requires a maximum first number of logical registers, the second thread requires a maximum second number of logical registers, and the shared register pool has a number of registers fewer than the total of the first number and the second number. 7. The method of claim 1, wherein allocating a first physical register in the shared register pool comprises allocating a first physical register in a shared register pool comprising a plurality of register files. 8. The method of claim 1 wherein determining that the first instruction requires a first logical register comprises determining that the first instruction requires a first logical register having a bit-width greater than 256-bits, and determining that the second instruction requires a second logical register comprises determining that the second instruction requires a first logical register having a bit-width greater than 256-bits. 9. The method of claim 1, wherein:
determining that the first instruction requires a first logical register comprises determining that the first instruction requires a first logical vector register, and determining that the second instruction requires a second logical register comprises determining that the second instruction requires a second logical vector register. 10. The method of claim 1, wherein physical registers are allocated in the shared register pool in groups of two or more physical registers. 11. A system of sharing a plurality of registers in a shared register pool among a plurality of microprocessor threads, comprising:
a thread processing resource configured to execute a first and second microprocessor thread; a register determiner configured to determine that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register, and that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register; a register allocator configured to allocate a first physical register in the shared register pool to the first microprocessor thread for execution of the first instruction, and allocate a second physical register in the shared register pool to the second microprocessor thread for execution of the second instruction; and a register mapper configured to map the first logical register to the first physical register, and map the second logical register to the second physical register. 12. The system of claim 11, wherein the first and second instructions are SIMD instructions and the first and second logical registers are logical SIMD registers. 13. The system of claim 11, wherein:
the register determiner is further configured to determine that a third instruction to be executed by the microprocessor in a third microprocessor thread requires a third logical register; the thread processing resource is further configured to execute the third microprocessor thread, store a value of the first physical register in a storage location, and pause execution of the first instruction by the first microprocessor thread, and the register allocator is further configured to:
deallocate the first physical register in the shared register pool and allocate the first physical register in the shared register pool to the third microprocessor thread for execution of the third instruction; and
map the third logical register to the first physical register. 14. The system of claim 13, further comprising:
a thread scheduler configured to determine whether to resume execution of the first instruction by the first microprocessor thread based on a signal from the register allocator that a physical register is available in the shared register pool for the first instruction, wherein the thread scheduler is configured to determine that execution of the first instruction be resumed only when a physical register is available for allocation to the first thread from the shared register pool. 15. The system of claim 11, further comprising:
a thread scheduler configured to determine whether to execute the second instruction by the second microprocessor thread based on a signal from the register allocator that a physical register is available for allocation in the shared register pool, wherein the thread scheduler is configured to determine that execution of the second instruction occur only when the first or second physical register is available for allocation to the second thread from the shared register pool. 16. The system of claim 11, wherein:
the first thread requires a maximum first number of logical registers, the second thread requires a maximum second number of logical registers, and the shared register pool has a number of registers fewer than the total of the first number and the second number. 17. The system of claim 11, wherein the register allocator is configured to allocate registers from a shared register pool comprising a plurality of register files. 18. The system of claim 11, wherein the first instruction requires a first logical register having a bit-width greater than 256-bits, and the second instruction requires a second logical register having a bit-width greater than 256-bits. 19. The system of claim 11, wherein the logical registers are logical vector registers and the physical registers are physical vector registers. 20. The system of claim 11, wherein the register allocator is configured to allocate physical registers in the shared register pool in groups of two or more physical registers. 21. A non-transitory computer readable storage medium having encoded thereon computer readable program code for generating a computer processor comprising:
a thread processing resource configured to execute a first and second microprocessor thread; a register determiner configured to determine that a first instruction to be executed by a microprocessor in a first microprocessor thread requires a first logical register, and that a second instruction to be executed by the microprocessor in a second microprocessor thread requires a second logical register; a register allocator configured to allocate a first physical register in the shared register pool to the first microprocessor thread for execution of the first instruction, and allocate a second physical register in the shared register pool to the second microprocessor thread for execution of the second instruction; and a register mapper configured to map the first logical register to the first physical register, and map the second logical register to the second physical register. | 2,100 |
4,442 | 14,164,033 | 2,165 | A system for identifying an electronic counterpart for a rendered document is described. The system receives an indication of a text capture operation performed from a rendered document. The indication identifies a text sequence captured as part of the text capture operation, the identified text sequence comprising fewer than nine words. In response to receiving the indication, the system uniquely identifies an electronic document from which the rendered document was rendered. | 1-16. (canceled) 17. A method performed by data processing apparatus, the method comprising:
receiving a text sequence captured from a print version of a document, the text sequence including an indication that the text sequence was captured from the print version of the document; identifying the document using the text sequence; identifying supplemental electronic materials associated with the document, the supplemental electronic materials being materials presentable using an audio or visual medium; determining that a request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence; determining that the text sequence includes the indication that the text sequence was captured from the print version of the document; determining that the request satisfies a set of access rules for the identified supplemental electronic materials in response to determining that the text sequence includes the indication; and enabling access to the identified supplemental electronic materials in response to determining that the request satisfies the set of access rules. 18. The method of claim 17, further comprising:
requesting a scan of a particular location of the print version of the document to receive access to the identified supplemental electronic materials; and receiving data specifying scanned content; wherein determining that the request satisfies the set of access rules further comprises determining that the scanned content matches content located at the particular location. 19. The method of claim 17, wherein:
the set of access rules specifies one or more geographic locations in which the identified supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a geographic location at which the text sequence was captured matches at least one of the one or more geographic locations specified by the set of access rules. 20. The method of claim 17, wherein:
the set of access rules specifies one or more time periods in which the supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a time at which the text sequence was captured matches at least one of the one or more time periods specified by the set of access rules. 21. The method of claim 17, further comprising determining that a user associated with the text capture operation is registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the user is registered to access the identified supplemental electronic materials. 22. The method of claim 17, further comprising determining that a user associated with the text capture operation is not registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting partial access to the identified supplemental electronic materials in response to determining that the user is not registered to access the identified supplemental electronic materials. 23. The method of claim 17, further comprising determining that print version of the document is not registered for accessing the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the print version of the document is registered for accessing the identified supplemental electronic materials. 24. The method of claim 17, wherein determining that the request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence comprises determining that a user has interest in the identified supplemental electronic materials based on previous content related to the identified supplemental electronic materials that has been scanned by the user. 25. A system, comprising:
a data processing apparatus; and a memory storage apparatus in data communication with the data processing apparatus, the memory storage apparatus storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving a text sequence captured from a print version of a document, the text sequence including an indication that the text sequence was captured from the print version of the document;
identifying the document using the text sequence;
identifying supplemental electronic materials associated with the document, the supplemental electronic materials being materials presentable using an audio or visual medium;
determining that a request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence;
determining that the text sequence includes the indication that the text sequence was captured from the print version of the document;
determining that the request satisfies a set of access rules for the identified supplemental electronic materials in response to determining that the text sequence includes the indication; and
enabling access to the identified supplemental electronic materials in response to determining that the request satisfies the set of access rules. 26. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising:
requesting a scan of a particular location of the print version of the document to receive access to the identified supplemental electronic materials; and receiving data specifying scanned content; wherein determining that the request satisfies the set of access rules further comprises determining that the scanned content matches content located at the particular location. 27. The system of claim 25, wherein:
the set of access rules specifies one or more geographic locations in which the identified supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a geographic location at which the text sequence was captured matches at least one of the one or more geographic locations specified by the set of access rules. 28. The system of claim 25, wherein:
the set of access rules specifies one or more time periods in which the supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a time at which the text sequence was captured matches at least one of the one or more time periods specified by the set of access rules. 29. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that a user associated with the text capture operation is registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the user is registered to access the identified supplemental electronic materials. 30. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that a user associated with the text capture operation is not registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting partial access to the identified supplemental electronic materials in response to determining that the user is not registered to access the identified supplemental electronic materials. 31. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that print version of the document is not registered for accessing the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the print version of the document is registered for accessing the identified supplemental electronic materials. 32. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that the request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence comprises determining that a user has interest in the identified supplemental electronic materials based on previous content related to the identified supplemental electronic materials that has been scanned by the user. 33. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by a data processing apparatus cause the data processing apparatus to perform operations comprising:
receiving a text sequence captured from a print version of a document, the text sequence including an indication that the text sequence was captured from the print version of the document; identifying the document using the text sequence; identifying supplemental electronic materials associated with the document, the supplemental electronic materials being materials presentable using an audio or visual medium; determining that a request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence; determining that the text sequence includes the indication that the text sequence was captured from the print version of the document; determining that the request satisfies a set of access rules for the identified supplemental electronic materials in response to determining that the text sequence includes the indication; and enabling access to the identified supplemental electronic materials in response to determining that the request satisfies the set of access rules. 34. The computer storage medium of claim 33, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising:
requesting a scan of a particular location of the print version of the document to receive access to the identified supplemental electronic materials; and receiving data specifying scanned content; wherein determining that the request satisfies the set of access rules further comprises determining that the scanned content matches content located at the particular location. 35. The computer storage medium of claim 33, wherein:
the set of access rules specifies one or more geographic locations in which the identified supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a geographic location at which the text sequence was captured matches at least one of the one or more geographic locations specified by the set of access rules. 36. The computer storage medium of claim 33, wherein:
the set of access rules specifies one or more time periods in which the supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a time at which the text sequence was captured matches at least one of the one or more time periods specified by the set of access rules. | A system for identifying an electronic counterpart for a rendered document is described. The system receives an indication of a text capture operation performed from a rendered document. The indication identifies a text sequence captured as part of the text capture operation, the identified text sequence comprising fewer than nine words. In response to receiving the indication, the system uniquely identifies an electronic document from which the rendered document was rendered.1-16. (canceled) 17. A method performed by data processing apparatus, the method comprising:
receiving a text sequence captured from a print version of a document, the text sequence including an indication that the text sequence was captured from the print version of the document; identifying the document using the text sequence; identifying supplemental electronic materials associated with the document, the supplemental electronic materials being materials presentable using an audio or visual medium; determining that a request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence; determining that the text sequence includes the indication that the text sequence was captured from the print version of the document; determining that the request satisfies a set of access rules for the identified supplemental electronic materials in response to determining that the text sequence includes the indication; and enabling access to the identified supplemental electronic materials in response to determining that the request satisfies the set of access rules. 18. The method of claim 17, further comprising:
requesting a scan of a particular location of the print version of the document to receive access to the identified supplemental electronic materials; and receiving data specifying scanned content; wherein determining that the request satisfies the set of access rules further comprises determining that the scanned content matches content located at the particular location. 19. The method of claim 17, wherein:
the set of access rules specifies one or more geographic locations in which the identified supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a geographic location at which the text sequence was captured matches at least one of the one or more geographic locations specified by the set of access rules. 20. The method of claim 17, wherein:
the set of access rules specifies one or more time periods in which the supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a time at which the text sequence was captured matches at least one of the one or more time periods specified by the set of access rules. 21. The method of claim 17, further comprising determining that a user associated with the text capture operation is registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the user is registered to access the identified supplemental electronic materials. 22. The method of claim 17, further comprising determining that a user associated with the text capture operation is not registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting partial access to the identified supplemental electronic materials in response to determining that the user is not registered to access the identified supplemental electronic materials. 23. The method of claim 17, further comprising determining that print version of the document is not registered for accessing the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the print version of the document is registered for accessing the identified supplemental electronic materials. 24. The method of claim 17, wherein determining that the request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence comprises determining that a user has interest in the identified supplemental electronic materials based on previous content related to the identified supplemental electronic materials that has been scanned by the user. 25. A system, comprising:
a data processing apparatus; and a memory storage apparatus in data communication with the data processing apparatus, the memory storage apparatus storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:
receiving a text sequence captured from a print version of a document, the text sequence including an indication that the text sequence was captured from the print version of the document;
identifying the document using the text sequence;
identifying supplemental electronic materials associated with the document, the supplemental electronic materials being materials presentable using an audio or visual medium;
determining that a request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence;
determining that the text sequence includes the indication that the text sequence was captured from the print version of the document;
determining that the request satisfies a set of access rules for the identified supplemental electronic materials in response to determining that the text sequence includes the indication; and
enabling access to the identified supplemental electronic materials in response to determining that the request satisfies the set of access rules. 26. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising:
requesting a scan of a particular location of the print version of the document to receive access to the identified supplemental electronic materials; and receiving data specifying scanned content; wherein determining that the request satisfies the set of access rules further comprises determining that the scanned content matches content located at the particular location. 27. The system of claim 25, wherein:
the set of access rules specifies one or more geographic locations in which the identified supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a geographic location at which the text sequence was captured matches at least one of the one or more geographic locations specified by the set of access rules. 28. The system of claim 25, wherein:
the set of access rules specifies one or more time periods in which the supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a time at which the text sequence was captured matches at least one of the one or more time periods specified by the set of access rules. 29. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that a user associated with the text capture operation is registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the user is registered to access the identified supplemental electronic materials. 30. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that a user associated with the text capture operation is not registered to access the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting partial access to the identified supplemental electronic materials in response to determining that the user is not registered to access the identified supplemental electronic materials. 31. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that print version of the document is not registered for accessing the identified supplemental electronic materials, wherein enabling access to the identified supplemental electronic materials comprises permitting full access to the identified supplemental electronic materials in response to determining that the print version of the document is registered for accessing the identified supplemental electronic materials. 32. The system of claim 25, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising determining that the request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence comprises determining that a user has interest in the identified supplemental electronic materials based on previous content related to the identified supplemental electronic materials that has been scanned by the user. 33. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by a data processing apparatus cause the data processing apparatus to perform operations comprising:
receiving a text sequence captured from a print version of a document, the text sequence including an indication that the text sequence was captured from the print version of the document; identifying the document using the text sequence; identifying supplemental electronic materials associated with the document, the supplemental electronic materials being materials presentable using an audio or visual medium; determining that a request to access the identified supplemental electronic materials associated with the document is implicit in receiving the text sequence; determining that the text sequence includes the indication that the text sequence was captured from the print version of the document; determining that the request satisfies a set of access rules for the identified supplemental electronic materials in response to determining that the text sequence includes the indication; and enabling access to the identified supplemental electronic materials in response to determining that the request satisfies the set of access rules. 34. The computer storage medium of claim 33, wherein the instructions upon execution cause the data processing apparatus to perform further operations comprising:
requesting a scan of a particular location of the print version of the document to receive access to the identified supplemental electronic materials; and receiving data specifying scanned content; wherein determining that the request satisfies the set of access rules further comprises determining that the scanned content matches content located at the particular location. 35. The computer storage medium of claim 33, wherein:
the set of access rules specifies one or more geographic locations in which the identified supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a geographic location at which the text sequence was captured matches at least one of the one or more geographic locations specified by the set of access rules. 36. The computer storage medium of claim 33, wherein:
the set of access rules specifies one or more time periods in which the supplemental electronic materials are accessible; and determining that the request satisfies the set of access rules comprises determining that a time at which the text sequence was captured matches at least one of the one or more time periods specified by the set of access rules. | 2,100 |
4,443 | 13,475,203 | 2,128 | Facies modeling with multi-point statistics (MPS) is used for modeling the outline and internal geometry of a sand belt deposited by high sinuosity, meandering river channels, covering all three different scales relevant to describe the heterogeneity of properties affecting fluid flow in the sand belt. The full complexity of real sediments can be modeled if symmetry and geometric opposition are analyzed and used to condition the modeling processes at each of the scales with auxiliary variables to produce realistic results. | 1. A method of developing a hydrocarbon reservoir, the method comprising:
defining a model of an earth formation in which at least one component of the model has an asymmetry, wherein the model substantially has a form of at least one of: (i) symmetry and (ii) geometric opposition; conditioning the model using a measurement of at least one auxiliary variable to produce a conditioned model; and performing developmental operations based at least in part on an output of the conditioned model. 2. The method of claim 1, wherein the at least one auxiliary variable comprises at least one of: (i) seismic wave amplitude, (ii) seismic wave velocity, (iii) seismic wave absorption, (iv) seismic wave instantaneous phase, (v) seismic wave instantaneous frequency, (vi) a measurement indicative of the boundaries of a plurality of channels, and (vii) a difference between dip angle measurements of a shallow reading device and a deep reading device. 3. The method of claim 1, wherein the model includes a heterogeneity associated with at least one of: (i) a channel lag, (ii) a shale drape, and (iii) a mudstone plug. 4. The method of claim 1, wherein defining the model includes using ground truth. 5. The method of claim 5, wherein the ground truth is obtained using at least one of: (i) satellite images, (ii) aerial images, (iii) outcrop analysis, (iv) core analysis, and (v) interpolation between wellbores. 6. The method of claim 1, wherein the developmental operations includes at least one of: (i) estimating sweep efficiency, (ii) evaluating patterns for secondary recovery, (iii) estimating reservoir permeability, and (iv) estimating an amount of recoverable hydrocarbons. 7. A method of developing a hydrocarbon reservoir, the method comprising:
defining a model of an earth formation comprising a plurality of hierarchical models in which at least one of the plurality of hierarchical models has at least one component having an asymmetry, wherein the model substantially has a form of at least one of: (i) symmetry and (ii) geometric opposition; conditioning a model of at least one level of hierarchy using a measurement of at least one auxiliary variable; using a result of the conditioning for altering a model at at least one other level of the hierarchy to produce a conditioned altered model; and performing developmental operations based at least in part on an output of the conditioned altered model. 8. The method of claim 7, wherein the at least one auxiliary variable comprises at least one of: (i) seismic wave amplitude, (ii) seismic wave velocity, (iii) seismic wave absorption, (iv) seismic wave instantaneous phase, (v) seismic wave instantaneous frequency, (vi) a measurement indicative of the boundaries of a plurality of channels,
and (vii) a difference between dip angle measurements of a shallow reading device and a deep reading device. 9. The method of claim 7, wherein the model includes a heterogeneity associated with at least one of: (i) a channel lag, (ii) a shale drape, and (iii) a mudstone plug. 10. The method of claim 7, wherein defining the model includes using ground truth. 11. The method of claim 10, wherein the ground truth is obtained using at least one of: (i) satellite images, (ii) aerial images, (iii) outcrop analysis, (iv) core analysis, and (v) interpolation between wellbores. 12. The method of claim 7, wherein the developmental operations includes at least one of: (i) estimating sweep efficiency, (ii) evaluating patterns for secondary recovery, (iii) estimating reservoir permeability, (iv) estimating an amount of recoverable hydrocarbons. 13. A method of developing a hydrocarbon reservoir, the method comprising:
defining a model of an earth formation comprising a plurality of models having a hierarchy in which a scale of one of the models in the hierarchy is different from a scale of another of the models in the hierarchy; conditioning a model at at least one level of the hierarchy using a measurement of at least one auxiliary variable to produce a conditioned model; and performing developmental operations based at least in part on an output of the conditioned model. 14. The method of claim 13, wherein the at least one auxiliary variable comprises at least one of: (i) seismic wave amplitude, (ii) seismic wave velocity, (iii) seismic wave absorption, (iv) seismic wave instantaneous phase, (v) seismic wave instantaneous frequency, (vi) a measurement indicative of the boundaries of a plurality of channels, and (vii) a difference between dip angle measurements of a shallow reading device and a deep reading device. 15. The method of claim 13, wherein the model includes a heterogeneity associated with at least one of: (i) a channel lag, (ii) a shale drape, and (iii) a mudstone plug. 16. The method of claim 13, wherein defining the model includes using ground truth. 17. The method of claim 16, wherein the ground truth is obtained using at least one of: (i) satellite images, (ii) aerial images, (iii) outcrop analysis, (iv) core analysis, and (v) interpolation between wellbores. 18. The method of claim 13, wherein the developmental operations includes at least one of: (i) estimating sweep efficiency, (ii) evaluating patterns for secondary recovery, (iii) estimating reservoir permeability, and (iv) estimating an amount of recoverable hydrocarbons. 19. A non-transitory computer-readable medium product having stored thereon instructions that, when executed by at least one processor, perform a method, the method comprising:
defining a model of an earth formation in which at least one component of the model has an asymmetry, wherein the model substantially has a form of at least one of: (i) symmetry and (ii) geometric opposition; conditioning the model using a measurement of at least one auxiliary variable to produce a conditioned model; and performing developmental operations based at least in part on an output of the conditioned model. | Facies modeling with multi-point statistics (MPS) is used for modeling the outline and internal geometry of a sand belt deposited by high sinuosity, meandering river channels, covering all three different scales relevant to describe the heterogeneity of properties affecting fluid flow in the sand belt. The full complexity of real sediments can be modeled if symmetry and geometric opposition are analyzed and used to condition the modeling processes at each of the scales with auxiliary variables to produce realistic results.1. A method of developing a hydrocarbon reservoir, the method comprising:
defining a model of an earth formation in which at least one component of the model has an asymmetry, wherein the model substantially has a form of at least one of: (i) symmetry and (ii) geometric opposition; conditioning the model using a measurement of at least one auxiliary variable to produce a conditioned model; and performing developmental operations based at least in part on an output of the conditioned model. 2. The method of claim 1, wherein the at least one auxiliary variable comprises at least one of: (i) seismic wave amplitude, (ii) seismic wave velocity, (iii) seismic wave absorption, (iv) seismic wave instantaneous phase, (v) seismic wave instantaneous frequency, (vi) a measurement indicative of the boundaries of a plurality of channels, and (vii) a difference between dip angle measurements of a shallow reading device and a deep reading device. 3. The method of claim 1, wherein the model includes a heterogeneity associated with at least one of: (i) a channel lag, (ii) a shale drape, and (iii) a mudstone plug. 4. The method of claim 1, wherein defining the model includes using ground truth. 5. The method of claim 5, wherein the ground truth is obtained using at least one of: (i) satellite images, (ii) aerial images, (iii) outcrop analysis, (iv) core analysis, and (v) interpolation between wellbores. 6. The method of claim 1, wherein the developmental operations includes at least one of: (i) estimating sweep efficiency, (ii) evaluating patterns for secondary recovery, (iii) estimating reservoir permeability, and (iv) estimating an amount of recoverable hydrocarbons. 7. A method of developing a hydrocarbon reservoir, the method comprising:
defining a model of an earth formation comprising a plurality of hierarchical models in which at least one of the plurality of hierarchical models has at least one component having an asymmetry, wherein the model substantially has a form of at least one of: (i) symmetry and (ii) geometric opposition; conditioning a model of at least one level of hierarchy using a measurement of at least one auxiliary variable; using a result of the conditioning for altering a model at at least one other level of the hierarchy to produce a conditioned altered model; and performing developmental operations based at least in part on an output of the conditioned altered model. 8. The method of claim 7, wherein the at least one auxiliary variable comprises at least one of: (i) seismic wave amplitude, (ii) seismic wave velocity, (iii) seismic wave absorption, (iv) seismic wave instantaneous phase, (v) seismic wave instantaneous frequency, (vi) a measurement indicative of the boundaries of a plurality of channels,
and (vii) a difference between dip angle measurements of a shallow reading device and a deep reading device. 9. The method of claim 7, wherein the model includes a heterogeneity associated with at least one of: (i) a channel lag, (ii) a shale drape, and (iii) a mudstone plug. 10. The method of claim 7, wherein defining the model includes using ground truth. 11. The method of claim 10, wherein the ground truth is obtained using at least one of: (i) satellite images, (ii) aerial images, (iii) outcrop analysis, (iv) core analysis, and (v) interpolation between wellbores. 12. The method of claim 7, wherein the developmental operations includes at least one of: (i) estimating sweep efficiency, (ii) evaluating patterns for secondary recovery, (iii) estimating reservoir permeability, (iv) estimating an amount of recoverable hydrocarbons. 13. A method of developing a hydrocarbon reservoir, the method comprising:
defining a model of an earth formation comprising a plurality of models having a hierarchy in which a scale of one of the models in the hierarchy is different from a scale of another of the models in the hierarchy; conditioning a model at at least one level of the hierarchy using a measurement of at least one auxiliary variable to produce a conditioned model; and performing developmental operations based at least in part on an output of the conditioned model. 14. The method of claim 13, wherein the at least one auxiliary variable comprises at least one of: (i) seismic wave amplitude, (ii) seismic wave velocity, (iii) seismic wave absorption, (iv) seismic wave instantaneous phase, (v) seismic wave instantaneous frequency, (vi) a measurement indicative of the boundaries of a plurality of channels, and (vii) a difference between dip angle measurements of a shallow reading device and a deep reading device. 15. The method of claim 13, wherein the model includes a heterogeneity associated with at least one of: (i) a channel lag, (ii) a shale drape, and (iii) a mudstone plug. 16. The method of claim 13, wherein defining the model includes using ground truth. 17. The method of claim 16, wherein the ground truth is obtained using at least one of: (i) satellite images, (ii) aerial images, (iii) outcrop analysis, (iv) core analysis, and (v) interpolation between wellbores. 18. The method of claim 13, wherein the developmental operations includes at least one of: (i) estimating sweep efficiency, (ii) evaluating patterns for secondary recovery, (iii) estimating reservoir permeability, and (iv) estimating an amount of recoverable hydrocarbons. 19. A non-transitory computer-readable medium product having stored thereon instructions that, when executed by at least one processor, perform a method, the method comprising:
defining a model of an earth formation in which at least one component of the model has an asymmetry, wherein the model substantially has a form of at least one of: (i) symmetry and (ii) geometric opposition; conditioning the model using a measurement of at least one auxiliary variable to produce a conditioned model; and performing developmental operations based at least in part on an output of the conditioned model. | 2,100 |
4,444 | 15,455,458 | 2,168 | A system and method for outputting weather data associated with a user-specified location based on a user-specified weather inquiry, including weather data output based on user-specified weather conditions, locations output based on a user-specified weather inquiry, notifications output regarding weather-related warnings, and notifications output based on weather-related notification thresholds. | 1. A system, comprising:
a weather information database configured to store weather data associated with a plurality of geographic locations; a graphical user interface configured to receive a plurality of user-specified locations and a user-defined query from a user, the user-defined query including at least one user-specified weather condition or at least one weather-related warning; a user information database configured to store the user-specified locations and the user-defined query received from the user via the graphical user interface; and an analysis unit configured to simultaneously output the user-specified locations that satisfy the user-defined query via the graphical user interface in either a list or a map that includes visual indications of the user-specified locations. 2.-74. (canceled) 75. A method, comprising:
receiving weather data associated with a plurality of geographic locations; receiving a plurality of user-specified locations and a user-defined query from a user via a graphical user interface, the user-defined query including at least one user-specified weather condition or at least one weather-related warning; storing the user-specified locations and the user-defined query received from the user via the graphical user interface; and simultaneously outputting user-specified locations that satisfy the user-defined query via the graphical user interface in either a list or a map that includes visual indications of the user-specified locations. 76. The method of claim 75, wherein the weather data comprises a plurality of current, historical and forecasted weather conditions and a plurality of weather-related warnings. 77. The method of claim 75, wherein the weather data comprises a plurality of weather-related warnings, the weather-related warnings including river flood warnings, thunderstorm watch boxes, tornado watch boxes, mesoscale discussions, polygon warnings, zone/country warnings, outlooks, advisories, watches, special weather statements, lightning warnings, thunderstorm warnings, heavy rain warnings, high wind warnings, high or low temperature warnings, local storm reports, earthquakes, or hurricane impact forecasts. 78. The method of claim 75, wherein the user-specified locations are facility locations. 79. The method of claim 75, wherein the user-specified location is a portion of a road, a portion of a railway line, or a linear or non-linear path between two or more of the geographic locations. 75. The method of claim 75, further comprising:
receiving via a network a location of a mobile computer system from the mobile computer system, the location of the mobile computer system determined by a location detection unit configured to determine the location of the mobile computer system; and determining the user-specified location based on a location of a mobile computer system, 81.-97. (canceled) 98. The method of claim 75, wherein the weather data includes a plurality of weather-related warnings associated with the plurality of geographic locations and the user-specified query comprises at least one weather-related warning of the plurality of weather-related warnings, further comprising:
determining if each of the plurality of user-specified locations satisfy the user-defined query by determining if the weather data includes the at least one weather-related warning in the plurality of user-specified locations. 99. The method of claim 98, wherein the user specified query further comprises a user-specified distance threshold and the determining if each of the plurality of user-specified locations satisfy the user-defined query by comprises determining if the weather data includes the at least one weather-related warning in one of the geographic locations less than or equal to the distance threshold from the plurality of user-specified locations. 100. The method of claim 98, wherein the user specified query further comprises a user-specified time period and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates that the at least one weather-related warning was issued during the user-specified time period in the plurality of user-specified locations. 101. The method of claim 98, further comprising:
repeatedly receiving updated weather data and the determining if the updated weather data includes the at least one weather-related warning in the plurality of user-specified locations, wherein determining if the updated weather data includes the at least one weather-related warning in the plurality of user-specified locations comprises automatically and repeatedly determining if the updated weather data includes the at least one weather-related warning in the plurality of user-specified locations. 102. (canceled) 103. The method of claim 75, wherein the weather data includes a plurality of weather conditions associated with the plurality of geographic locations, the user-specified query comprises at least one user-specified weather condition of the plurality of weather conditions and a weather-related threshold associated with the at least one user-specified weather condition, and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates that the at least one user-specified weather condition is:
greater than or equal to the weather-related threshold in the plurality of user-specified locations; or less than or equal to the weather-related threshold in the plurality of user-specified locations. 104. The method of claim 103, wherein the user specified query further comprises a user-specified distance threshold and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates that the at least one user-specified weather condition is:
greater than or equal to the weather-related threshold in one of the geographic locations less than or equal to the user-specified distance threshold from the plurality of user-specified locations; or less than or equal to the weather-related threshold in one of the geographic locations less than or equal to the user-specified distance threshold from the plurality of user-specified locations. 105. The method of claim 103, wherein the user specified query further comprises a user-specified time period and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates weather data indicating that the at least one user-specified weather condition was:
greater than or equal to the weather-related threshold during the user-specified time period in the plurality of user-specified locations; or less than or equal to the weather-related threshold during the user-specified time period in the plurality of user-specified locations. 106. The method of claim 103, further comprising:
repeatedly receiving updated weather data; and determining if the weather data indicates that the at least one user-specified weather condition is: greater than or equal to the weather-related threshold in the plurality of user-specified locations; or less than or equal to the weather-related threshold in the plurality of user-specified locations. 107. The method of claim 103, wherein the determining if the weather data indicates that the at least one user-specified weather condition comprises automatically and repeatedly determining if the weather data indicates that the at least one user-specified weather condition is:
greater than or equal to the weather-related threshold in the plurality of user-specitied locations; or less than or equal to the weather-related threshold in the plurality of user-specified locations. 108. The method of claim 75, further comprising:
initiating a business action based on the determination of which of the plurality of user-specified locations satisfy the user-defined query. 109. The method of claim 108, wherein the initiating a business action comprises outputting a message to the plurality of user-specified locations that satisfy the user-defined query. 110.-148. (canceled) 149. A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause a computing device to:
receive weather data associated with a plurality of geographic locations; receive a plurality of user-specified locations and a user-defined query from a user via a graphical user interface, the user-defined query including at least one user-specified weather condition or at least one weather-related warning; store the user-specified locations and the user-defined query received from the user via the graphical user interface; and simultaneously output user-specified locations that satisfy the user-defined query via the graphical user interface in either a list or a map that includes visual indications of the user-specified locations. | A system and method for outputting weather data associated with a user-specified location based on a user-specified weather inquiry, including weather data output based on user-specified weather conditions, locations output based on a user-specified weather inquiry, notifications output regarding weather-related warnings, and notifications output based on weather-related notification thresholds.1. A system, comprising:
a weather information database configured to store weather data associated with a plurality of geographic locations; a graphical user interface configured to receive a plurality of user-specified locations and a user-defined query from a user, the user-defined query including at least one user-specified weather condition or at least one weather-related warning; a user information database configured to store the user-specified locations and the user-defined query received from the user via the graphical user interface; and an analysis unit configured to simultaneously output the user-specified locations that satisfy the user-defined query via the graphical user interface in either a list or a map that includes visual indications of the user-specified locations. 2.-74. (canceled) 75. A method, comprising:
receiving weather data associated with a plurality of geographic locations; receiving a plurality of user-specified locations and a user-defined query from a user via a graphical user interface, the user-defined query including at least one user-specified weather condition or at least one weather-related warning; storing the user-specified locations and the user-defined query received from the user via the graphical user interface; and simultaneously outputting user-specified locations that satisfy the user-defined query via the graphical user interface in either a list or a map that includes visual indications of the user-specified locations. 76. The method of claim 75, wherein the weather data comprises a plurality of current, historical and forecasted weather conditions and a plurality of weather-related warnings. 77. The method of claim 75, wherein the weather data comprises a plurality of weather-related warnings, the weather-related warnings including river flood warnings, thunderstorm watch boxes, tornado watch boxes, mesoscale discussions, polygon warnings, zone/country warnings, outlooks, advisories, watches, special weather statements, lightning warnings, thunderstorm warnings, heavy rain warnings, high wind warnings, high or low temperature warnings, local storm reports, earthquakes, or hurricane impact forecasts. 78. The method of claim 75, wherein the user-specified locations are facility locations. 79. The method of claim 75, wherein the user-specified location is a portion of a road, a portion of a railway line, or a linear or non-linear path between two or more of the geographic locations. 75. The method of claim 75, further comprising:
receiving via a network a location of a mobile computer system from the mobile computer system, the location of the mobile computer system determined by a location detection unit configured to determine the location of the mobile computer system; and determining the user-specified location based on a location of a mobile computer system, 81.-97. (canceled) 98. The method of claim 75, wherein the weather data includes a plurality of weather-related warnings associated with the plurality of geographic locations and the user-specified query comprises at least one weather-related warning of the plurality of weather-related warnings, further comprising:
determining if each of the plurality of user-specified locations satisfy the user-defined query by determining if the weather data includes the at least one weather-related warning in the plurality of user-specified locations. 99. The method of claim 98, wherein the user specified query further comprises a user-specified distance threshold and the determining if each of the plurality of user-specified locations satisfy the user-defined query by comprises determining if the weather data includes the at least one weather-related warning in one of the geographic locations less than or equal to the distance threshold from the plurality of user-specified locations. 100. The method of claim 98, wherein the user specified query further comprises a user-specified time period and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates that the at least one weather-related warning was issued during the user-specified time period in the plurality of user-specified locations. 101. The method of claim 98, further comprising:
repeatedly receiving updated weather data and the determining if the updated weather data includes the at least one weather-related warning in the plurality of user-specified locations, wherein determining if the updated weather data includes the at least one weather-related warning in the plurality of user-specified locations comprises automatically and repeatedly determining if the updated weather data includes the at least one weather-related warning in the plurality of user-specified locations. 102. (canceled) 103. The method of claim 75, wherein the weather data includes a plurality of weather conditions associated with the plurality of geographic locations, the user-specified query comprises at least one user-specified weather condition of the plurality of weather conditions and a weather-related threshold associated with the at least one user-specified weather condition, and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates that the at least one user-specified weather condition is:
greater than or equal to the weather-related threshold in the plurality of user-specified locations; or less than or equal to the weather-related threshold in the plurality of user-specified locations. 104. The method of claim 103, wherein the user specified query further comprises a user-specified distance threshold and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates that the at least one user-specified weather condition is:
greater than or equal to the weather-related threshold in one of the geographic locations less than or equal to the user-specified distance threshold from the plurality of user-specified locations; or less than or equal to the weather-related threshold in one of the geographic locations less than or equal to the user-specified distance threshold from the plurality of user-specified locations. 105. The method of claim 103, wherein the user specified query further comprises a user-specified time period and the determining if each of the plurality of user-specified locations satisfy the user-defined query comprises determining if the weather data indicates weather data indicating that the at least one user-specified weather condition was:
greater than or equal to the weather-related threshold during the user-specified time period in the plurality of user-specified locations; or less than or equal to the weather-related threshold during the user-specified time period in the plurality of user-specified locations. 106. The method of claim 103, further comprising:
repeatedly receiving updated weather data; and determining if the weather data indicates that the at least one user-specified weather condition is: greater than or equal to the weather-related threshold in the plurality of user-specified locations; or less than or equal to the weather-related threshold in the plurality of user-specified locations. 107. The method of claim 103, wherein the determining if the weather data indicates that the at least one user-specified weather condition comprises automatically and repeatedly determining if the weather data indicates that the at least one user-specified weather condition is:
greater than or equal to the weather-related threshold in the plurality of user-specitied locations; or less than or equal to the weather-related threshold in the plurality of user-specified locations. 108. The method of claim 75, further comprising:
initiating a business action based on the determination of which of the plurality of user-specified locations satisfy the user-defined query. 109. The method of claim 108, wherein the initiating a business action comprises outputting a message to the plurality of user-specified locations that satisfy the user-defined query. 110.-148. (canceled) 149. A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause a computing device to:
receive weather data associated with a plurality of geographic locations; receive a plurality of user-specified locations and a user-defined query from a user via a graphical user interface, the user-defined query including at least one user-specified weather condition or at least one weather-related warning; store the user-specified locations and the user-defined query received from the user via the graphical user interface; and simultaneously output user-specified locations that satisfy the user-defined query via the graphical user interface in either a list or a map that includes visual indications of the user-specified locations. | 2,100 |
4,445 | 13,556,013 | 2,143 | Techniques for remote application access are described. Some embodiments provide access to an application executing on a host system via a Web browser of a client device. A user operating the Web browser may request access to the application via a uniform resource identifier. A service executing on the host system receives the request and facilitates access to the application. Facilitating access may include transmitting to the Web browser image data corresponding to a window or graphical user interface generated by the application and stored on the host system. Client logic executing within the Web browser receives the image data and displays a local copy of the application window on the client device. The client logic also forwards user input events made with respect to the to the local window to the remote presentation service, which in turn forwards the events to the window/application on the host system. | 1. A method in a host computing system for providing access via a remote Web client to applications on the host computing system, the Web client executing on a client device having a display device, the method comprising:
providing a uniform resource identifier that identifies an application executing on the host computing system, the host computing system including a display buffer for storing an output graphical user interface generated by the application; receiving a request to access the application, the request received from the remote Web client and based on the uniform resource identifier; and facilitating user interaction with the application on the host computing system, by:
causing the remote Web client to display the graphical user interface of the application from the display buffer in the host computing system; and
receiving from the remote Web client indications of inputs made by the user with respect to the displayed graphical user interface. 2. The method of claim 1, wherein the receiving a request to access the application includes: receiving an HTTP request that identifies the application along with one or more arguments. 3. The method of claim 2, wherein the one or more arguments include an indication of a file, and further comprising: initiating execution of the application with the indicated file. 4. The method of claim 2, wherein the one or more arguments include an indication of a preferred window state, and further comprising: causing the graphical user interface to be displayed based on the preferred window state, the preferred window state being at least one of window maximized, window minimized, and/or window size. 5. The method of claim 2, wherein the one or more arguments include an indication of a user environment on the host computing system, and further comprising: initiating execution of the application based on the user environment. 6. The method of claim 5, wherein the host computing system is a virtual machine, wherein the user environment is a virtual desktop, and wherein causing the remote Web client to display the graphical user interface includes causing the remote Web client to display a portion of the virtual desktop, the portion being less than all of the virtual desktop. 7. The method of claim 5, wherein the host computing system is a physical machine, wherein initiating execution of the application based on the user environment includes executing an application that is installed on the physical machine and that is accessible via a user account identified by the user environment. 8. The method of claim 1, wherein the facilitating user interaction with the application includes: in response to the receiving a request to access the application, transmitting a code module that is configured, when executed by the Web client, to display via the Web client the graphical user interface and to transmit to the host computing system the indications of inputs made by the user. 9. The method of claim 1, wherein the facilitating user interaction with the application includes: facilitating user interaction via an HTTP connection between the remote Web client and a presentation service executing on the host computing system. 10. The method of claim 1, wherein the causing the remote Web client to display the graphical user interface includes:
transmitting to the remote Web client image data representing a first window of the graphical user interface; and causing the remote Web client to display a second window as a copy of the first window, the second window including the image data. 11. The method of claim 1, wherein the causing the remote Web client to display the graphical user interface includes: causing the remote Web client to display image data representing the graphical user interface via an HTML 5 canvas element. 12. The method of claim 1, wherein the facilitating user interaction with the application includes:
determining one or more image blocks that include modified portions of the graphical user interface; and transmitting the one or more image blocks to the remote Web client. 13. The method of claim 1, wherein the receiving from the remote Web client indications of inputs includes: receiving an indication of a mouse event and a corresponding location from the remote Web client. 14. The method of claim 13, further comprising: translating the location of the mouse event into a coordinate system of the host computing system. 15. The method of claim 1, further comprising: tracking information about multiple applications executing on the host computing system, the tracked information including application identifiers, application window positions, application window sizes, and/or application events. 16. A system for providing access via a Web client to remote applications, the system comprising:
a host computing system including a processor, a memory, a display buffer, an application, a first window stored in the display buffer, and a remote presentation service module stored in the memory and configured, when executed by the processor, to:
receive a request to access the application, the request received from a remote Web client executing on a client computing device having a display device, the request based on a uniform resource identifier that identifies the application; and
facilitate user interaction with the application, by:
causing the remote Web client to display a second window on the display device of the client device, the second window based on the first window; and
receiving from the remote Web client indications of inputs made by the user with respect to the displayed second window. 17. The system of claim 16, wherein the remote presentation service module is further configured to:
transmit client logic to the Web client, the client logic configured, when executed by the client computing device, to:
receive from the remote presentation service module image data representing the first window;
present the image data on the display device of the client computing device; and
transmit to the remote presentation service module the indications of inputs made by the user. 18. The system of claim 17, wherein the client computing device is one of a smart phone, a tablet computer, a laptop computer, and/or a desktop computer. 19. The system of claim 17, wherein the remote presentation service module is further configured to, in response to the request to access the application, transmit to the client computing device the client logic as part of an HTTP transaction. 20. The system of claim 16, wherein the host computing system includes multiple virtual machines that each host one or more applications and that each provide remote access to the one or more applications to a distinct Web client. 21. The system of claim 16, wherein the uniform resource identifier includes a first portion that identifies the application, a second portion that identifies a file to be opened via the application, and a third portion that specifies a preferred window size. 22. The system of claim 16, wherein the remote presentation service module is further configured to translate a location of a mouse input event received from the Web client into a coordinate system of the host computing system. 23. The system of claim 16, wherein the host computing system executes a different operating system than the client computing device, and wherein the application is not configured to run natively on the operating system of the client computing device. 24. The system of claim 16, wherein the remote Web client is a Web browser application. 25. The system of claim 16, wherein the second window is not an identical copy of the first window, and wherein the remote presentation service module is configured to transmit to the Web client a compressed representation of image data from the first window. 26. A non-transitory computer-readable medium including contents that are configured, when executed, to cause a host computing system to perform a method for providing access via a remote Web client to applications on the host computing system, the Web client executing on a client device having a display device, the method comprising:
receiving a request to access an application executing on the host computing system, the application having a first window for display on a local display device of the host computing system, the request received from the remote Web client and based on a uniform resource identifier that identifies the host computing system and the application; and facilitating user interaction with the application on the host computing system, by:
causing the remote Web client to display a second window on the display device of the client device, the second window based on the first window; and
receiving from the remote Web client indications of inputs made by the user with respect to the displayed second window. 27. The computer-readable medium of claim 26, wherein the contents include instructions that are stored in a memory of the computing system and that are configured to cause the computing system to perform the method. | Techniques for remote application access are described. Some embodiments provide access to an application executing on a host system via a Web browser of a client device. A user operating the Web browser may request access to the application via a uniform resource identifier. A service executing on the host system receives the request and facilitates access to the application. Facilitating access may include transmitting to the Web browser image data corresponding to a window or graphical user interface generated by the application and stored on the host system. Client logic executing within the Web browser receives the image data and displays a local copy of the application window on the client device. The client logic also forwards user input events made with respect to the to the local window to the remote presentation service, which in turn forwards the events to the window/application on the host system.1. A method in a host computing system for providing access via a remote Web client to applications on the host computing system, the Web client executing on a client device having a display device, the method comprising:
providing a uniform resource identifier that identifies an application executing on the host computing system, the host computing system including a display buffer for storing an output graphical user interface generated by the application; receiving a request to access the application, the request received from the remote Web client and based on the uniform resource identifier; and facilitating user interaction with the application on the host computing system, by:
causing the remote Web client to display the graphical user interface of the application from the display buffer in the host computing system; and
receiving from the remote Web client indications of inputs made by the user with respect to the displayed graphical user interface. 2. The method of claim 1, wherein the receiving a request to access the application includes: receiving an HTTP request that identifies the application along with one or more arguments. 3. The method of claim 2, wherein the one or more arguments include an indication of a file, and further comprising: initiating execution of the application with the indicated file. 4. The method of claim 2, wherein the one or more arguments include an indication of a preferred window state, and further comprising: causing the graphical user interface to be displayed based on the preferred window state, the preferred window state being at least one of window maximized, window minimized, and/or window size. 5. The method of claim 2, wherein the one or more arguments include an indication of a user environment on the host computing system, and further comprising: initiating execution of the application based on the user environment. 6. The method of claim 5, wherein the host computing system is a virtual machine, wherein the user environment is a virtual desktop, and wherein causing the remote Web client to display the graphical user interface includes causing the remote Web client to display a portion of the virtual desktop, the portion being less than all of the virtual desktop. 7. The method of claim 5, wherein the host computing system is a physical machine, wherein initiating execution of the application based on the user environment includes executing an application that is installed on the physical machine and that is accessible via a user account identified by the user environment. 8. The method of claim 1, wherein the facilitating user interaction with the application includes: in response to the receiving a request to access the application, transmitting a code module that is configured, when executed by the Web client, to display via the Web client the graphical user interface and to transmit to the host computing system the indications of inputs made by the user. 9. The method of claim 1, wherein the facilitating user interaction with the application includes: facilitating user interaction via an HTTP connection between the remote Web client and a presentation service executing on the host computing system. 10. The method of claim 1, wherein the causing the remote Web client to display the graphical user interface includes:
transmitting to the remote Web client image data representing a first window of the graphical user interface; and causing the remote Web client to display a second window as a copy of the first window, the second window including the image data. 11. The method of claim 1, wherein the causing the remote Web client to display the graphical user interface includes: causing the remote Web client to display image data representing the graphical user interface via an HTML 5 canvas element. 12. The method of claim 1, wherein the facilitating user interaction with the application includes:
determining one or more image blocks that include modified portions of the graphical user interface; and transmitting the one or more image blocks to the remote Web client. 13. The method of claim 1, wherein the receiving from the remote Web client indications of inputs includes: receiving an indication of a mouse event and a corresponding location from the remote Web client. 14. The method of claim 13, further comprising: translating the location of the mouse event into a coordinate system of the host computing system. 15. The method of claim 1, further comprising: tracking information about multiple applications executing on the host computing system, the tracked information including application identifiers, application window positions, application window sizes, and/or application events. 16. A system for providing access via a Web client to remote applications, the system comprising:
a host computing system including a processor, a memory, a display buffer, an application, a first window stored in the display buffer, and a remote presentation service module stored in the memory and configured, when executed by the processor, to:
receive a request to access the application, the request received from a remote Web client executing on a client computing device having a display device, the request based on a uniform resource identifier that identifies the application; and
facilitate user interaction with the application, by:
causing the remote Web client to display a second window on the display device of the client device, the second window based on the first window; and
receiving from the remote Web client indications of inputs made by the user with respect to the displayed second window. 17. The system of claim 16, wherein the remote presentation service module is further configured to:
transmit client logic to the Web client, the client logic configured, when executed by the client computing device, to:
receive from the remote presentation service module image data representing the first window;
present the image data on the display device of the client computing device; and
transmit to the remote presentation service module the indications of inputs made by the user. 18. The system of claim 17, wherein the client computing device is one of a smart phone, a tablet computer, a laptop computer, and/or a desktop computer. 19. The system of claim 17, wherein the remote presentation service module is further configured to, in response to the request to access the application, transmit to the client computing device the client logic as part of an HTTP transaction. 20. The system of claim 16, wherein the host computing system includes multiple virtual machines that each host one or more applications and that each provide remote access to the one or more applications to a distinct Web client. 21. The system of claim 16, wherein the uniform resource identifier includes a first portion that identifies the application, a second portion that identifies a file to be opened via the application, and a third portion that specifies a preferred window size. 22. The system of claim 16, wherein the remote presentation service module is further configured to translate a location of a mouse input event received from the Web client into a coordinate system of the host computing system. 23. The system of claim 16, wherein the host computing system executes a different operating system than the client computing device, and wherein the application is not configured to run natively on the operating system of the client computing device. 24. The system of claim 16, wherein the remote Web client is a Web browser application. 25. The system of claim 16, wherein the second window is not an identical copy of the first window, and wherein the remote presentation service module is configured to transmit to the Web client a compressed representation of image data from the first window. 26. A non-transitory computer-readable medium including contents that are configured, when executed, to cause a host computing system to perform a method for providing access via a remote Web client to applications on the host computing system, the Web client executing on a client device having a display device, the method comprising:
receiving a request to access an application executing on the host computing system, the application having a first window for display on a local display device of the host computing system, the request received from the remote Web client and based on a uniform resource identifier that identifies the host computing system and the application; and facilitating user interaction with the application on the host computing system, by:
causing the remote Web client to display a second window on the display device of the client device, the second window based on the first window; and
receiving from the remote Web client indications of inputs made by the user with respect to the displayed second window. 27. The computer-readable medium of claim 26, wherein the contents include instructions that are stored in a memory of the computing system and that are configured to cause the computing system to perform the method. | 2,100 |
4,446 | 15,160,322 | 2,111 | A system uses multi-level encoding where each symbol of a plurality of symbols represents more than one bit of information in a user data symbol stream for transfer using a multilevel transmission channel. The user data symbols are represented in a digital bitwise form such that each symbol is presented as a plurality of bits and each bit is subject to a different probability of error. An error correction procedure is applied based on the different error probability that is associated with each bit in the plurality. The channel can be configured to support a mosaic tile structure, each tile containing a channel symbol such that a selected tile has a collective error probability that is different from other tiles. Customized coding can be applied to the tile structure to allocate a selected amount of error correction power to the selected tile based on an overall available correction power. | 1. In a system which uses multi-level data encoding where each symbol of a plurality of user data symbols represents more than one bit of information in a user data symbol stream for transfer using a multilevel transmission channel, a controller comprising:
a data transfer section for representing said user data symbols, in relation to said transfer, in a digital bitwise form such that each symbol is presented as a plurality of bits where each bit in the plurality of bits is subject to a different probability of error; and an error correction section for applying an error correction procedure to the plurality of bits, for the bitwise digital form of each user data symbol that is transferred, based on the different error probability that is associated with each bit in the plurality of bits such that an error correction power for at least one bit of the plurality of bits is different than another error correction power that is associated with another one of the plurality of bits. 2. The controller of claim 1 wherein said error correction section includes an encoder for encoding each bit of the plurality of bits, based on the bitwise digital form of each symbol to be transferred, to apply a customized encoding to at least a selected one of the plurality of bits which is based on a bit error rate that is different for each one of the plurality of bits for use as encoded symbols and for passing the encoded symbols to the multilevel transmission channel as said symbol stream and a decoder for receiving the encoded symbols from the multilevel transmission channel and decoding the encoded symbols, as received from the multilevel transmission channel, in a way that applies a customized decoding to at least the selected one of the plurality of bits, based on the bit error rate for each one of the plurality of bits, to restore the symbols to said digital bitwise form and to remove said customized encoding in a way which cooperates with the customized encoding to provide a customized error correction power that is different from another error correction power that is associated with at least one other one of the plurality of bits. | A system uses multi-level encoding where each symbol of a plurality of symbols represents more than one bit of information in a user data symbol stream for transfer using a multilevel transmission channel. The user data symbols are represented in a digital bitwise form such that each symbol is presented as a plurality of bits and each bit is subject to a different probability of error. An error correction procedure is applied based on the different error probability that is associated with each bit in the plurality. The channel can be configured to support a mosaic tile structure, each tile containing a channel symbol such that a selected tile has a collective error probability that is different from other tiles. Customized coding can be applied to the tile structure to allocate a selected amount of error correction power to the selected tile based on an overall available correction power.1. In a system which uses multi-level data encoding where each symbol of a plurality of user data symbols represents more than one bit of information in a user data symbol stream for transfer using a multilevel transmission channel, a controller comprising:
a data transfer section for representing said user data symbols, in relation to said transfer, in a digital bitwise form such that each symbol is presented as a plurality of bits where each bit in the plurality of bits is subject to a different probability of error; and an error correction section for applying an error correction procedure to the plurality of bits, for the bitwise digital form of each user data symbol that is transferred, based on the different error probability that is associated with each bit in the plurality of bits such that an error correction power for at least one bit of the plurality of bits is different than another error correction power that is associated with another one of the plurality of bits. 2. The controller of claim 1 wherein said error correction section includes an encoder for encoding each bit of the plurality of bits, based on the bitwise digital form of each symbol to be transferred, to apply a customized encoding to at least a selected one of the plurality of bits which is based on a bit error rate that is different for each one of the plurality of bits for use as encoded symbols and for passing the encoded symbols to the multilevel transmission channel as said symbol stream and a decoder for receiving the encoded symbols from the multilevel transmission channel and decoding the encoded symbols, as received from the multilevel transmission channel, in a way that applies a customized decoding to at least the selected one of the plurality of bits, based on the bit error rate for each one of the plurality of bits, to restore the symbols to said digital bitwise form and to remove said customized encoding in a way which cooperates with the customized encoding to provide a customized error correction power that is different from another error correction power that is associated with at least one other one of the plurality of bits. | 2,100 |
4,447 | 14,142,376 | 2,176 | A method, system and apparatus for configuring a page for drag and drop arrangement of content artifacts can include populating a content artifact registry with a plurality of content artifacts, each of the content artifacts defining a draggable and droppable form of a particular type of page content. The method further can include defining a drop zone within the page to receive a dragged and dropped one of the content artifacts, the drop zone defining a consumable type of page content and an action to undertake when consuming a dropped one of the content artifacts having a particular type of page content consistent with the consumable type of page content. | 1-20. (canceled) 21. A method for configuring a page within a page development tool, comprising:
populating a registry with a plurality of content artifacts; declaring, using the page development tool, a plurality of drop zones within the page; receiving, within one of the plurality of drop zones and by a drag and drop operation, one of the content artifacts; and performing, by the page development tool, an action on the received one of the content artifacts, wherein each drop zone separately defines a type of page content and an action to undertake upon receiving a dragged and dropped one of the content artificats. 22. The method of claim 21, wherein
the registry includes a content artifact explicitly expressed using a definitive expression including a control type and at least one parameter. 23. The method of claim 21, wherein
the registry includes an inferred content artifact. 24. The method of claim 21, wherein the populating includes:
extricating content from the page; inferring a content artifact from the extricated content along with corresponding artifact parameters; and populating the content artifact registry with the inferred content artifact. 25. The method of claim 21, further comprising
defining a style for the drop zone; and highlighting, based upon a content artifact in the registry being selected having a type of page content consistent with the type of page content defined for the drop zone, the drop zone using the style. 26. The method of claim 25, wherein
the defining includes applying script layering to generate a connector between the drop zone and the selected one of the content artifacts. 27. A computer hardware system adapted to configure a page within a page development tool, comprising:
at least one processor, wherein the at least one processor is configured to initiate and/or perform:
populating a registry with a plurality of content artifacts;
declaring, using the page development tool, a plurality of drop zones within the page;
receiving, within one of the plurality of drop zones and by a drag and drop operation, one of the content artifacts; and
performing, by the page development tool, an action on the received one of the content artifacts, wherein
each drop zone separately defines a type of page content and an action to undertake upon receiving a dragged and dropped one of the content artifacts. 28. The system of claim 27, wherein
the registry includes a content artifact explicitly expressed using a definitive expression including a control type and at least one parameter. 29. The system of claim 27, wherein
the registry includes an inferred content artifact. 30. The system of claim 27, wherein the populating includes:
extricating content from the page; inferring a content artifact from the extricated content along with corresponding artifact parameters; and populating the content artifact registry with the inferred content artifact. 31. The system of claim 27, wherein the at least one processor is further configured to initiate and/or perform:
defining a style for the drop zone; and highlighting, based upon a content artifact in the registry being selected having a type of page content consistent with the type of page content defined for the drop zone, the drop zone using the style. 32. The system of claim 31, wherein
the defining includes applying script layering to generate a connector between the drop zone and the selected one of the content artifacts. 33. A machine readable storage having stored therein a computer program for configuring a page within a page development tool, the computer program comprising a routine set of instructions which when executed by a machine cause the machine to perform:
populating a registry with a plurality of content artifacts; declaring, using the page development tool, a plurality of drop zones within the page; receiving, within one of the plurality of drop zones and by a drag and drop operation, one of the content artifacts; and performing, by the page development tool, an action on the received one of the content artifacts, wherein each drop zone separately defines a type of page content and an action to undertake upon receiving a dragged and dropped one of the content artifacts. 34. The machine readable storage of claim 33, wherein
the registry includes a content artifact explicitly expressed using a definitive expression including a control type and at least one parameter. 35. The machine readable storage of claim 33, wherein
the registry includes an inferred content artifact. 36. The machine readable storage of claim 33, wherein the populating includes:
extricating content from the page; inferring a content artifact from the extricated content along with corresponding artifact parameters; and populating the content artifact registry with the inferred content artifact. 37. The machine readable storage of claim 33, wherein the routine set of instructions further cause the machine to perform:
defining a style for the drop zone; and highlighting, based upon a content artifact in the registry being selected having a type of page content consistent with the type of page content defined for the drop zone, the drop zone using the style. 38. The machine readable storage of claim 37, wherein
the defining includes applying script layering to generate a connector between the drop zone and the selected one of the content artifacts. | A method, system and apparatus for configuring a page for drag and drop arrangement of content artifacts can include populating a content artifact registry with a plurality of content artifacts, each of the content artifacts defining a draggable and droppable form of a particular type of page content. The method further can include defining a drop zone within the page to receive a dragged and dropped one of the content artifacts, the drop zone defining a consumable type of page content and an action to undertake when consuming a dropped one of the content artifacts having a particular type of page content consistent with the consumable type of page content.1-20. (canceled) 21. A method for configuring a page within a page development tool, comprising:
populating a registry with a plurality of content artifacts; declaring, using the page development tool, a plurality of drop zones within the page; receiving, within one of the plurality of drop zones and by a drag and drop operation, one of the content artifacts; and performing, by the page development tool, an action on the received one of the content artifacts, wherein each drop zone separately defines a type of page content and an action to undertake upon receiving a dragged and dropped one of the content artificats. 22. The method of claim 21, wherein
the registry includes a content artifact explicitly expressed using a definitive expression including a control type and at least one parameter. 23. The method of claim 21, wherein
the registry includes an inferred content artifact. 24. The method of claim 21, wherein the populating includes:
extricating content from the page; inferring a content artifact from the extricated content along with corresponding artifact parameters; and populating the content artifact registry with the inferred content artifact. 25. The method of claim 21, further comprising
defining a style for the drop zone; and highlighting, based upon a content artifact in the registry being selected having a type of page content consistent with the type of page content defined for the drop zone, the drop zone using the style. 26. The method of claim 25, wherein
the defining includes applying script layering to generate a connector between the drop zone and the selected one of the content artifacts. 27. A computer hardware system adapted to configure a page within a page development tool, comprising:
at least one processor, wherein the at least one processor is configured to initiate and/or perform:
populating a registry with a plurality of content artifacts;
declaring, using the page development tool, a plurality of drop zones within the page;
receiving, within one of the plurality of drop zones and by a drag and drop operation, one of the content artifacts; and
performing, by the page development tool, an action on the received one of the content artifacts, wherein
each drop zone separately defines a type of page content and an action to undertake upon receiving a dragged and dropped one of the content artifacts. 28. The system of claim 27, wherein
the registry includes a content artifact explicitly expressed using a definitive expression including a control type and at least one parameter. 29. The system of claim 27, wherein
the registry includes an inferred content artifact. 30. The system of claim 27, wherein the populating includes:
extricating content from the page; inferring a content artifact from the extricated content along with corresponding artifact parameters; and populating the content artifact registry with the inferred content artifact. 31. The system of claim 27, wherein the at least one processor is further configured to initiate and/or perform:
defining a style for the drop zone; and highlighting, based upon a content artifact in the registry being selected having a type of page content consistent with the type of page content defined for the drop zone, the drop zone using the style. 32. The system of claim 31, wherein
the defining includes applying script layering to generate a connector between the drop zone and the selected one of the content artifacts. 33. A machine readable storage having stored therein a computer program for configuring a page within a page development tool, the computer program comprising a routine set of instructions which when executed by a machine cause the machine to perform:
populating a registry with a plurality of content artifacts; declaring, using the page development tool, a plurality of drop zones within the page; receiving, within one of the plurality of drop zones and by a drag and drop operation, one of the content artifacts; and performing, by the page development tool, an action on the received one of the content artifacts, wherein each drop zone separately defines a type of page content and an action to undertake upon receiving a dragged and dropped one of the content artifacts. 34. The machine readable storage of claim 33, wherein
the registry includes a content artifact explicitly expressed using a definitive expression including a control type and at least one parameter. 35. The machine readable storage of claim 33, wherein
the registry includes an inferred content artifact. 36. The machine readable storage of claim 33, wherein the populating includes:
extricating content from the page; inferring a content artifact from the extricated content along with corresponding artifact parameters; and populating the content artifact registry with the inferred content artifact. 37. The machine readable storage of claim 33, wherein the routine set of instructions further cause the machine to perform:
defining a style for the drop zone; and highlighting, based upon a content artifact in the registry being selected having a type of page content consistent with the type of page content defined for the drop zone, the drop zone using the style. 38. The machine readable storage of claim 37, wherein
the defining includes applying script layering to generate a connector between the drop zone and the selected one of the content artifacts. | 2,100 |
4,448 | 14,318,853 | 2,168 | A system includes reception of a request to modify the data of a database, the request including first data, execution of processing to fulfill the request, determination, during execution of the processing, that a validation exit is associated with a current state of the processing, storage of the first data in a local temporary table in response to the determination, passage of the local temporary table to the validation exit, and execution of the validation exit to validate the first data based on the local temporary table and on the data of the database. | 1. A system comprising:
a database storing data; and a processor to execute processor-executable process steps to cause the system to:
receive a request to modify the data, the request including first data;
execute processing to fulfill the request;
determine, during execution of the processing, that a validation exit is associated with a current state of the processing;
store the first data in a local temporary table in response to the determination;
pass the local temporary table to the validation exit; and
execute the validation exit to validate the first data based on the local temporary table and on the data of the database. 2. A system according to claim 1, wherein execution of the validation exit comprises:
execution of a join between the local temporary table and one or more tables of the database. 3. A system according to claim 2, wherein execution of the join comprises execution of the join by a native processing engine of the database. 4. A system according to claim 1, wherein the request conforms to Hypertext Transfer Protocol and to OData protocol. 5. A system according to claim 1, wherein determination that the validation exit is associated with a current state of the processing comprises determination of whether the validation exit is registered to the current state of the processing. 6. A system according to claim 1, wherein the processor is further to execute the processor-executable process steps to cause the system to:
determine, during execution of the processing, that a second validation exit is associated with a next state of the processing; pass the local temporary table to the second validation exit; and execute the second validation exit to validate the first data based on the local temporary table and on the data of the database. 7. A computer-implemented method comprising:
receiving a request to modify the data of a database, the request including first data; executing processing to fulfill the request; determining, during execution of the processing, that a validation exit is associated with a current state of the processing; storing the first data in a local temporary table in response to the determination; passing the local temporary table to the validation exit; and executing the validation exit to validate the first data based on the local temporary table and on the data of the database, wherein executing the validation exit comprises executing a join between the local temporary table and one or more tables of the database. 8. A computer-implemented method according to claim 7, wherein executing the join comprises executing the join by a native processing engine of the database. 9. A computer-implemented method according to claim 7, wherein the request conforms to Hypertext Transfer Protocol and to OData protocol. 10. A computer-implemented method according to claim 7, wherein determining that the validation exit is associated with a current state of the processing comprises determining that the validation exit is registered to the current state of the processing. 11. A computer-implemented method according to claim 7, further comprising:
determining, during execution of the processing, that a second validation exit is associated with a next state of the processing; passing the local temporary table to the second validation exit; and executing the second validation exit to validate the first data based on the local temporary table and on the data of the database. 12. A non-transitory computer-readable medium storing program code, the program code executable by a computer system to cause to the computer system to:
receive a request to modify the data of a database, the request including first data; execute processing to fulfill the request; determine, during execution of the processing, that a validation exit is associated with a current state of the processing; store the first data in a local temporary table in response to the determination; pass the local temporary table to the validation exit; and execute the validation exit to validate the first data based on the local temporary table and on the data of the database. 13. A medium according to claim 12, wherein execution of the validation exit comprises execution of a join between the local temporary table and one or more tables of the database. 14. A medium according to claim 13, wherein execution of the join comprises execution of the join by a native processing engine of the database. 15. A medium according to claim 12, wherein the request conforms to Hypertext Transfer Protocol and to OData protocol. 16. A medium according to claim 7, wherein determination that the validation exit is associated with a current state of the processing comprises determination of whether the validation exit is registered to the current state of the processing. 17. A medium according to claim 7, wherein the program code is further executable by the computer system to cause to the computer system to:
determine, during execution of the processing, that a second validation exit is associated with a next state of the processing; pass the local temporary table to the second validation exit; and execute the second validation exit to validate the first data based on the local temporary table and on the data of the database. | A system includes reception of a request to modify the data of a database, the request including first data, execution of processing to fulfill the request, determination, during execution of the processing, that a validation exit is associated with a current state of the processing, storage of the first data in a local temporary table in response to the determination, passage of the local temporary table to the validation exit, and execution of the validation exit to validate the first data based on the local temporary table and on the data of the database.1. A system comprising:
a database storing data; and a processor to execute processor-executable process steps to cause the system to:
receive a request to modify the data, the request including first data;
execute processing to fulfill the request;
determine, during execution of the processing, that a validation exit is associated with a current state of the processing;
store the first data in a local temporary table in response to the determination;
pass the local temporary table to the validation exit; and
execute the validation exit to validate the first data based on the local temporary table and on the data of the database. 2. A system according to claim 1, wherein execution of the validation exit comprises:
execution of a join between the local temporary table and one or more tables of the database. 3. A system according to claim 2, wherein execution of the join comprises execution of the join by a native processing engine of the database. 4. A system according to claim 1, wherein the request conforms to Hypertext Transfer Protocol and to OData protocol. 5. A system according to claim 1, wherein determination that the validation exit is associated with a current state of the processing comprises determination of whether the validation exit is registered to the current state of the processing. 6. A system according to claim 1, wherein the processor is further to execute the processor-executable process steps to cause the system to:
determine, during execution of the processing, that a second validation exit is associated with a next state of the processing; pass the local temporary table to the second validation exit; and execute the second validation exit to validate the first data based on the local temporary table and on the data of the database. 7. A computer-implemented method comprising:
receiving a request to modify the data of a database, the request including first data; executing processing to fulfill the request; determining, during execution of the processing, that a validation exit is associated with a current state of the processing; storing the first data in a local temporary table in response to the determination; passing the local temporary table to the validation exit; and executing the validation exit to validate the first data based on the local temporary table and on the data of the database, wherein executing the validation exit comprises executing a join between the local temporary table and one or more tables of the database. 8. A computer-implemented method according to claim 7, wherein executing the join comprises executing the join by a native processing engine of the database. 9. A computer-implemented method according to claim 7, wherein the request conforms to Hypertext Transfer Protocol and to OData protocol. 10. A computer-implemented method according to claim 7, wherein determining that the validation exit is associated with a current state of the processing comprises determining that the validation exit is registered to the current state of the processing. 11. A computer-implemented method according to claim 7, further comprising:
determining, during execution of the processing, that a second validation exit is associated with a next state of the processing; passing the local temporary table to the second validation exit; and executing the second validation exit to validate the first data based on the local temporary table and on the data of the database. 12. A non-transitory computer-readable medium storing program code, the program code executable by a computer system to cause to the computer system to:
receive a request to modify the data of a database, the request including first data; execute processing to fulfill the request; determine, during execution of the processing, that a validation exit is associated with a current state of the processing; store the first data in a local temporary table in response to the determination; pass the local temporary table to the validation exit; and execute the validation exit to validate the first data based on the local temporary table and on the data of the database. 13. A medium according to claim 12, wherein execution of the validation exit comprises execution of a join between the local temporary table and one or more tables of the database. 14. A medium according to claim 13, wherein execution of the join comprises execution of the join by a native processing engine of the database. 15. A medium according to claim 12, wherein the request conforms to Hypertext Transfer Protocol and to OData protocol. 16. A medium according to claim 7, wherein determination that the validation exit is associated with a current state of the processing comprises determination of whether the validation exit is registered to the current state of the processing. 17. A medium according to claim 7, wherein the program code is further executable by the computer system to cause to the computer system to:
determine, during execution of the processing, that a second validation exit is associated with a next state of the processing; pass the local temporary table to the second validation exit; and execute the second validation exit to validate the first data based on the local temporary table and on the data of the database. | 2,100 |
4,449 | 14,493,901 | 2,117 | A sensor for a contactless electrocardiographic measurement of a person includes an electrode formed of a moisture-permeable material and having a measurement surface and an opposite surface. A moisture generator supplies moisture to the opposite surface, and a moisture sensor detects a moisture content of a microclimate at the measurement surface. A controller receives signals from the moisture sensor and activates the moisture generator based upon the signals to control the moisture content. The moisture generator may be a heating element heating a source of moisture; a pump activated pumping liquid from a reservoir to the electrode; an ultrasonic atomizer for atomizing liquid contained in a reservoir; an actuator varying an amount of a liquid-conducting material in contact with liquid contained in a reservoir; or a Peltier element operable to warm and thereby release moisture from a moisture-storing material adjacent to the electrode. | 1. A contactless electrocardiographic sensor, comprising:
an electrode formed of a moisture-permeable material and having a measurement surface and an opposite surface; a moisture generator supplying moisture to the opposite surface; and a controller activating the moisture generator to increase a moisture content of a microclimate at the measurement surface. 2. The sensor of claim 1, further comprising:
a moisture sensor for detecting the moisture content, the controller activating the moisture generator based at least is part on signals received from the moisture sensor. 3. The sensor of claim 2, further comprising a temperature sensor, the controller activating the moisture generator based at least is part on signals received from the temperature sensor. 4. The sensor of claim 1, wherein the moisture generator comprises a heating element heating a source of moisture when activated by the controller. 5. The sensor of claim 4, wherein the source of moisture is a moisture-storing substance which emits moisture when heated. 6. The sensor of claim 1, wherein the moisture generator comprises a pump activated by the controller to pump liquid from a reservoir to the electrode. 7. The sensor of claim 1, wherein the moisture generator comprises an actuator activated by the controller to vary an amount of a liquid-conducting material in contact with liquid contained in a reservoir. 8. The sensor of claim 1, wherein the moisture generator comprises an ultrasonic atomizer for atomizing liquid contained in a reservoir. 9. The sensor of claim 1, wherein the moisture generator comprises a Peltier element operable to warm and thereby release moisture from a moisture-storing material adjacent to the electrode. 10. A contactless electrocardiographic sensor, comprising:
an electrode formed of a moisture-permeable material and having a measurement surface and an opposite surface; a moisture generator supplying moisture to the opposite surface; a moisture sensor for detecting a moisture content of a microclimate at the measurement surface; and a controller receiving signals from the moisture sensor and activating the moisture generator based upon the signals to control the moisture content. 11. A seat for a motor vehicle having a sensor array for contactless electrocardiographic measurement, the sensor array comprising:
an electrode mounted to the seat, formed of a moisture-permeable material, and having a measurement surface for registering a measurement signal and an opposite surface; a moisture generator supplying moisture to the opposite surface; and a controller activating the moisture generator to increase a moisture content of a microclimate at the measurement surface. 12. The seat of claim 11, further comprising:
a moisture sensor for detecting the moisture content, the controller activating the moisture generator based at least is part on signals received from the moisture sensor. 13. The seat of claim 11, further comprising a temperature sensor, the controller activating the moisture generator based at least is part on signals received from the temperature sensor. 14. The seat of claim 11, wherein the moisture generator comprises a heating element heating a source of moisture when activated by the controller. 15. The seat of claim 14, wherein the source of moisture is a moisture-storing substance which emits moisture when heated. 16. The seat of claim 11, wherein the moisture generator comprises a pump activated by the controller to pump liquid from a reservoir to the electrode. 17. The seat of claim 11, wherein the moisture generator comprises an actuator activated by the controller to vary an amount of a liquid-conducting material in contact with liquid contained in a reservoir. 18. The seat of claim 11, wherein the moisture generator comprises an ultrasonic atomizer for atomizing liquid contained in a reservoir. 19. The seat of claim 11, wherein the moisture generator comprises a Peltier element operable to warm and thereby release moisture from a moisture-storing material adjacent to the electrode. 20. The seat of claim 11, wherein the moisture generator comprises a device for pressing a compressible material against the opposite surface of the electrode to release liquid stored in the compressible material. | A sensor for a contactless electrocardiographic measurement of a person includes an electrode formed of a moisture-permeable material and having a measurement surface and an opposite surface. A moisture generator supplies moisture to the opposite surface, and a moisture sensor detects a moisture content of a microclimate at the measurement surface. A controller receives signals from the moisture sensor and activates the moisture generator based upon the signals to control the moisture content. The moisture generator may be a heating element heating a source of moisture; a pump activated pumping liquid from a reservoir to the electrode; an ultrasonic atomizer for atomizing liquid contained in a reservoir; an actuator varying an amount of a liquid-conducting material in contact with liquid contained in a reservoir; or a Peltier element operable to warm and thereby release moisture from a moisture-storing material adjacent to the electrode.1. A contactless electrocardiographic sensor, comprising:
an electrode formed of a moisture-permeable material and having a measurement surface and an opposite surface; a moisture generator supplying moisture to the opposite surface; and a controller activating the moisture generator to increase a moisture content of a microclimate at the measurement surface. 2. The sensor of claim 1, further comprising:
a moisture sensor for detecting the moisture content, the controller activating the moisture generator based at least is part on signals received from the moisture sensor. 3. The sensor of claim 2, further comprising a temperature sensor, the controller activating the moisture generator based at least is part on signals received from the temperature sensor. 4. The sensor of claim 1, wherein the moisture generator comprises a heating element heating a source of moisture when activated by the controller. 5. The sensor of claim 4, wherein the source of moisture is a moisture-storing substance which emits moisture when heated. 6. The sensor of claim 1, wherein the moisture generator comprises a pump activated by the controller to pump liquid from a reservoir to the electrode. 7. The sensor of claim 1, wherein the moisture generator comprises an actuator activated by the controller to vary an amount of a liquid-conducting material in contact with liquid contained in a reservoir. 8. The sensor of claim 1, wherein the moisture generator comprises an ultrasonic atomizer for atomizing liquid contained in a reservoir. 9. The sensor of claim 1, wherein the moisture generator comprises a Peltier element operable to warm and thereby release moisture from a moisture-storing material adjacent to the electrode. 10. A contactless electrocardiographic sensor, comprising:
an electrode formed of a moisture-permeable material and having a measurement surface and an opposite surface; a moisture generator supplying moisture to the opposite surface; a moisture sensor for detecting a moisture content of a microclimate at the measurement surface; and a controller receiving signals from the moisture sensor and activating the moisture generator based upon the signals to control the moisture content. 11. A seat for a motor vehicle having a sensor array for contactless electrocardiographic measurement, the sensor array comprising:
an electrode mounted to the seat, formed of a moisture-permeable material, and having a measurement surface for registering a measurement signal and an opposite surface; a moisture generator supplying moisture to the opposite surface; and a controller activating the moisture generator to increase a moisture content of a microclimate at the measurement surface. 12. The seat of claim 11, further comprising:
a moisture sensor for detecting the moisture content, the controller activating the moisture generator based at least is part on signals received from the moisture sensor. 13. The seat of claim 11, further comprising a temperature sensor, the controller activating the moisture generator based at least is part on signals received from the temperature sensor. 14. The seat of claim 11, wherein the moisture generator comprises a heating element heating a source of moisture when activated by the controller. 15. The seat of claim 14, wherein the source of moisture is a moisture-storing substance which emits moisture when heated. 16. The seat of claim 11, wherein the moisture generator comprises a pump activated by the controller to pump liquid from a reservoir to the electrode. 17. The seat of claim 11, wherein the moisture generator comprises an actuator activated by the controller to vary an amount of a liquid-conducting material in contact with liquid contained in a reservoir. 18. The seat of claim 11, wherein the moisture generator comprises an ultrasonic atomizer for atomizing liquid contained in a reservoir. 19. The seat of claim 11, wherein the moisture generator comprises a Peltier element operable to warm and thereby release moisture from a moisture-storing material adjacent to the electrode. 20. The seat of claim 11, wherein the moisture generator comprises a device for pressing a compressible material against the opposite surface of the electrode to release liquid stored in the compressible material. | 2,100 |
4,450 | 14,010,275 | 2,199 | Embodiments presented herein techniques for balancing a multidimensional set of resources of different types within a distributed resources system. Each host computer providing the resources publishes a status on current resource usage by guest clients. Upon identifying a local imbalance, the host computer determines a source workload to migrate to or from the resources container to minimize the variance in resource usage. Additionally, when placing a new resource workload, the host computer selects a resources container that minimizes the variance to further balance resource usage. | 1. A method for distributing a storage object having a workload to a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the method comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system; identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types; determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and placing the set of distributed resources in one of at least one candidate resource container that minimizes the expected variance increase over the original variance. 2. The method of claim 1, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 3. The method of claim 2, wherein each node publishes the resource usage status to other nodes in the software-defined storage area network. 4. The method of claim 1, wherein the one of at least one candidate resource container with the expected variance being lower than the original variance is selected at random. 5. The method of claim 1, further comprising, publishing the status of resource usage in the placed candidate resource container to each node. 6. The method of claim 1, wherein identifying one or more candidate resources based on the statuses further comprises:
measuring the workload by resource type; and determining the candidate resource containers capable of storing the workload based on the measurements and the resource usage statuses of each of the resource containers. 7. A non-transitory computer readable storage medium storing instructions, which, when executed on a processor, performs an operation for distributing a storage object having a workload to a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the operation comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system; identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types; determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and placing the set of distributed resources in one of at least one candidate resource container that minimizes the expected variance increase over the original variance. 8. The computer readable storage medium of claim 7, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 9. The computer readable storage medium of claim 8, wherein each node publishes the resource usage status to other nodes in the software-defined storage area network. 10. The computer readable storage medium of claim 7, wherein the one of at least one candidate resource container with the expected variance being lower than the original variance is selected at random. 11. The computer readable storage medium of claim 7, wherein the operation further comprises, publishing the status of resource usage in the placed candidate resource container to each node. 12. The computer readable storage medium of claim 7, wherein identifying one or more candidate resources based on the statuses further comprises:
measuring the workload by resource type; and determining the candidate resource containers capable of storing the workload based on the measurements and the resource usage statuses of each of the resource containers. 13. A system, comprising:
a processor and a memory hosting an application, which, when executed on the processor, performs an operation for distributing a storage object having a workload to a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the operation comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system;
identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types;
determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and
placing the set of distributed resources in one of at least one candidate resource container that minimizes the expected variance increase over the original variance. 14. The system of claim 13, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 15. The system of claim 13, wherein the one of at least one candidate resource container with the expected variance being lower than the original variance is selected at random. 16. The system of claim 13, wherein the operation further comprises, publishing the status of resource usage in the placed candidate resource container to each node. 17. The system of claim 13, wherein identifying one or more candidate resources based on the statuses further comprises:
measuring the workload by resource type; and determining the candidate resource containers capable of storing the workload based on the measurements and the resource usage statuses of each of the resource containers. 18. A method for rebalancing a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the method comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system; identifying a source object component causing an imbalance of the resource usage in a first one of the resource containers; identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types; determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and relocating the source object component to one of the one or more of the candidate resource containers that reduces the original variance based on the expected variance. 19. The method of claim 18, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 20. The method of claim 18, wherein each node publishes the resource usage status to other nodes in the software-defined storage area network. | Embodiments presented herein techniques for balancing a multidimensional set of resources of different types within a distributed resources system. Each host computer providing the resources publishes a status on current resource usage by guest clients. Upon identifying a local imbalance, the host computer determines a source workload to migrate to or from the resources container to minimize the variance in resource usage. Additionally, when placing a new resource workload, the host computer selects a resources container that minimizes the variance to further balance resource usage.1. A method for distributing a storage object having a workload to a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the method comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system; identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types; determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and placing the set of distributed resources in one of at least one candidate resource container that minimizes the expected variance increase over the original variance. 2. The method of claim 1, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 3. The method of claim 2, wherein each node publishes the resource usage status to other nodes in the software-defined storage area network. 4. The method of claim 1, wherein the one of at least one candidate resource container with the expected variance being lower than the original variance is selected at random. 5. The method of claim 1, further comprising, publishing the status of resource usage in the placed candidate resource container to each node. 6. The method of claim 1, wherein identifying one or more candidate resources based on the statuses further comprises:
measuring the workload by resource type; and determining the candidate resource containers capable of storing the workload based on the measurements and the resource usage statuses of each of the resource containers. 7. A non-transitory computer readable storage medium storing instructions, which, when executed on a processor, performs an operation for distributing a storage object having a workload to a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the operation comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system; identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types; determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and placing the set of distributed resources in one of at least one candidate resource container that minimizes the expected variance increase over the original variance. 8. The computer readable storage medium of claim 7, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 9. The computer readable storage medium of claim 8, wherein each node publishes the resource usage status to other nodes in the software-defined storage area network. 10. The computer readable storage medium of claim 7, wherein the one of at least one candidate resource container with the expected variance being lower than the original variance is selected at random. 11. The computer readable storage medium of claim 7, wherein the operation further comprises, publishing the status of resource usage in the placed candidate resource container to each node. 12. The computer readable storage medium of claim 7, wherein identifying one or more candidate resources based on the statuses further comprises:
measuring the workload by resource type; and determining the candidate resource containers capable of storing the workload based on the measurements and the resource usage statuses of each of the resource containers. 13. A system, comprising:
a processor and a memory hosting an application, which, when executed on the processor, performs an operation for distributing a storage object having a workload to a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the operation comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system;
identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types;
determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and
placing the set of distributed resources in one of at least one candidate resource container that minimizes the expected variance increase over the original variance. 14. The system of claim 13, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 15. The system of claim 13, wherein the one of at least one candidate resource container with the expected variance being lower than the original variance is selected at random. 16. The system of claim 13, wherein the operation further comprises, publishing the status of resource usage in the placed candidate resource container to each node. 17. The system of claim 13, wherein identifying one or more candidate resources based on the statuses further comprises:
measuring the workload by resource type; and determining the candidate resource containers capable of storing the workload based on the measurements and the resource usage statuses of each of the resource containers. 18. A method for rebalancing a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system, the method comprising:
retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system; identifying a source object component causing an imbalance of the resource usage in a first one of the resource containers; identifying one or more candidate resource containers within each node based on the statuses, wherein each candidate resource container has an original variance among the resource usage of the plurality of resource types; determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container; and relocating the source object component to one of the one or more of the candidate resource containers that reduces the original variance based on the expected variance. 19. The method of claim 18, wherein the distributed resources system is a software-defined storage area network, wherein the resource containers are groups of storage disks residing in each node, and wherein the workload corresponds to a virtual machine storage workload. 20. The method of claim 18, wherein each node publishes the resource usage status to other nodes in the software-defined storage area network. | 2,100 |
4,451 | 13,135,555 | 2,178 | Image data for a preview image corresponding to a plurality of pages of a document is generated in each page. Display of the preview image based on the image data that has been generated is initiated, before the image data generation for the preview images in all pages is completed. The preview image is promptly displayed without keeping a user waiting until the image data generation for the image previews in all pages corresponding to the plurality of pages of the document is completed. | 1. A display apparatus for generating image data in each page for preview image corresponding to output data of a plurality of pages and displaying a preview image based on the image data, comprising:
an image display section for initiating display of the preview image based on already generated image data before image data generation in all pages is completed. 2. The display apparatus, according to claim 1, wherein the image display section displays the preview image based on the image data whenever each image data is generated. 3. The display apparatus, according to claim 1, wherein the image display section displays a plurality of preview images based on a plurality of image data whenever the plurality of image data is generated. 4. The display apparatus, according to claim 1, wherein the preview image is displayed in a form of a display pane surrounding the preview image, and the image display section displays information of display processing inside the display pane prior to display of the preview image. 5. A display method for generating image data for preview image corresponding to output data of a plurality of pages and displaying a preview image based on the image data, comprising steps of:
generating the image data in each page; judging whether image data generation in each page is completed or not; and displaying the preview image based on the image data whenever each image data is generated, according to the judgment result in the judging step. 6. A display method for generating image data for preview image corresponding to output data of a plurality of pages and displaying a preview image based on the image data, comprising steps of:
generating the image data in each page; judging whether image data generation in each plurality of pages is completed or not; and displaying a plurality of preview images based on a plurality of image data whenever the plurality of image data is generated, according to the judgment result in the judging step. 7. A non-transitory recording medium recording a computer program for causing a computer to generate image data for preview image corresponding to output data of a plurality of pages and display a preview image based on the image data, said computer program comprising steps of:
causing the computer to generate the image data in each page; causing the computer to judge whether image data generation in each page is completed or not; and causing the computer to display the preview image based on the image data whenever each image data is generated, according to the judging result in the judging step. 8. A non-transitory recording medium recording a computer program for causing a computer to generate image data for preview image corresponding to output data of a plurality of pages and display a preview image based on the image data, said computer program comprising steps of:
causing the computer to generate the image data in each page; causing the computer to judge whether image data generation in each plurality of pages is completed or not; and causing the computer to display a plurality of preview images based on a plurality of image data whenever the plurality of image data is generated, according to the judgment result in the judging step. | Image data for a preview image corresponding to a plurality of pages of a document is generated in each page. Display of the preview image based on the image data that has been generated is initiated, before the image data generation for the preview images in all pages is completed. The preview image is promptly displayed without keeping a user waiting until the image data generation for the image previews in all pages corresponding to the plurality of pages of the document is completed.1. A display apparatus for generating image data in each page for preview image corresponding to output data of a plurality of pages and displaying a preview image based on the image data, comprising:
an image display section for initiating display of the preview image based on already generated image data before image data generation in all pages is completed. 2. The display apparatus, according to claim 1, wherein the image display section displays the preview image based on the image data whenever each image data is generated. 3. The display apparatus, according to claim 1, wherein the image display section displays a plurality of preview images based on a plurality of image data whenever the plurality of image data is generated. 4. The display apparatus, according to claim 1, wherein the preview image is displayed in a form of a display pane surrounding the preview image, and the image display section displays information of display processing inside the display pane prior to display of the preview image. 5. A display method for generating image data for preview image corresponding to output data of a plurality of pages and displaying a preview image based on the image data, comprising steps of:
generating the image data in each page; judging whether image data generation in each page is completed or not; and displaying the preview image based on the image data whenever each image data is generated, according to the judgment result in the judging step. 6. A display method for generating image data for preview image corresponding to output data of a plurality of pages and displaying a preview image based on the image data, comprising steps of:
generating the image data in each page; judging whether image data generation in each plurality of pages is completed or not; and displaying a plurality of preview images based on a plurality of image data whenever the plurality of image data is generated, according to the judgment result in the judging step. 7. A non-transitory recording medium recording a computer program for causing a computer to generate image data for preview image corresponding to output data of a plurality of pages and display a preview image based on the image data, said computer program comprising steps of:
causing the computer to generate the image data in each page; causing the computer to judge whether image data generation in each page is completed or not; and causing the computer to display the preview image based on the image data whenever each image data is generated, according to the judging result in the judging step. 8. A non-transitory recording medium recording a computer program for causing a computer to generate image data for preview image corresponding to output data of a plurality of pages and display a preview image based on the image data, said computer program comprising steps of:
causing the computer to generate the image data in each page; causing the computer to judge whether image data generation in each plurality of pages is completed or not; and causing the computer to display a plurality of preview images based on a plurality of image data whenever the plurality of image data is generated, according to the judgment result in the judging step. | 2,100 |
4,452 | 14,371,289 | 2,191 | When a content acquisition unit acquires a part of full-size application software, an installation processing unit installs the acquired part, and an execution unit sets the installed application software to be executable. While the execution unit is executing the application software, the content acquisition unit continues to download the application software. A display processing unit changes a display mode of an icon image differently when a part of the application software is installed and when the application software is installed in its entirety. | 1. An information processing system provided with a server for storing application software and with an information processing apparatus for downloading application software from the server,
wherein the information processing apparatus comprises: an acquisition unit configured to download application software; a display processing unit configured to display an icon image of the downloaded application software; an input unit configured to receive an operation of selecting an icon image; and an execution unit configured to execute the application software, wherein the display processing unit displays a first icon image that occurs when the application software is executable while the application software has been downloaded in its entirety and a second icon image that occurs when the application software is executable while a part of the application software has been downloaded, each in a different display mode, and wherein, when the input unit receives an operation of selecting the second icon image, the execution unit executes the application software. 2. The information processing system according to claim 1,
wherein the information processing apparatus comprises: an installation processing unit configured to install the downloaded application software, and wherein, when the acquisition unit acquires a part of the full-size application software, the installation processing unit installs the part of the application software, and when the input unit receives the operation of selecting the second icon image, the execution unit executes the installed application software. 3. The information processing system according to claim 2, wherein the acquisition unit continues to download the application software while the execution unit is executing the installed application software. 4. The information processing system according to claim 3,
wherein the server comprises: a retention unit configured to store the application software as a first file for executing the part of the application and as a second file for executing at least the rest of the entirety of the application; a reception unit configured to receive a request for downloading the application software; and a transmission processing unit configured to transmit the application software to the information processing apparatus when the reception unit receives the request for downloading, wherein the transmission processing unit first transmits the first file and then transmits the second file after completing the transmission of the first file. 5. The information processing system according to claim 4, wherein the installation processing unit installs the first file after the acquisition unit acquires the first file. 6. An information processing apparatus for downloading application software from a server for storing application software, comprising:
an acquisition unit configured to download application software; a display processing unit configured to display an icon image of the downloaded application software; an input unit configured to receive an operation of selecting an icon image; and an execution unit configured to execute the application software, wherein the display processing unit displays a first icon image that occurs when the application software is executable while the application software has been downloaded in its entirety and a second icon image that occurs when the application software is executable while a part of the application software has been downloaded, each in a different display mode, and wherein, when the input unit receives an operation of selecting the second icon image, the execution unit executes the application software. 7. A program embedded in a non-transitory computer readable recording medium, comprising:
a module configured to download application software from a server; a module configured to display an icon image of the downloaded application software; a module configured to receive an operation of selecting an icon image; and a module configured to execute the application software, wherein the module configured to display an icon image has a submodule configured to display a first icon image that occurs when the application software is executable while the application software has been downloaded in its entirety and a second icon image that occurs when the application software is executable while a part of the application software has been downloaded, each in a different display mode, and wherein, when the module configured to receive an operation of selecting an icon image receives an operation of selecting the second icon image, the module configured to execute the application software executes the application software. 8. A non-transitory computer-readable recording medium having embodied thereon the program according to claim 7. 9. A server comprising:
a retention unit configured to store application software as a first file for executing a part of an application and as a second file for executing at least the rest of the entirety of the application; a reception unit configured to receive, from an information processing apparatus, a request for downloading the application software; and a transmission processing unit configured to transmit the application software to the information processing apparatus when the reception unit receives the request for downloading, wherein the transmission processing unit first transmits the first file and then transmits the second file after completing the transmission of the first file. 10. The server according to claim 9 wherein the second file is a file for executing the entirety of the application software. 11. The server according to claim 9 wherein the second file is a file other than the first file constituting the application software. | When a content acquisition unit acquires a part of full-size application software, an installation processing unit installs the acquired part, and an execution unit sets the installed application software to be executable. While the execution unit is executing the application software, the content acquisition unit continues to download the application software. A display processing unit changes a display mode of an icon image differently when a part of the application software is installed and when the application software is installed in its entirety.1. An information processing system provided with a server for storing application software and with an information processing apparatus for downloading application software from the server,
wherein the information processing apparatus comprises: an acquisition unit configured to download application software; a display processing unit configured to display an icon image of the downloaded application software; an input unit configured to receive an operation of selecting an icon image; and an execution unit configured to execute the application software, wherein the display processing unit displays a first icon image that occurs when the application software is executable while the application software has been downloaded in its entirety and a second icon image that occurs when the application software is executable while a part of the application software has been downloaded, each in a different display mode, and wherein, when the input unit receives an operation of selecting the second icon image, the execution unit executes the application software. 2. The information processing system according to claim 1,
wherein the information processing apparatus comprises: an installation processing unit configured to install the downloaded application software, and wherein, when the acquisition unit acquires a part of the full-size application software, the installation processing unit installs the part of the application software, and when the input unit receives the operation of selecting the second icon image, the execution unit executes the installed application software. 3. The information processing system according to claim 2, wherein the acquisition unit continues to download the application software while the execution unit is executing the installed application software. 4. The information processing system according to claim 3,
wherein the server comprises: a retention unit configured to store the application software as a first file for executing the part of the application and as a second file for executing at least the rest of the entirety of the application; a reception unit configured to receive a request for downloading the application software; and a transmission processing unit configured to transmit the application software to the information processing apparatus when the reception unit receives the request for downloading, wherein the transmission processing unit first transmits the first file and then transmits the second file after completing the transmission of the first file. 5. The information processing system according to claim 4, wherein the installation processing unit installs the first file after the acquisition unit acquires the first file. 6. An information processing apparatus for downloading application software from a server for storing application software, comprising:
an acquisition unit configured to download application software; a display processing unit configured to display an icon image of the downloaded application software; an input unit configured to receive an operation of selecting an icon image; and an execution unit configured to execute the application software, wherein the display processing unit displays a first icon image that occurs when the application software is executable while the application software has been downloaded in its entirety and a second icon image that occurs when the application software is executable while a part of the application software has been downloaded, each in a different display mode, and wherein, when the input unit receives an operation of selecting the second icon image, the execution unit executes the application software. 7. A program embedded in a non-transitory computer readable recording medium, comprising:
a module configured to download application software from a server; a module configured to display an icon image of the downloaded application software; a module configured to receive an operation of selecting an icon image; and a module configured to execute the application software, wherein the module configured to display an icon image has a submodule configured to display a first icon image that occurs when the application software is executable while the application software has been downloaded in its entirety and a second icon image that occurs when the application software is executable while a part of the application software has been downloaded, each in a different display mode, and wherein, when the module configured to receive an operation of selecting an icon image receives an operation of selecting the second icon image, the module configured to execute the application software executes the application software. 8. A non-transitory computer-readable recording medium having embodied thereon the program according to claim 7. 9. A server comprising:
a retention unit configured to store application software as a first file for executing a part of an application and as a second file for executing at least the rest of the entirety of the application; a reception unit configured to receive, from an information processing apparatus, a request for downloading the application software; and a transmission processing unit configured to transmit the application software to the information processing apparatus when the reception unit receives the request for downloading, wherein the transmission processing unit first transmits the first file and then transmits the second file after completing the transmission of the first file. 10. The server according to claim 9 wherein the second file is a file for executing the entirety of the application software. 11. The server according to claim 9 wherein the second file is a file other than the first file constituting the application software. | 2,100 |
4,453 | 14,868,184 | 2,113 | If an event management system or component within an event management system fails, events generated by systems and applications monitored by the event management system may not be processed or analyzed. As a result, the performance and health of the systems and applications may be unknown. To reduce the impact of a failure, an event management system can include at least two event managers: a primary event manager and one or more standby event managers. The standby event managers are configured to handle event processing tasks upon a failure of the primary event manager. To be prepared for a failure of the primary event manager, the standby event manager receives state data and copies of events. After determining that the primary event manager has failed, the standby event manager can begin processing events. | 1. A method comprising:
receiving, by both a first event manager and a second event manager, a first batch of events from a communication bus, wherein the communication bus received events, that include the first batch of events, from a plurality of components of a network; communicating, by the first event manager to the second event manager, first state data that at least indicates state of processing of the first batch of events by the first event manager; after communication of the first state data from the first event manager to the second event manager,
the first event manager discarding the first batch of events;
without processing the first batch of events, the second event manager discarding the first batch of events; and
receiving, by both the first event manager and the second event manager, a second batch of events from the communication bus;
determining, by the second event manager, that the first event manager is not operational; and in response to determining that the first event manager is not operational,
processing, by the second event manager, the second batch of events based, at least in part, on the first state data; and
updating, by the second event manager, the first state data based, at least in part, on processing the second batch of events. 2. The method of claim 1, wherein receiving, by both the first event manager and the second event manager, the first batch of events from the communication bus comprises:
requesting, by the first event manager, the first batch of the events from the communication bus; communicating, by the first event manager to the second event manager, a notification that the first batch of events should be requested from the communication bus; and in response to receiving the notification that the first batch of events should be requested, requesting, by the second event manager, the first batch of events from the communication bus; wherein receiving, by both the first event manager and the second event manager, the first batch of the events is in response to the requests, by both the first event manager and the second event manager, for the first batch of events. 3. The method of claim 1, wherein the communication bus sends the first batch of events to the second event manager in response to a request for the first batch of events from the first event manager. 4. The method of claim 1 further comprising:
determining, by the second event manager, that the first event manager is operational; and
in response to determining that the first event manager is operational, sending, by the second event manager, the updated first state data to the first event manager. 5. The method of claim 4, wherein determining that the first event manager is not operational comprises receiving a notification that the first event manager is not operational, wherein determining that the first event manager is operational comprises receiving a notification that the first event manager is operational. 6. The method of claim 1 further comprising:
determining, by a monitoring component, that the performance of the first event manager meets a criterion; and
in response to determining that the performance of the first event manager meets the criterion, indicating that the first event manager is not operational. 7. The method of claim 6, wherein the second event manager is the monitoring component. 8. The method of claim 1 further comprising:
receiving, by the second event manager, second state data, wherein the second state data is generated by the first event manager based, at least in part, on the first event manager processing a subset of the second batch of events; and
in response to determining that the first event manager is not operational,
identifying, by the second event manager, a set of unprocessed events and a set of processed events based, at least in part, on second state data, wherein the second batch of events comprises the set of unprocessed events and the set of processed events, wherein the set of processed events corresponds to the subset of the second batch of events;
wherein processing the second batch of events comprises processing the set of unprocessed events and not processing the set of processed events. 9. The method of claim 8, wherein identifying the set of processed events comprises comparing a plurality of event identifiers of the second batch of events to a plurality of event identifiers that comprise the second state data. 10. The method of claim 1 further comprising performing an initial synchronization of state data between the first event manager and the second event manager. 11. One or more machine-readable storage media having program code for a first event manager stored therein, the program code comprising instructions to:
receive a first batch of events from a communication bus, wherein the communication bus received events, that include the first batch of events, from a plurality of components of a network, wherein the first batch of events are also received by a second event manager; receive first state data from the second event manager that at least indicates state of processing of the first batch of events by the second event manager; after receipt of the first state data from the second event manager,
without processing the first batch of events, discard the first batch of events; and
receive a second batch of events from the communication bus;
determine that the second event manager is not operational; and in response to a determination that the second event manager is not operational,
process the second batch of events based, at least in part, on the first state data; and
update the first state data based, at least in part, on processing the second batch of events. 12. The machine-readable storage media of claim 11, wherein the instructions to receive the first batch of events from the communication bus comprise instructions to:
receive a notification from the second event manager that the first batch of events should be requested from the communication bus; and in response to receipt of the notification that the first batch of events should be requested, request the first batch of events from the communication bus; wherein the instructions to receive the first batch of events comprise instructions to receive the first batch of events in response to the request for the first batch of events. 13. An apparatus comprising:
a processor; and a machine-readable medium having program code executable by the processor to cause the apparatus to:
receive a first batch of events from a communication bus, wherein the communication bus received events, that include the first batch of events, from a plurality of components of a network, wherein the first batch of events are also received by an event manager;
receive first state data from the event manager that at least indicates state of processing of the first batch of events by the event manager;
after receipt of the first state data from the event manager,
without processing the first batch of events, discard the first batch of events; and
receive a second batch of events from the communication bus;
determine that the event manager is not operational; and
in response to a determination that the event manager is not operational,
process the second batch of events based, at least in part, on the first state data; and
update the first state data based, at least in part, on processing the second batch of events. 14. The apparatus of claim 13, wherein the program code executable by the processor to cause the apparatus to receive the first batch of events from the communication bus comprises program code executable by the processor to cause the apparatus to:
receive a notification that the first batch of events should be requested from the communication bus; and in response to receipt of the notification that the first batch of events should be requested from the communication bus, request the first batch of events; wherein the program code executable by the processor to cause the apparatus to receive the first batch of events comprises program code executable by the processor to cause the apparatus to receive the first batch of events in response to the request for the first batch of events. 15. The apparatus of claim 13, wherein the communication bus sends the first batch of events in response to a request for the first batch of events from the event manager. 16. The apparatus of claim 13 further comprising program code executable by the processor to cause the apparatus to:
determine that the event manager is operational; and
in response to a determination that the event manager is operational,
send the updated first state data to the event manager. 17. The apparatus of claim 16, wherein the program code executable by the processor to cause the apparatus to determine that the event manager is not operational comprises program code executable by the processor to cause the apparatus to receive a notification that the event manager is not operational, wherein the program code executable by the processor to cause the apparatus to determine that the event manager is operational comprises program code executable by the processor to cause the apparatus to receive a notification that the event manager is operational. 18. The apparatus of claim 13 further comprising program code executable by the processor to cause the apparatus to:
determine that the performance of the event manager meets a criterion; and
in response to a determination that the performance of the event manager meets the criterion, indicate that the event manager is not operational. 19. The apparatus of claim 13 further comprising program code executable by the processor to cause the apparatus to:
receive second state data, wherein the second state data is generated by the event manager based, at least in part, on the event manager processing a subset of the second batch of events; and
in response to a determination that the event manager is not operational,
identify a set of unprocessed events and a set of processed events based, at least in part, on second state data, wherein the second batch of events comprises the set of unprocessed events and the set of processed events, wherein the set of processed events corresponds to the subset of the second batch of events;
wherein the program code executable by the processor to cause the apparatus to process the second batch of events comprises program code executable by the processor to cause the apparatus to process the set of unprocessed events and not process the set of processed events. 20. The apparatus of claim 19, wherein the program code executable by the processor to cause the apparatus to identify the set of processed events comprises comparing a plurality of event identifiers of the second batch of events to a plurality of event identifiers that comprise the second state data. | If an event management system or component within an event management system fails, events generated by systems and applications monitored by the event management system may not be processed or analyzed. As a result, the performance and health of the systems and applications may be unknown. To reduce the impact of a failure, an event management system can include at least two event managers: a primary event manager and one or more standby event managers. The standby event managers are configured to handle event processing tasks upon a failure of the primary event manager. To be prepared for a failure of the primary event manager, the standby event manager receives state data and copies of events. After determining that the primary event manager has failed, the standby event manager can begin processing events.1. A method comprising:
receiving, by both a first event manager and a second event manager, a first batch of events from a communication bus, wherein the communication bus received events, that include the first batch of events, from a plurality of components of a network; communicating, by the first event manager to the second event manager, first state data that at least indicates state of processing of the first batch of events by the first event manager; after communication of the first state data from the first event manager to the second event manager,
the first event manager discarding the first batch of events;
without processing the first batch of events, the second event manager discarding the first batch of events; and
receiving, by both the first event manager and the second event manager, a second batch of events from the communication bus;
determining, by the second event manager, that the first event manager is not operational; and in response to determining that the first event manager is not operational,
processing, by the second event manager, the second batch of events based, at least in part, on the first state data; and
updating, by the second event manager, the first state data based, at least in part, on processing the second batch of events. 2. The method of claim 1, wherein receiving, by both the first event manager and the second event manager, the first batch of events from the communication bus comprises:
requesting, by the first event manager, the first batch of the events from the communication bus; communicating, by the first event manager to the second event manager, a notification that the first batch of events should be requested from the communication bus; and in response to receiving the notification that the first batch of events should be requested, requesting, by the second event manager, the first batch of events from the communication bus; wherein receiving, by both the first event manager and the second event manager, the first batch of the events is in response to the requests, by both the first event manager and the second event manager, for the first batch of events. 3. The method of claim 1, wherein the communication bus sends the first batch of events to the second event manager in response to a request for the first batch of events from the first event manager. 4. The method of claim 1 further comprising:
determining, by the second event manager, that the first event manager is operational; and
in response to determining that the first event manager is operational, sending, by the second event manager, the updated first state data to the first event manager. 5. The method of claim 4, wherein determining that the first event manager is not operational comprises receiving a notification that the first event manager is not operational, wherein determining that the first event manager is operational comprises receiving a notification that the first event manager is operational. 6. The method of claim 1 further comprising:
determining, by a monitoring component, that the performance of the first event manager meets a criterion; and
in response to determining that the performance of the first event manager meets the criterion, indicating that the first event manager is not operational. 7. The method of claim 6, wherein the second event manager is the monitoring component. 8. The method of claim 1 further comprising:
receiving, by the second event manager, second state data, wherein the second state data is generated by the first event manager based, at least in part, on the first event manager processing a subset of the second batch of events; and
in response to determining that the first event manager is not operational,
identifying, by the second event manager, a set of unprocessed events and a set of processed events based, at least in part, on second state data, wherein the second batch of events comprises the set of unprocessed events and the set of processed events, wherein the set of processed events corresponds to the subset of the second batch of events;
wherein processing the second batch of events comprises processing the set of unprocessed events and not processing the set of processed events. 9. The method of claim 8, wherein identifying the set of processed events comprises comparing a plurality of event identifiers of the second batch of events to a plurality of event identifiers that comprise the second state data. 10. The method of claim 1 further comprising performing an initial synchronization of state data between the first event manager and the second event manager. 11. One or more machine-readable storage media having program code for a first event manager stored therein, the program code comprising instructions to:
receive a first batch of events from a communication bus, wherein the communication bus received events, that include the first batch of events, from a plurality of components of a network, wherein the first batch of events are also received by a second event manager; receive first state data from the second event manager that at least indicates state of processing of the first batch of events by the second event manager; after receipt of the first state data from the second event manager,
without processing the first batch of events, discard the first batch of events; and
receive a second batch of events from the communication bus;
determine that the second event manager is not operational; and in response to a determination that the second event manager is not operational,
process the second batch of events based, at least in part, on the first state data; and
update the first state data based, at least in part, on processing the second batch of events. 12. The machine-readable storage media of claim 11, wherein the instructions to receive the first batch of events from the communication bus comprise instructions to:
receive a notification from the second event manager that the first batch of events should be requested from the communication bus; and in response to receipt of the notification that the first batch of events should be requested, request the first batch of events from the communication bus; wherein the instructions to receive the first batch of events comprise instructions to receive the first batch of events in response to the request for the first batch of events. 13. An apparatus comprising:
a processor; and a machine-readable medium having program code executable by the processor to cause the apparatus to:
receive a first batch of events from a communication bus, wherein the communication bus received events, that include the first batch of events, from a plurality of components of a network, wherein the first batch of events are also received by an event manager;
receive first state data from the event manager that at least indicates state of processing of the first batch of events by the event manager;
after receipt of the first state data from the event manager,
without processing the first batch of events, discard the first batch of events; and
receive a second batch of events from the communication bus;
determine that the event manager is not operational; and
in response to a determination that the event manager is not operational,
process the second batch of events based, at least in part, on the first state data; and
update the first state data based, at least in part, on processing the second batch of events. 14. The apparatus of claim 13, wherein the program code executable by the processor to cause the apparatus to receive the first batch of events from the communication bus comprises program code executable by the processor to cause the apparatus to:
receive a notification that the first batch of events should be requested from the communication bus; and in response to receipt of the notification that the first batch of events should be requested from the communication bus, request the first batch of events; wherein the program code executable by the processor to cause the apparatus to receive the first batch of events comprises program code executable by the processor to cause the apparatus to receive the first batch of events in response to the request for the first batch of events. 15. The apparatus of claim 13, wherein the communication bus sends the first batch of events in response to a request for the first batch of events from the event manager. 16. The apparatus of claim 13 further comprising program code executable by the processor to cause the apparatus to:
determine that the event manager is operational; and
in response to a determination that the event manager is operational,
send the updated first state data to the event manager. 17. The apparatus of claim 16, wherein the program code executable by the processor to cause the apparatus to determine that the event manager is not operational comprises program code executable by the processor to cause the apparatus to receive a notification that the event manager is not operational, wherein the program code executable by the processor to cause the apparatus to determine that the event manager is operational comprises program code executable by the processor to cause the apparatus to receive a notification that the event manager is operational. 18. The apparatus of claim 13 further comprising program code executable by the processor to cause the apparatus to:
determine that the performance of the event manager meets a criterion; and
in response to a determination that the performance of the event manager meets the criterion, indicate that the event manager is not operational. 19. The apparatus of claim 13 further comprising program code executable by the processor to cause the apparatus to:
receive second state data, wherein the second state data is generated by the event manager based, at least in part, on the event manager processing a subset of the second batch of events; and
in response to a determination that the event manager is not operational,
identify a set of unprocessed events and a set of processed events based, at least in part, on second state data, wherein the second batch of events comprises the set of unprocessed events and the set of processed events, wherein the set of processed events corresponds to the subset of the second batch of events;
wherein the program code executable by the processor to cause the apparatus to process the second batch of events comprises program code executable by the processor to cause the apparatus to process the set of unprocessed events and not process the set of processed events. 20. The apparatus of claim 19, wherein the program code executable by the processor to cause the apparatus to identify the set of processed events comprises comparing a plurality of event identifiers of the second batch of events to a plurality of event identifiers that comprise the second state data. | 2,100 |
4,454 | 15,156,100 | 2,137 | A lookup circuit evaluates hash functions that map keys to addresses in lookup tables. The circuit may include multiple hash function sub-circuits, each of which applies a respective hash function to an input key value, producing a hash value. Each hash function sub-circuit may multiply bit vectors representing key values by a sparse bit matrix and may add a constant bit vector to the results. The hash function sub-circuits may be constructed using odd-parity circuits that accept as inputs subsets of the bits of the bit vectors representing the key values. The sparse bit matrices may be chosen or generated so that there are at least twice as many 0-bits per row as 1-bits or there is an upper bound on the number of 1-bits per row. Using sparse bit matrices in the hash function sub-circuits may allow the lookup circuit to perform lookup operations with very low latency. | 1. A circuit configured to perform a table lookup operation, comprising:
an input configured to receive a representation of a key value; one or more hash function sub-circuits coupled to the input; and at least one memory; wherein the representation of the key value comprises a bit vector; wherein each of the hash function sub-circuits comprises a representation of a sparse bit matrix; and wherein each of the hash function sub-circuits is configured to:
apply a respective hash function to the key value to produce a respective hash value; and
provide the respective hash value to the at least one memory, wherein the respective hash values identifies a respective location in the at least one memory;
wherein to apply the respective hash function to the key value, the hash function sub-circuit is configured to multiply the bit vector with the sparse bit matrix; and
wherein the at least one memory is configured to:
receive the respective hash values provided by each of the hash function sub-circuits; and
output a respective data value from each of the locations in the at least one memory identified by the received hash values. 2. The circuit of claim 1, wherein for at least one of the hash function sub-circuits, the sparse bit matrix is a sparse random bit matrix comprising at most a pre-defined number of 1-bits that is less than the number of bits in the bit vector. 3. The circuit of claim 1, wherein for at least one of the hash function sub-circuits, the sparse bit matrix is a sparse random bit matrix comprising at most a pre-defined number of 0-bits that is less than the number of bits in the bit vector. 4. The circuit of claim 1, wherein at least one of the hash function sub-circuits comprises one or more odd parity circuits, each of which produces one bit of the respective hash value produced by the hash function sub-circuit. 5. The circuit of claim 4, wherein each of the odd parity circuits takes as input a subset of the bits in the bit vector that is dependent on the sparse bit matrix represented in the hash function sub-circuit. 6. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits comprises fixed combinatorial logic. 7. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits comprises programmable combinatorial logic. 8. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits takes as inputs six, eleven, or twelve bits of the bit vector. 9. The circuit of claim 4, wherein at least one of the hash function sub-circuits further comprises one or more even parity circuits. 10. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, to apply the respective hash function to the key value, the hash function sub-circuit is configured further configured to add another bit vector to a result of the multiplication of the bit vector with the sparse bit matrix. 11. The circuit of claim 4, wherein at least one of the hash function sub-circuits comprises a two-level hierarchy of parity circuits, each level comprising at least one odd parity circuit. 12. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits comprises a memory. 13. The circuit of claim 1,
wherein the circuit comprises two or more hash function sub-circuits; and wherein the circuit further comprises a sub-circuit configured to generate an index into a lookup table dependent on the respective data values output from each of the locations in the at least one memory identified by the hash values produced by the two or more hash function sub-circuits. 14. The circuit of claim 1,
wherein the circuit comprises two or more hash function sub-circuits; and wherein the circuit further comprises a selection sub-circuit configured to:
select one of the respective data values output from each of the locations in the at least one memory identified by the hash values produced by the two or more hash function sub-circuits; and
provide the selected data value as an output of the circuit. 15. A method, comprising:
performing, by lookup circuit:
receiving a given key value;
for each of one or more hash functions:
applying the hash function to the given key value to produce a respective hash value, wherein said applying the hash function comprises multiplying a bit vector representation of the given key value with a sparse bit matrix;
providing the respective hash value to a memory, wherein the respective hash value identifies a location in the memory; and
obtaining data stored in the identified location in the memory. 16. The method of claim 15,
wherein the one or more hash functions comprises two or more hash functions that map key values to index values in the lookup circuit; and wherein the method further comprises, prior to said receiving,
generating two or more candidate sparse bit matrices for use in respective ones of the two or more hash functions, wherein each of the hash functions multiplies a bit vector representation of a key value with a respective one of the candidate sparse bit matrices;
determining whether the two or more hash functions are suitable for mapping each of the keys in a set of key-value pairs to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored; and
in response to determining that the two or more hash functions are suitable for mapping each of the keys in the set of key-value pairs to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored, transferring a representation of each of the two or more hash functions to the lookup circuit. 17. The method of claim 16, wherein said generating two or more candidate sparse random bit matrices comprises, for each of the two or more candidate sparse bit matrices:
receiving inputs specifying a number of rows, a number of columns, and a constraint on the number of 1-bits in each row of the candidate sparse bit matrix; allocating an array comprising the specified number of rows and columns; and for each row:
choosing a random bit value for a given bit in the row; and
for each other bit on the row:
choosing a random value for the bit or a 0-bit value for the bit dependent on whether the constraint on the number of 1-bits has been met for the row. 18. A non-transitory, computer-readable storage medium storing program instructions that when executed on one or more computers cause the one or more computers to perform:
receiving a plurality of keys for key-value pairs to be evaluated in a lookup circuit; generating two or more hash functions that when applied to each of the keys produce respective hash values that map the key to respective index values in the lookup circuit, wherein said generating comprises generating two or more candidate sparse random bit matrices, and wherein each of the hash functions multiplies an input bit vector representing a key with a respective one of the candidate sparse random bit matrices; determining whether the hash functions are suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored; and in response to determining that the hash functions are suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of the respective key-value pair can be stored:
transferring a representation of each of the hash functions to the lookup circuit; and
loading at least the data portion of each of the key-value pairs into a respective entry of a lookup table in a memory in the lookup circuit such that retrieval of the data portion of each of the key-value pairs from the respective entry is dependent on at least one of the index values to which the key for the key-value pair is mapped by the hash functions. 19. The non-transitory, computer-readable storage medium of claim 18, wherein when executed on the one or more computers, the program instructions further cause the one or more computers to perform:
in response to determining that the represented hash functions are not suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of the respective key-value pair can be stored:
generating one or more additional candidate sparse random bit matrices for use in additional respective hash functions that map the keys to index values in the lookup circuit, wherein each of the additional hash functions multiplies an input bit vector representing a key with a respective one of the additional candidate sparse random bit matrices;
determining whether a set of two or more hash functions comprising at least one of the additional hash functions is suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored. 20. The non-transitory, computer-readable storage medium of claim 18, wherein said generating the two or more hash functions comprises:
receiving inputs specifying a number of bits in each hash value; applying a first matrix generation function to a random or pseudorandom number generator to generate a first bit matrix having a number of rows that is equal to the specified number of bits; applying a second matrix generation function to a random or pseudorandom number generator to generate a second bit matrix having a number of rows that is equal to the specified number of bits; choosing a bit vector having a number of bits that is equal to the specified number of bits; constructing two hash functions dependent on the first bit matrix, the second bit matrix, and the chosen bit vector; wherein one of the constructed hash functions is configured to:
multiply an input bit vector representing a key with the first bit matrix; and
add the chosen bit vector to the result of the multiplication; and
wherein the other one of the constructed hash functions is configured to:
multiply an input bit vector representing a key with the second bit matrix; and
add the chosen bit vector to the result of the multiplication. | A lookup circuit evaluates hash functions that map keys to addresses in lookup tables. The circuit may include multiple hash function sub-circuits, each of which applies a respective hash function to an input key value, producing a hash value. Each hash function sub-circuit may multiply bit vectors representing key values by a sparse bit matrix and may add a constant bit vector to the results. The hash function sub-circuits may be constructed using odd-parity circuits that accept as inputs subsets of the bits of the bit vectors representing the key values. The sparse bit matrices may be chosen or generated so that there are at least twice as many 0-bits per row as 1-bits or there is an upper bound on the number of 1-bits per row. Using sparse bit matrices in the hash function sub-circuits may allow the lookup circuit to perform lookup operations with very low latency.1. A circuit configured to perform a table lookup operation, comprising:
an input configured to receive a representation of a key value; one or more hash function sub-circuits coupled to the input; and at least one memory; wherein the representation of the key value comprises a bit vector; wherein each of the hash function sub-circuits comprises a representation of a sparse bit matrix; and wherein each of the hash function sub-circuits is configured to:
apply a respective hash function to the key value to produce a respective hash value; and
provide the respective hash value to the at least one memory, wherein the respective hash values identifies a respective location in the at least one memory;
wherein to apply the respective hash function to the key value, the hash function sub-circuit is configured to multiply the bit vector with the sparse bit matrix; and
wherein the at least one memory is configured to:
receive the respective hash values provided by each of the hash function sub-circuits; and
output a respective data value from each of the locations in the at least one memory identified by the received hash values. 2. The circuit of claim 1, wherein for at least one of the hash function sub-circuits, the sparse bit matrix is a sparse random bit matrix comprising at most a pre-defined number of 1-bits that is less than the number of bits in the bit vector. 3. The circuit of claim 1, wherein for at least one of the hash function sub-circuits, the sparse bit matrix is a sparse random bit matrix comprising at most a pre-defined number of 0-bits that is less than the number of bits in the bit vector. 4. The circuit of claim 1, wherein at least one of the hash function sub-circuits comprises one or more odd parity circuits, each of which produces one bit of the respective hash value produced by the hash function sub-circuit. 5. The circuit of claim 4, wherein each of the odd parity circuits takes as input a subset of the bits in the bit vector that is dependent on the sparse bit matrix represented in the hash function sub-circuit. 6. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits comprises fixed combinatorial logic. 7. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits comprises programmable combinatorial logic. 8. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits takes as inputs six, eleven, or twelve bits of the bit vector. 9. The circuit of claim 4, wherein at least one of the hash function sub-circuits further comprises one or more even parity circuits. 10. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, to apply the respective hash function to the key value, the hash function sub-circuit is configured further configured to add another bit vector to a result of the multiplication of the bit vector with the sparse bit matrix. 11. The circuit of claim 4, wherein at least one of the hash function sub-circuits comprises a two-level hierarchy of parity circuits, each level comprising at least one odd parity circuit. 12. The circuit of claim 4, wherein for at least one of the hash function sub-circuits, each of the one or more odd parity circuits comprises a memory. 13. The circuit of claim 1,
wherein the circuit comprises two or more hash function sub-circuits; and wherein the circuit further comprises a sub-circuit configured to generate an index into a lookup table dependent on the respective data values output from each of the locations in the at least one memory identified by the hash values produced by the two or more hash function sub-circuits. 14. The circuit of claim 1,
wherein the circuit comprises two or more hash function sub-circuits; and wherein the circuit further comprises a selection sub-circuit configured to:
select one of the respective data values output from each of the locations in the at least one memory identified by the hash values produced by the two or more hash function sub-circuits; and
provide the selected data value as an output of the circuit. 15. A method, comprising:
performing, by lookup circuit:
receiving a given key value;
for each of one or more hash functions:
applying the hash function to the given key value to produce a respective hash value, wherein said applying the hash function comprises multiplying a bit vector representation of the given key value with a sparse bit matrix;
providing the respective hash value to a memory, wherein the respective hash value identifies a location in the memory; and
obtaining data stored in the identified location in the memory. 16. The method of claim 15,
wherein the one or more hash functions comprises two or more hash functions that map key values to index values in the lookup circuit; and wherein the method further comprises, prior to said receiving,
generating two or more candidate sparse bit matrices for use in respective ones of the two or more hash functions, wherein each of the hash functions multiplies a bit vector representation of a key value with a respective one of the candidate sparse bit matrices;
determining whether the two or more hash functions are suitable for mapping each of the keys in a set of key-value pairs to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored; and
in response to determining that the two or more hash functions are suitable for mapping each of the keys in the set of key-value pairs to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored, transferring a representation of each of the two or more hash functions to the lookup circuit. 17. The method of claim 16, wherein said generating two or more candidate sparse random bit matrices comprises, for each of the two or more candidate sparse bit matrices:
receiving inputs specifying a number of rows, a number of columns, and a constraint on the number of 1-bits in each row of the candidate sparse bit matrix; allocating an array comprising the specified number of rows and columns; and for each row:
choosing a random bit value for a given bit in the row; and
for each other bit on the row:
choosing a random value for the bit or a 0-bit value for the bit dependent on whether the constraint on the number of 1-bits has been met for the row. 18. A non-transitory, computer-readable storage medium storing program instructions that when executed on one or more computers cause the one or more computers to perform:
receiving a plurality of keys for key-value pairs to be evaluated in a lookup circuit; generating two or more hash functions that when applied to each of the keys produce respective hash values that map the key to respective index values in the lookup circuit, wherein said generating comprises generating two or more candidate sparse random bit matrices, and wherein each of the hash functions multiplies an input bit vector representing a key with a respective one of the candidate sparse random bit matrices; determining whether the hash functions are suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored; and in response to determining that the hash functions are suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of the respective key-value pair can be stored:
transferring a representation of each of the hash functions to the lookup circuit; and
loading at least the data portion of each of the key-value pairs into a respective entry of a lookup table in a memory in the lookup circuit such that retrieval of the data portion of each of the key-value pairs from the respective entry is dependent on at least one of the index values to which the key for the key-value pair is mapped by the hash functions. 19. The non-transitory, computer-readable storage medium of claim 18, wherein when executed on the one or more computers, the program instructions further cause the one or more computers to perform:
in response to determining that the represented hash functions are not suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of the respective key-value pair can be stored:
generating one or more additional candidate sparse random bit matrices for use in additional respective hash functions that map the keys to index values in the lookup circuit, wherein each of the additional hash functions multiplies an input bit vector representing a key with a respective one of the additional candidate sparse random bit matrices;
determining whether a set of two or more hash functions comprising at least one of the additional hash functions is suitable for mapping each of the keys to a respective location in the lookup circuit at which a data portion of its key-value pair can be stored. 20. The non-transitory, computer-readable storage medium of claim 18, wherein said generating the two or more hash functions comprises:
receiving inputs specifying a number of bits in each hash value; applying a first matrix generation function to a random or pseudorandom number generator to generate a first bit matrix having a number of rows that is equal to the specified number of bits; applying a second matrix generation function to a random or pseudorandom number generator to generate a second bit matrix having a number of rows that is equal to the specified number of bits; choosing a bit vector having a number of bits that is equal to the specified number of bits; constructing two hash functions dependent on the first bit matrix, the second bit matrix, and the chosen bit vector; wherein one of the constructed hash functions is configured to:
multiply an input bit vector representing a key with the first bit matrix; and
add the chosen bit vector to the result of the multiplication; and
wherein the other one of the constructed hash functions is configured to:
multiply an input bit vector representing a key with the second bit matrix; and
add the chosen bit vector to the result of the multiplication. | 2,100 |
4,455 | 13,975,625 | 2,168 | In an example embodiment, user interactions with a software component may be tracked in an efficient manner. Specifically, an analytics tracking request triggered by user interaction with a software component is received. Then a value assigned to the user is retrieved. It is then determined if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request. Based on a comparison between the value assigned to the user and the threshold value, an analytics tracking function associated with the analytics tracking request is launched. | 1. A computerized method of tracking user interaction with a software component, the method comprising:
receiving an analytics tracking request triggered by user interaction with a software component; retrieving a value assigned to the user; determining if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request; and based on a comparison between the value assigned to the user and the threshold value, launching an analytics tracking function associated with the analytics tracking request. 2. The method of claim 1, wherein the value assigned to the user reflects a worth of the user to an entity. 3. The method of claim 2, wherein the entity is a designer of the software component. 4. The method of claim 2, wherein the entity is a web site provider providing a web page executed by the software component when the user interaction occurs. 5. The method of claim 2, wherein the value is based on an estimate of purchases to be made by the user within a certain time period. 6. The computerized method of claim 1, further comprising not launching an analytics tracking function associated with the analytics tracking request in response to a determination that the value assigned to the user does not meet or exceed the value threshold. 7. The computerized method of claim 1, wherein the method is performed on a client device and the user interaction was also performed on the client device. 8. The computerized method of claim 1, wherein the method is performed on a server and the user interaction was performed on a client device in communication with the server. 9. The computerized method of claim 1, wherein the launching an analytics tracking function calls an application program interface (API) to collect and send analytics data to a data collection server. 10. The computerized method of claim 1, wherein the user interaction is triggered within a browser running a web page, the web page containing page code calling the analytics tracking request. 11. The computerized method of claim 1, wherein the user interaction is triggered within an application running code calling the analytics tracking request. 12. An apparatus comprising:
an application execution module executable by a processor and configured to execute code, the code including code making a call to one or more analytics tracking requests via an application program interface (API), in response to interactions with a software component by users; an analytics tracking request handling module configured to:
receive an analytics tracking request triggered by user interaction with a software component;
retrieve a value assigned to the user;
determine if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request; and
based on a comparison between the value assigned to the user and the threshold value, launch an analytics tracking function associated with the analytics tracking request. 13. The apparatus of claim 12, wherein the application execution module is located in a web browser. 14. The apparatus of claim 12, wherein the application execution module is located in a stand-alone application. 15. The apparatus of claim 12, wherein the analytics tracking request handling module is further configured to not launch the analytics tracking function associated with the analytics tracking request in response to a determination that the value assigned to the user does not meet or exceed the value threshold. 16. The apparatus of claim 12, wherein the application execution module is located on a server and the user interaction is performed on a client device of the server. 17. The apparatus of claim 8, wherein the launching an analytics tracking function calls an application program interface (API) to collect and send analytics data to a data collection server. 18. A non-transitory machine-readable storage medium comprising a set of instructions which, when executed by a processor, causes execution of operations of tracking user interactions with a software component, the operations comprising:
receiving an analytics tracking request triggered by user interaction with a software component; retrieving a value assigned to the user; determining if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request; and based on a comparison between the value assigned to the user and the threshold value, launching an analytics tracking function associated with the analytics tracking request. 19. The non-transitory machine-readable storage medium of claim 18, wherein the operations further comprise not launching an analytics tracking function associated with the analytics tracking request in response to a determination that the value assigned to the user does not meet or exceed the value threshold. 20. The non-transitory machine-readable storage medium of claim 18, wherein the operations are performed on a client device and the user interaction was also performed on the client device. | In an example embodiment, user interactions with a software component may be tracked in an efficient manner. Specifically, an analytics tracking request triggered by user interaction with a software component is received. Then a value assigned to the user is retrieved. It is then determined if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request. Based on a comparison between the value assigned to the user and the threshold value, an analytics tracking function associated with the analytics tracking request is launched.1. A computerized method of tracking user interaction with a software component, the method comprising:
receiving an analytics tracking request triggered by user interaction with a software component; retrieving a value assigned to the user; determining if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request; and based on a comparison between the value assigned to the user and the threshold value, launching an analytics tracking function associated with the analytics tracking request. 2. The method of claim 1, wherein the value assigned to the user reflects a worth of the user to an entity. 3. The method of claim 2, wherein the entity is a designer of the software component. 4. The method of claim 2, wherein the entity is a web site provider providing a web page executed by the software component when the user interaction occurs. 5. The method of claim 2, wherein the value is based on an estimate of purchases to be made by the user within a certain time period. 6. The computerized method of claim 1, further comprising not launching an analytics tracking function associated with the analytics tracking request in response to a determination that the value assigned to the user does not meet or exceed the value threshold. 7. The computerized method of claim 1, wherein the method is performed on a client device and the user interaction was also performed on the client device. 8. The computerized method of claim 1, wherein the method is performed on a server and the user interaction was performed on a client device in communication with the server. 9. The computerized method of claim 1, wherein the launching an analytics tracking function calls an application program interface (API) to collect and send analytics data to a data collection server. 10. The computerized method of claim 1, wherein the user interaction is triggered within a browser running a web page, the web page containing page code calling the analytics tracking request. 11. The computerized method of claim 1, wherein the user interaction is triggered within an application running code calling the analytics tracking request. 12. An apparatus comprising:
an application execution module executable by a processor and configured to execute code, the code including code making a call to one or more analytics tracking requests via an application program interface (API), in response to interactions with a software component by users; an analytics tracking request handling module configured to:
receive an analytics tracking request triggered by user interaction with a software component;
retrieve a value assigned to the user;
determine if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request; and
based on a comparison between the value assigned to the user and the threshold value, launch an analytics tracking function associated with the analytics tracking request. 13. The apparatus of claim 12, wherein the application execution module is located in a web browser. 14. The apparatus of claim 12, wherein the application execution module is located in a stand-alone application. 15. The apparatus of claim 12, wherein the analytics tracking request handling module is further configured to not launch the analytics tracking function associated with the analytics tracking request in response to a determination that the value assigned to the user does not meet or exceed the value threshold. 16. The apparatus of claim 12, wherein the application execution module is located on a server and the user interaction is performed on a client device of the server. 17. The apparatus of claim 8, wherein the launching an analytics tracking function calls an application program interface (API) to collect and send analytics data to a data collection server. 18. A non-transitory machine-readable storage medium comprising a set of instructions which, when executed by a processor, causes execution of operations of tracking user interactions with a software component, the operations comprising:
receiving an analytics tracking request triggered by user interaction with a software component; retrieving a value assigned to the user; determining if the value assigned to the user exceeds a value threshold assigned to the analytics tracking request; and based on a comparison between the value assigned to the user and the threshold value, launching an analytics tracking function associated with the analytics tracking request. 19. The non-transitory machine-readable storage medium of claim 18, wherein the operations further comprise not launching an analytics tracking function associated with the analytics tracking request in response to a determination that the value assigned to the user does not meet or exceed the value threshold. 20. The non-transitory machine-readable storage medium of claim 18, wherein the operations are performed on a client device and the user interaction was also performed on the client device. | 2,100 |
4,456 | 14,710,125 | 2,174 | A portable electronic device displays a plurality of icons (e.g., graphical objects) in a region in a touch-sensitive display; detects a predefined user action, with respect to the touch-sensitive display, for initiating a predefined user interface reconfiguration process; and varies positions of one or more icons in the plurality of icons in response to detecting the predefined user action. The varying includes varying the positions of the one or more icons about respective average positions. | 1. (canceled) 2. A method of operating a portable electronic device with a touch-sensitive display, the method comprising:
displaying a plurality of application icons on the touch-sensitive display in a normal mode of operation; while in the normal mode of operation and displaying the plurality of application icons, detecting a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display; in response to detecting the first finger gesture on the first application icon, initiating the application that corresponds to the first application icon; while in the normal mode of operation and displaying the plurality of application icons, detecting a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period; in response to detecting the finger contact held on the first application icon for more than the predetermined period, entering a user interface reconfiguration mode, distinct from the normal mode of operation; while in the user interface reconfiguration mode, detecting movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch-sensitive display; and moving the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 3. The method of claim 2, wherein each application icon in the plurality of application icons is capable of being repositioned on the touch-sensitive display while in the user interface reconfiguration mode. 4. The method of claim 2, wherein the moving the first application icon to the second location on the touch-sensitive display includes animating the first application icon to simulate floating of the first application icon on a surface corresponding to a surface of the touch-sensitive display. 5. The method of claim 2, wherein the method further includes operating the portable electronic device to provide at least one of audible and tactile feedback when the at first application icon has been moved. 6. The method of claim 2, including:
in accordance with the movement of the finger contact, moving a second application icon from the second location to a third location on the touch-sensitive display to make room for the first application icon at the second location. 7. The method of claim 2, wherein on moving the first application icon to the second location on the touch-sensitive display, one or more application icons are removed from the plurality of application icons to prevent overlapping of the moved first application icon with any of the application icons in the plurality of application icons on the touch-sensitive display. 8. A non-transitory computer readable medium storing computer instructions, which when executed by a portable electronic device with a touch-sensitive display, cause the portable electronic device to:
display a plurality of application icons on the touch-sensitive display in a normal mode of operation; while in the normal mode of operation and displaying the plurality of application icons, detect a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display; in response to detecting the first finger gesture on the first application icon, initiate the application that corresponds to the first application icon; while in the normal mode of operation and displaying the plurality of application icons, detect a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period; in response to detecting the finger contact held on the first application icon for more than the predetermined period, enter a user interface reconfiguration mode, distinct from the normal mode of operation; while in the user interface reconfiguration mode, detect movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch-sensitive display; and move the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 9. The medium of claim 8, wherein each application icon in the plurality of application icons is capable of being repositioned on the touch-sensitive display while in the user interface reconfiguration mode. 10. The medium of claim 8, wherein the moving the first application icon to the second location on the touch-sensitive display includes animating the first application icon to simulate floating of the first application icon on a surface corresponding to a surface of the touch-sensitive display. 11. The medium of claim 8, wherein the portable electronic device provides at least one of audible and tactile feedback when the first application icon has been moved. 12. The medium of claim 8, wherein the instructions, when executed by the device, further cause the device to:
in accordance with the movement of the finger contact, move a second application icon from the second location to a third location on the touch-sensitive display to make room for the first application icon at the second location. 13. The medium of claim 8, wherein on moving the first application icon to a second location on the touch-sensitive display, one or more application icons are removed from the plurality of application icons to prevent overlapping of the first application icon with any of the application icons in the plurality of application icons on the touch-sensitive display. 14. A portable electronic device comprising:
a touch-sensitive display; means for displaying a plurality of application icons on the touch-sensitive display in a normal mode of operation; while in the normal mode of operation and displaying the plurality of application icons, means for detecting a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display; in response to detecting the first finger gesture on the first application icon, means for initiating the application that corresponds to the first application icon; while in the normal mode of operation and displaying the plurality of application icons, means for detecting a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period; in response to detecting the finger contact held on the first application icon for more than the predetermined period, means for entering a user interface reconfiguration mode, distinct from the normal mode of operation; while in the user interface reconfiguration mode, means for detecting movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch sensitive display; and means for moving the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 15. A portable electronic device, comprising:
a touch-sensitive display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including instructions for:
displaying a plurality of application icons on the touch-sensitive display in a normal mode of operation;
while in the normal mode of operation and displaying the plurality of application icons, detecting a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display;
in response to detecting the first finger gesture on the first application icon, initiating the application that corresponds to the first application icon;
while in the normal mode of operation and displaying the plurality of application icons, detecting a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period;
in response to detecting the finger contact held on the first application icon for more than the predetermined period, entering a user interface reconfiguration mode, distinct from the normal mode of operation;
while in the user interface reconfiguration mode, detecting movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch-sensitive display; and
moving the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 16. The portable electronic device of claim 15, wherein each application icon in the plurality of application icons is capable of being repositioned on the touch-sensitive display while in the user interface reconfiguration mode. 17. The portable electronic device of claim 15, wherein the moving of the first application icon to the second location on the touch-sensitive display includes animating the first application icon to simulate floating of the first application icon on a surface corresponding to a surface of the touch-sensitive display. 18. The portable electronic device of claim 15, wherein the portable electronic device provides at least one of audible and tactile feedback when the first application icon has been moved. 19. The portable electronic device of claim 15, wherein the programs further includes instructions for:
in accordance with the movement of the finger contact, moving a second application icon from the second location to a third location on the touch-sensitive display to make room for the first application icon at the second location. 20. The portable electronic device of claim 15, wherein on moving the application icon to a second location on the touch-sensitive display, one or more of the application icons are removed from the plurality of application icons to prevent overlapping of the moved first application icon with any of the application icons in the plurality of application icons on the touch-sensitive display. 21. The method of claim 2, wherein the finger contact that moves from the first location to the second location on the touch-sensitive display is a continuation of the finger contact held on the first application icon for more than the predetermined period that caused the device to enter the user interface reconfiguration mode. 22. The medium of claim 8, wherein the finger contact that moves from the first location to the second location on the touch-sensitive display is a continuation of the finger contact held on the first application icon for more than the predetermined period that caused the device to enter the user interface reconfiguration mode. 23. The device of claim 15, wherein the finger contact that moves from the first location to the second location on the touch-sensitive display is a continuation of the finger contact held on the first application icon for more than the predetermined period that caused the device to enter the user interface reconfiguration mode. | A portable electronic device displays a plurality of icons (e.g., graphical objects) in a region in a touch-sensitive display; detects a predefined user action, with respect to the touch-sensitive display, for initiating a predefined user interface reconfiguration process; and varies positions of one or more icons in the plurality of icons in response to detecting the predefined user action. The varying includes varying the positions of the one or more icons about respective average positions.1. (canceled) 2. A method of operating a portable electronic device with a touch-sensitive display, the method comprising:
displaying a plurality of application icons on the touch-sensitive display in a normal mode of operation; while in the normal mode of operation and displaying the plurality of application icons, detecting a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display; in response to detecting the first finger gesture on the first application icon, initiating the application that corresponds to the first application icon; while in the normal mode of operation and displaying the plurality of application icons, detecting a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period; in response to detecting the finger contact held on the first application icon for more than the predetermined period, entering a user interface reconfiguration mode, distinct from the normal mode of operation; while in the user interface reconfiguration mode, detecting movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch-sensitive display; and moving the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 3. The method of claim 2, wherein each application icon in the plurality of application icons is capable of being repositioned on the touch-sensitive display while in the user interface reconfiguration mode. 4. The method of claim 2, wherein the moving the first application icon to the second location on the touch-sensitive display includes animating the first application icon to simulate floating of the first application icon on a surface corresponding to a surface of the touch-sensitive display. 5. The method of claim 2, wherein the method further includes operating the portable electronic device to provide at least one of audible and tactile feedback when the at first application icon has been moved. 6. The method of claim 2, including:
in accordance with the movement of the finger contact, moving a second application icon from the second location to a third location on the touch-sensitive display to make room for the first application icon at the second location. 7. The method of claim 2, wherein on moving the first application icon to the second location on the touch-sensitive display, one or more application icons are removed from the plurality of application icons to prevent overlapping of the moved first application icon with any of the application icons in the plurality of application icons on the touch-sensitive display. 8. A non-transitory computer readable medium storing computer instructions, which when executed by a portable electronic device with a touch-sensitive display, cause the portable electronic device to:
display a plurality of application icons on the touch-sensitive display in a normal mode of operation; while in the normal mode of operation and displaying the plurality of application icons, detect a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display; in response to detecting the first finger gesture on the first application icon, initiate the application that corresponds to the first application icon; while in the normal mode of operation and displaying the plurality of application icons, detect a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period; in response to detecting the finger contact held on the first application icon for more than the predetermined period, enter a user interface reconfiguration mode, distinct from the normal mode of operation; while in the user interface reconfiguration mode, detect movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch-sensitive display; and move the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 9. The medium of claim 8, wherein each application icon in the plurality of application icons is capable of being repositioned on the touch-sensitive display while in the user interface reconfiguration mode. 10. The medium of claim 8, wherein the moving the first application icon to the second location on the touch-sensitive display includes animating the first application icon to simulate floating of the first application icon on a surface corresponding to a surface of the touch-sensitive display. 11. The medium of claim 8, wherein the portable electronic device provides at least one of audible and tactile feedback when the first application icon has been moved. 12. The medium of claim 8, wherein the instructions, when executed by the device, further cause the device to:
in accordance with the movement of the finger contact, move a second application icon from the second location to a third location on the touch-sensitive display to make room for the first application icon at the second location. 13. The medium of claim 8, wherein on moving the first application icon to a second location on the touch-sensitive display, one or more application icons are removed from the plurality of application icons to prevent overlapping of the first application icon with any of the application icons in the plurality of application icons on the touch-sensitive display. 14. A portable electronic device comprising:
a touch-sensitive display; means for displaying a plurality of application icons on the touch-sensitive display in a normal mode of operation; while in the normal mode of operation and displaying the plurality of application icons, means for detecting a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display; in response to detecting the first finger gesture on the first application icon, means for initiating the application that corresponds to the first application icon; while in the normal mode of operation and displaying the plurality of application icons, means for detecting a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period; in response to detecting the finger contact held on the first application icon for more than the predetermined period, means for entering a user interface reconfiguration mode, distinct from the normal mode of operation; while in the user interface reconfiguration mode, means for detecting movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch sensitive display; and means for moving the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 15. A portable electronic device, comprising:
a touch-sensitive display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including instructions for:
displaying a plurality of application icons on the touch-sensitive display in a normal mode of operation;
while in the normal mode of operation and displaying the plurality of application icons, detecting a first finger gesture on a first application icon in the plurality of application icons, the first finger gesture being a tap gesture, the first application icon being at a first location on the touch-sensitive display;
in response to detecting the first finger gesture on the first application icon, initiating the application that corresponds to the first application icon;
while in the normal mode of operation and displaying the plurality of application icons, detecting a second finger gesture on the first application icon at the first location on the touch-sensitive display, the second finger gesture including a finger contact held on the first application icon for more than predetermined period;
in response to detecting the finger contact held on the first application icon for more than the predetermined period, entering a user interface reconfiguration mode, distinct from the normal mode of operation;
while in the user interface reconfiguration mode, detecting movement of a finger contact from the first location on the touch-sensitive display to a second location on the touch-sensitive display; and
moving the first application icon to the second location on the touch-sensitive display in accordance with the movement of the finger contact. 16. The portable electronic device of claim 15, wherein each application icon in the plurality of application icons is capable of being repositioned on the touch-sensitive display while in the user interface reconfiguration mode. 17. The portable electronic device of claim 15, wherein the moving of the first application icon to the second location on the touch-sensitive display includes animating the first application icon to simulate floating of the first application icon on a surface corresponding to a surface of the touch-sensitive display. 18. The portable electronic device of claim 15, wherein the portable electronic device provides at least one of audible and tactile feedback when the first application icon has been moved. 19. The portable electronic device of claim 15, wherein the programs further includes instructions for:
in accordance with the movement of the finger contact, moving a second application icon from the second location to a third location on the touch-sensitive display to make room for the first application icon at the second location. 20. The portable electronic device of claim 15, wherein on moving the application icon to a second location on the touch-sensitive display, one or more of the application icons are removed from the plurality of application icons to prevent overlapping of the moved first application icon with any of the application icons in the plurality of application icons on the touch-sensitive display. 21. The method of claim 2, wherein the finger contact that moves from the first location to the second location on the touch-sensitive display is a continuation of the finger contact held on the first application icon for more than the predetermined period that caused the device to enter the user interface reconfiguration mode. 22. The medium of claim 8, wherein the finger contact that moves from the first location to the second location on the touch-sensitive display is a continuation of the finger contact held on the first application icon for more than the predetermined period that caused the device to enter the user interface reconfiguration mode. 23. The device of claim 15, wherein the finger contact that moves from the first location to the second location on the touch-sensitive display is a continuation of the finger contact held on the first application icon for more than the predetermined period that caused the device to enter the user interface reconfiguration mode. | 2,100 |
4,457 | 14,984,113 | 2,194 | Some embodiments provide a system that includes a set of event publishers configured to publish events occurring on the event publishers. The system also includes a uniform event framework configured to receive, from an event publisher in the set of event publishers, an event notification indicating an event occurred on the event publisher and generate an event structure based on the event notification. The system further includes an event bus configured to receive the event notification from the uniform event framework and send the event structure to a set of event subscribers for consumption of the event structure. Each event publisher in the set of event publishers is further configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event. | 1. A system comprising:
a set of event publishers configured to publish events occurring on the event publishers; a uniform event framework configured to receive, from an event publisher in the set of event publishers, an event notification indicating an event occurred on the event publisher and generate an event structure based on the event notification; and an event bus configured to receive the event notification from the uniform event framework and send the event structure to a set of event subscribers for consumption of the event structure, wherein each event publisher in the set of event publishers is further configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event. 2. The system of claim 1, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on a same software framework. 3. The system of claim 1, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on different software frameworks. 4. The system of claim 1, wherein the event publisher provides a set of application programming interfaces to the set of event subscribers through which the set of event subscribers send the callbacks for data associated with the event. 5. The system of claim 1, wherein the set of event subscribers is a first set of event subscribers, wherein an event subscriber in the set of event subscribers is configured to forward the event structure to a second set of event subscribers operating on a different system. 6. The system of claim 1, wherein an event publisher in the set of event publishers is a rules engine configured to publish events based on rules for configuring defined events. 7. The system of claim 1, wherein an event publisher in the set of event publishers is an application configured to publish events based on code included in the application. 8. A non-transitory computer-readable medium storing a program executable by at least one processing unit, the program comprising sets of instructions for:
receiving, from an event publisher in a set of event publishers, an event notification indicating an event occurred on the event publisher; generating an event structure based on the event notification; and sending the event structure to a set of event subscribers for consumption of the event structure, wherein each event publisher in the set of event publishers is configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event. 9. The non-transitory computer-readable medium of claim 8, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on a same software framework. 10. The non-transitory computer-readable medium of claim 8, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on different software frameworks. 11. The non-transitory computer-readable medium of claim 8, wherein the event publisher provides a set of application programming interfaces to the set of event subscribers through which the set of event subscribers send the callbacks for data associated with the event. 12. The non-transitory computer-readable medium of claim 8, wherein the set of event subscribers is a first set of event subscribers, wherein an event subscriber in the set of event subscribers is configured to forward the event structure to a second set of event subscribers operating on a different system. 13. The non-transitory computer-readable medium of claim 8, wherein an event publisher in the set of event publishers is a rules engine configured to publish events based on rules for configuring defined events. 14. The non-transitory computer-readable medium of claim 8, wherein an event publisher in the set of event publishers is an application configured to publish events based on code included in the application. 15. A method comprising:
receiving, from an event publisher in a set of event publishers, an event notification indicating an event occurred on the event publisher; generating an event structure based on the event notification; and sending the event structure to a set of event subscribers for consumption of the event structure, wherein each event publisher in the set of event publishers is configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event. 16. The method of claim 15, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on a same software framework. 17. The method of claim 15, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on different software frameworks. 18. The method of claim 15, wherein the event publisher provides a set of application programming interfaces to the set of event subscribers through which the set of event subscribers send the callbacks for data associated with the event. 19. The method of claim 15, wherein the set of event subscribers is a first set of event subscribers, wherein an event subscriber in the set of event subscribers is configured to forward the event structure to a second set of event subscribers operating on a different system. 20. The method of claim 15, wherein an event publisher in the set of event publishers is a rules engine configured to publish events based on rules for configuring defined events. | Some embodiments provide a system that includes a set of event publishers configured to publish events occurring on the event publishers. The system also includes a uniform event framework configured to receive, from an event publisher in the set of event publishers, an event notification indicating an event occurred on the event publisher and generate an event structure based on the event notification. The system further includes an event bus configured to receive the event notification from the uniform event framework and send the event structure to a set of event subscribers for consumption of the event structure. Each event publisher in the set of event publishers is further configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event.1. A system comprising:
a set of event publishers configured to publish events occurring on the event publishers; a uniform event framework configured to receive, from an event publisher in the set of event publishers, an event notification indicating an event occurred on the event publisher and generate an event structure based on the event notification; and an event bus configured to receive the event notification from the uniform event framework and send the event structure to a set of event subscribers for consumption of the event structure, wherein each event publisher in the set of event publishers is further configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event. 2. The system of claim 1, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on a same software framework. 3. The system of claim 1, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on different software frameworks. 4. The system of claim 1, wherein the event publisher provides a set of application programming interfaces to the set of event subscribers through which the set of event subscribers send the callbacks for data associated with the event. 5. The system of claim 1, wherein the set of event subscribers is a first set of event subscribers, wherein an event subscriber in the set of event subscribers is configured to forward the event structure to a second set of event subscribers operating on a different system. 6. The system of claim 1, wherein an event publisher in the set of event publishers is a rules engine configured to publish events based on rules for configuring defined events. 7. The system of claim 1, wherein an event publisher in the set of event publishers is an application configured to publish events based on code included in the application. 8. A non-transitory computer-readable medium storing a program executable by at least one processing unit, the program comprising sets of instructions for:
receiving, from an event publisher in a set of event publishers, an event notification indicating an event occurred on the event publisher; generating an event structure based on the event notification; and sending the event structure to a set of event subscribers for consumption of the event structure, wherein each event publisher in the set of event publishers is configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event. 9. The non-transitory computer-readable medium of claim 8, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on a same software framework. 10. The non-transitory computer-readable medium of claim 8, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on different software frameworks. 11. The non-transitory computer-readable medium of claim 8, wherein the event publisher provides a set of application programming interfaces to the set of event subscribers through which the set of event subscribers send the callbacks for data associated with the event. 12. The non-transitory computer-readable medium of claim 8, wherein the set of event subscribers is a first set of event subscribers, wherein an event subscriber in the set of event subscribers is configured to forward the event structure to a second set of event subscribers operating on a different system. 13. The non-transitory computer-readable medium of claim 8, wherein an event publisher in the set of event publishers is a rules engine configured to publish events based on rules for configuring defined events. 14. The non-transitory computer-readable medium of claim 8, wherein an event publisher in the set of event publishers is an application configured to publish events based on code included in the application. 15. A method comprising:
receiving, from an event publisher in a set of event publishers, an event notification indicating an event occurred on the event publisher; generating an event structure based on the event notification; and sending the event structure to a set of event subscribers for consumption of the event structure, wherein each event publisher in the set of event publishers is configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event. 16. The method of claim 15, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on a same software framework. 17. The method of claim 15, wherein at least one event subscriber in the set of event subscribers and the uniform event framework are developed on different software frameworks. 18. The method of claim 15, wherein the event publisher provides a set of application programming interfaces to the set of event subscribers through which the set of event subscribers send the callbacks for data associated with the event. 19. The method of claim 15, wherein the set of event subscribers is a first set of event subscribers, wherein an event subscriber in the set of event subscribers is configured to forward the event structure to a second set of event subscribers operating on a different system. 20. The method of claim 15, wherein an event publisher in the set of event publishers is a rules engine configured to publish events based on rules for configuring defined events. | 2,100 |
4,458 | 13,473,534 | 2,199 | A thread scheduling mechanism is provided that flexibly enforces performance isolation of multiple threads to alleviate the effect of anti-cooperative execution behavior with respect to a shared resource, for example, hoarding a cache or pipeline, using the hardware capabilities of simultaneous multi-threaded (SMT) or multi-core processors. Given a plurality of threads running on at least two processors in at least one functional processor group, the occurrence of a rescheduling condition indicating anti-cooperative execution behavior is sensed, and, if present, at least one of the threads is rescheduled such that the first and second threads no longer execute in the same functional processor group at the same time. | 1. A virtual-machine monitor, implemented as computer instructions encoded within a data-storage subcomponent of a physical computer system that includes one or more mass-storage devices, one or more electronic memories, and one or more physical processors, the virtual-machine monitor comprising:
an interface component that schedules execution of virtual machines on logical processors that are each mapped to an execution thread executing on a physical-processor package, each physical-processor package supporting simultaneous execution of multiple execution threads; and an accounting component that stores, in an electronic memory, indications of package seconds accumulated by each virtual machine during execution of the virtual machine within the execution environment provided by the physical computer system and virtual-machine monitor, package seconds corresponding to a relative portion of the total processing resources of a physical-processor package used by the virtual machine. 2. The virtual-machine monitor of claim 1 wherein the interface component is one or:
an interface to a host operating system; and
a virtual-machine-monitor kernel. 3. The virtual-machine monitor of claim 1 wherein a number of package seconds accumulated for a virtual-machine running alone for a number of logical seconds within a physical-processor package is twice the number of package seconds accumulated for a virtual machine running for the number of logical seconds within a physical-processor package along with another virtual machine. 4. The virtual-machine monitor of claim 1 wherein a first number of package seconds accumulated for a virtual-machine running alone for a second number of logical seconds within a physical-processor package is equal to a factor multiplied by a third number of package seconds accumulated for each of a fourth number of virtual machines running together for the first number of logical seconds within a physical-processor package, wherein the factor is equal to the fourth number. 5. A virtual-machine monitor, implemented as computer instructions encoded within a data-storage subcomponent of a physical computer system that includes one or more mass-storage devices, one or more electronic memories, and one or more physical processors, the virtual-machine monitor comprising:
an interface component that interfaces to hardware components of the computer system on behalf of the virtual-machine monitor and virtual machines and provides a virtual hardware interface to virtual machines; a scheduler component that schedules execution of virtual machines on logical processors that are each mapped to an execution thread executing on a physical-processor package, each physical-processor package supporting simultaneous execution of multiple execution threads; and an activity sensor within the scheduler component that continuously monitors execution performance and execution characteristics of the virtual machines to detect non-optimal mapping of logical processors to execution threads within physical-processor packages. 6. The virtual-machine monitor of claim 5 wherein the interface component is one or:
an interface to a host operating system; and
a virtual-machine-monitor kernel. 7. The virtual-machine monitor of claim 5 wherein the activity sensor monitors one or more of:
hardware performance counters; and
software performance counters. 8. The virtual-machine monitor of claim 7 wherein, by monitoring one or more of hardware performance counters and software performance counters, the activity sensor determines the execution performance and the execution characteristics by determining, at intervals, one or more of a number of specific measures, including:
a frequency of pipeline flushes;
a number of cache flushes;
a number of cache misses;
a number of failed resource accesses due to resource overflow;
a number of access to each of a number of specified hardware resources. 9. The virtual-machine monitor of claim 8 wherein the activity sensor detects non-optimal mapping of logical processors to execution threads by one or more of:
applying a set of rules to the determined execution performance and the execution characteristics; and
by comparing specific measures to threshold values to detect anti-cooperative behavior. 10. The virtual-machine monitor of claim 5 wherein the scheduler, upon a determination of non-optimal mapping of logical processors to execution threads within physical-processor packages by the activity sensor, remaps logical processors to execution threads within physical-processor packages. 11. The virtual-machine monitor of claim 10 wherein the scheduler remaps logical processors to execution threads within physical-processor packages by one of
mapping a logical processor that currently shares a physical-processor package with one or more logical processors to execute alone on a physical-processor package;
mapping a logical processor that currently shares a physical-processor package with a first set of one or more logical processors to a physical-processor package which the logical processor subsequently shares with a second set of one or more logical processors, the second set of one or more logical processors including a logical processor that is not included in the first set of logical processors. 12. A virtual-machine monitor, implemented as computer instructions encoded within a data-storage subcomponent of a physical computer system that includes one or more mass-storage devices, one or more electronic memories, and one or more physical processors, the virtual-machine monitor comprising:
an interface component that interfaces to hardware components of the computer system on behalf of the virtual-machine monitor and virtual machines and provides a virtual hardware interface to virtual machines; a scheduler component that schedules execution of virtual machines on logical processors that are each mapped to an execution thread executing on a physical-processor package, each physical-processor package supporting simultaneous execution of multiple execution threads; and an activity sensor within the scheduler component that continuously monitors relative execution performance and relative execution characteristics of the virtual machines to detect non-optimal mapping of logical processors to execution threads within physical-processor packages. 13. The virtual-machine monitor of claim 12 wherein the interface component is one or:
an interface to a host operating system; and
a virtual-machine-monitor kernel. 14. The virtual-machine monitor of claim 12 wherein the activity sensor monitors one or more of:
hardware performance counters; and
software performance counters. 15. The virtual-machine monitor of claim 14 wherein, by monitoring one or more of hardware performance counters and software performance counters, the activity sensor determines the relative execution performance and the relative execution characteristics by determining, at intervals, one or more of a number of specific measures, including:
a frequency of pipeline flushes;
a number of cache flushes;
a number of cache misses;
a number of failed resource accesses due to resource overflow;
a number of access to each of a number of specified hardware resources. 16. The virtual-machine monitor of claim 15 wherein the activity sensor detects non-optimal mapping of logical processors to execution threads by:
comparing specific measures for each logical processor to specific measures for other logical processors; and
comparing specific measures for each physical-processor package to specific measures for other physical-processor packages. 17. The virtual-machine monitor of claim 12 wherein the scheduler, upon a determination of non-optimal mapping of logical processors to execution threads within physical-processor packages by the activity sensor, remaps logical processors to execution threads within physical-processor packages in order to minimize differences in relative execution performance and the relative execution characteristics among logical processors and among physical-processor packages. 18. The virtual-machine monitor of claim 17 wherein the scheduler remaps logical processors to execution threads within physical-processor packages by one of:
mapping a logical processor that currently shares a physical-processor package with one or more logical processors to execute alone on a physical-processor package;
mapping a logical processor that currently shares a physical-processor package with a first set of one or more logical processors to a physical-processor package which the logical processor subsequently shares with a second set of one or more logical processors, the second set of one or more logical processors including a logical processor that is not included in the first set of logical processors. | A thread scheduling mechanism is provided that flexibly enforces performance isolation of multiple threads to alleviate the effect of anti-cooperative execution behavior with respect to a shared resource, for example, hoarding a cache or pipeline, using the hardware capabilities of simultaneous multi-threaded (SMT) or multi-core processors. Given a plurality of threads running on at least two processors in at least one functional processor group, the occurrence of a rescheduling condition indicating anti-cooperative execution behavior is sensed, and, if present, at least one of the threads is rescheduled such that the first and second threads no longer execute in the same functional processor group at the same time.1. A virtual-machine monitor, implemented as computer instructions encoded within a data-storage subcomponent of a physical computer system that includes one or more mass-storage devices, one or more electronic memories, and one or more physical processors, the virtual-machine monitor comprising:
an interface component that schedules execution of virtual machines on logical processors that are each mapped to an execution thread executing on a physical-processor package, each physical-processor package supporting simultaneous execution of multiple execution threads; and an accounting component that stores, in an electronic memory, indications of package seconds accumulated by each virtual machine during execution of the virtual machine within the execution environment provided by the physical computer system and virtual-machine monitor, package seconds corresponding to a relative portion of the total processing resources of a physical-processor package used by the virtual machine. 2. The virtual-machine monitor of claim 1 wherein the interface component is one or:
an interface to a host operating system; and
a virtual-machine-monitor kernel. 3. The virtual-machine monitor of claim 1 wherein a number of package seconds accumulated for a virtual-machine running alone for a number of logical seconds within a physical-processor package is twice the number of package seconds accumulated for a virtual machine running for the number of logical seconds within a physical-processor package along with another virtual machine. 4. The virtual-machine monitor of claim 1 wherein a first number of package seconds accumulated for a virtual-machine running alone for a second number of logical seconds within a physical-processor package is equal to a factor multiplied by a third number of package seconds accumulated for each of a fourth number of virtual machines running together for the first number of logical seconds within a physical-processor package, wherein the factor is equal to the fourth number. 5. A virtual-machine monitor, implemented as computer instructions encoded within a data-storage subcomponent of a physical computer system that includes one or more mass-storage devices, one or more electronic memories, and one or more physical processors, the virtual-machine monitor comprising:
an interface component that interfaces to hardware components of the computer system on behalf of the virtual-machine monitor and virtual machines and provides a virtual hardware interface to virtual machines; a scheduler component that schedules execution of virtual machines on logical processors that are each mapped to an execution thread executing on a physical-processor package, each physical-processor package supporting simultaneous execution of multiple execution threads; and an activity sensor within the scheduler component that continuously monitors execution performance and execution characteristics of the virtual machines to detect non-optimal mapping of logical processors to execution threads within physical-processor packages. 6. The virtual-machine monitor of claim 5 wherein the interface component is one or:
an interface to a host operating system; and
a virtual-machine-monitor kernel. 7. The virtual-machine monitor of claim 5 wherein the activity sensor monitors one or more of:
hardware performance counters; and
software performance counters. 8. The virtual-machine monitor of claim 7 wherein, by monitoring one or more of hardware performance counters and software performance counters, the activity sensor determines the execution performance and the execution characteristics by determining, at intervals, one or more of a number of specific measures, including:
a frequency of pipeline flushes;
a number of cache flushes;
a number of cache misses;
a number of failed resource accesses due to resource overflow;
a number of access to each of a number of specified hardware resources. 9. The virtual-machine monitor of claim 8 wherein the activity sensor detects non-optimal mapping of logical processors to execution threads by one or more of:
applying a set of rules to the determined execution performance and the execution characteristics; and
by comparing specific measures to threshold values to detect anti-cooperative behavior. 10. The virtual-machine monitor of claim 5 wherein the scheduler, upon a determination of non-optimal mapping of logical processors to execution threads within physical-processor packages by the activity sensor, remaps logical processors to execution threads within physical-processor packages. 11. The virtual-machine monitor of claim 10 wherein the scheduler remaps logical processors to execution threads within physical-processor packages by one of
mapping a logical processor that currently shares a physical-processor package with one or more logical processors to execute alone on a physical-processor package;
mapping a logical processor that currently shares a physical-processor package with a first set of one or more logical processors to a physical-processor package which the logical processor subsequently shares with a second set of one or more logical processors, the second set of one or more logical processors including a logical processor that is not included in the first set of logical processors. 12. A virtual-machine monitor, implemented as computer instructions encoded within a data-storage subcomponent of a physical computer system that includes one or more mass-storage devices, one or more electronic memories, and one or more physical processors, the virtual-machine monitor comprising:
an interface component that interfaces to hardware components of the computer system on behalf of the virtual-machine monitor and virtual machines and provides a virtual hardware interface to virtual machines; a scheduler component that schedules execution of virtual machines on logical processors that are each mapped to an execution thread executing on a physical-processor package, each physical-processor package supporting simultaneous execution of multiple execution threads; and an activity sensor within the scheduler component that continuously monitors relative execution performance and relative execution characteristics of the virtual machines to detect non-optimal mapping of logical processors to execution threads within physical-processor packages. 13. The virtual-machine monitor of claim 12 wherein the interface component is one or:
an interface to a host operating system; and
a virtual-machine-monitor kernel. 14. The virtual-machine monitor of claim 12 wherein the activity sensor monitors one or more of:
hardware performance counters; and
software performance counters. 15. The virtual-machine monitor of claim 14 wherein, by monitoring one or more of hardware performance counters and software performance counters, the activity sensor determines the relative execution performance and the relative execution characteristics by determining, at intervals, one or more of a number of specific measures, including:
a frequency of pipeline flushes;
a number of cache flushes;
a number of cache misses;
a number of failed resource accesses due to resource overflow;
a number of access to each of a number of specified hardware resources. 16. The virtual-machine monitor of claim 15 wherein the activity sensor detects non-optimal mapping of logical processors to execution threads by:
comparing specific measures for each logical processor to specific measures for other logical processors; and
comparing specific measures for each physical-processor package to specific measures for other physical-processor packages. 17. The virtual-machine monitor of claim 12 wherein the scheduler, upon a determination of non-optimal mapping of logical processors to execution threads within physical-processor packages by the activity sensor, remaps logical processors to execution threads within physical-processor packages in order to minimize differences in relative execution performance and the relative execution characteristics among logical processors and among physical-processor packages. 18. The virtual-machine monitor of claim 17 wherein the scheduler remaps logical processors to execution threads within physical-processor packages by one of:
mapping a logical processor that currently shares a physical-processor package with one or more logical processors to execute alone on a physical-processor package;
mapping a logical processor that currently shares a physical-processor package with a first set of one or more logical processors to a physical-processor package which the logical processor subsequently shares with a second set of one or more logical processors, the second set of one or more logical processors including a logical processor that is not included in the first set of logical processors. | 2,100 |
4,459 | 11,926,362 | 2,177 | A method of identifying an extractable portion of a source machine-readable document for extraction to an input machine-readable document is described. The method comprises inserting a reference to the extractable portion which includes a source document locator and an extractable portion identifier in an input machine-readable document which is processable with a further input document to provide the output document combining features of the input documents. The reference is unaltered by processing to provide the output document. | 1. A method of identifying an extractable portion of a source machine-readable document for extraction to an output machine-readable document comprising inserting a reference to the extractable portion, including a source document locator and an extractable portion identifier in an input machine-readable document which is processable with a further input document to provide the output document combining features of the input documents, the reference being unaltered by the processing. 2. A method as claimed in claim 1 in which an input machine-readable document comprises a template document or a data document. 3. A method as claimed in claim 1 further comprising constructing a user viewable document by obtaining the reference from the output document and extracting the extractable portion from the source document for incorporation in the user viewable document. 4. A method as claimed in claim 1 in which the reference comprises a universal resource identifier. 5. A method as claimed in claim 4 in which the universal resource identifier includes, as a source document locator, a file name and, separately therefrom, as an extractable portion identifier, location information within the file corresponding to the file name. 6. A method as claimed in claim 4 in which the universal resource identifier includes, as a source document locator, a file name and the file name includes, as an extractable portion identifier, location information. 7. A computer readable medium containing instructions arranged to operate a processor to implement the method of claim 1. 8. An apparatus for identifying an extractable portion of a source machine-readable document comprising a processor configured to operate under instructions contained in a computer readable medium to implement the method of claim 1. 9. An apparatus for identifying an extractable portion of a source machine-readable document for extraction to an output machine-readable document comprising a processor arranged to insert a reference to the extractable portion including a source document locator and an extractable portion identifier in an input machine-readable document which is processable with a further input document to provide the output document combining features of the input documents, said reference being unaltered by processing to provide the output document. | A method of identifying an extractable portion of a source machine-readable document for extraction to an input machine-readable document is described. The method comprises inserting a reference to the extractable portion which includes a source document locator and an extractable portion identifier in an input machine-readable document which is processable with a further input document to provide the output document combining features of the input documents. The reference is unaltered by processing to provide the output document.1. A method of identifying an extractable portion of a source machine-readable document for extraction to an output machine-readable document comprising inserting a reference to the extractable portion, including a source document locator and an extractable portion identifier in an input machine-readable document which is processable with a further input document to provide the output document combining features of the input documents, the reference being unaltered by the processing. 2. A method as claimed in claim 1 in which an input machine-readable document comprises a template document or a data document. 3. A method as claimed in claim 1 further comprising constructing a user viewable document by obtaining the reference from the output document and extracting the extractable portion from the source document for incorporation in the user viewable document. 4. A method as claimed in claim 1 in which the reference comprises a universal resource identifier. 5. A method as claimed in claim 4 in which the universal resource identifier includes, as a source document locator, a file name and, separately therefrom, as an extractable portion identifier, location information within the file corresponding to the file name. 6. A method as claimed in claim 4 in which the universal resource identifier includes, as a source document locator, a file name and the file name includes, as an extractable portion identifier, location information. 7. A computer readable medium containing instructions arranged to operate a processor to implement the method of claim 1. 8. An apparatus for identifying an extractable portion of a source machine-readable document comprising a processor configured to operate under instructions contained in a computer readable medium to implement the method of claim 1. 9. An apparatus for identifying an extractable portion of a source machine-readable document for extraction to an output machine-readable document comprising a processor arranged to insert a reference to the extractable portion including a source document locator and an extractable portion identifier in an input machine-readable document which is processable with a further input document to provide the output document combining features of the input documents, said reference being unaltered by processing to provide the output document. | 2,100 |
4,460 | 14,447,123 | 2,176 | An embodiment provides a method, including: receiving, at a processor, an indication of an input including a word; providing, on a touch screen, an enlarged view of the input indicated, wherein the enlarged view is off set from an input entry field on the touch screen; and accepting, using a processor, editing input that modifies the word. Other embodiments are described and claimed. | 1. A method, comprising:
receiving, at a processor, an indication of an input including a word; providing, on a touch screen, an enlarged view of the input indicated, wherein the enlarged view is off set from an input entry field on the touch screen; and accepting, using a processor, editing input that modifies the word. 2. The method of claim 1, wherein the enlarged view of the input includes a phrase containing the word. 3. The method of claim 1, wherein the indication is selected from the group consisting of a user provided indication received via the touch screen and a system generated indication. 4. The method of claim 3, wherein the user provided indication is selected from the group consisting of touch input within the word and hover input associated with the word. 5. The method of claim 3, wherein the system generated indication is generated by a spell check application running on the system. 6. The method of claim 1, further comprising automatically removing the enlarged view responsive to a predetermined criterion. 7. The method of claim 6, wherein the predetermined criterion is selected from the group consisting of removal of user input associated with the word and receipt of a system generated input indicative of no error contained within the input. 8. The method of claim 6, wherein the automatically removing is performed responsive to a predetermined time period elapsing without further user input being received. 9. The method of claim 1, wherein the accepting comprises accepting editing input via an area of the touch screen selected from the enlarged view and the input entry field. 10. The method of claim 9, wherein the accepting comprises accepting editing input via the enlarged view. 11. An electronic device, comprising:
a touch screen; a processor operatively coupled to the touch screen; and a memory device that stores instructions executable by the processor to: receive an indication of an input including a word; provide, on the touch screen, an enlarged view of the input indicated, wherein the enlarged view is off set from an input entry field on the touch screen; and accept editing input that modifies the word. 12. The electronic device of claim 11, wherein the enlarged view of the input includes a phrase containing the word. 13. The electronic device of claim 11, wherein the indication is selected from the group consisting of a user provided indication received via the touch screen and a system generated indication. 14. The electronic device of claim 13, wherein the user provided indication is selected from the group consisting of touch input within the word and hover input associated with the word. 15. The electronic device of claim 13, wherein the system generated indication is generated by a spell check application running on the system. 16. The electronic device of claim 11, wherein the instructions are further executable by the processor to automatically remove the enlarged view responsive to a predetermined criterion. 17. The electronic device of claim 16, wherein the predetermined criterion is selected from the group consisting of removal of user input associated with the word and receipt of a system generated input indicative of no error contained within the input. 18. The electronic device of claim 16, wherein to automatic removal is performed responsive to a predetermined time period elapsing without further user input being received. 19. The electronic device of claim 11, wherein to accept comprises accepting editing input via an area of the touch screen selected from the enlarged view and the input entry field. 20. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that receives an indication of an input including a word; code that provides, on a touch screen, an enlarged view of the input indicated, wherein the enlarged view is of set from an input entry field on the touch screen; and code that accepts editing input that modifies the word. | An embodiment provides a method, including: receiving, at a processor, an indication of an input including a word; providing, on a touch screen, an enlarged view of the input indicated, wherein the enlarged view is off set from an input entry field on the touch screen; and accepting, using a processor, editing input that modifies the word. Other embodiments are described and claimed.1. A method, comprising:
receiving, at a processor, an indication of an input including a word; providing, on a touch screen, an enlarged view of the input indicated, wherein the enlarged view is off set from an input entry field on the touch screen; and accepting, using a processor, editing input that modifies the word. 2. The method of claim 1, wherein the enlarged view of the input includes a phrase containing the word. 3. The method of claim 1, wherein the indication is selected from the group consisting of a user provided indication received via the touch screen and a system generated indication. 4. The method of claim 3, wherein the user provided indication is selected from the group consisting of touch input within the word and hover input associated with the word. 5. The method of claim 3, wherein the system generated indication is generated by a spell check application running on the system. 6. The method of claim 1, further comprising automatically removing the enlarged view responsive to a predetermined criterion. 7. The method of claim 6, wherein the predetermined criterion is selected from the group consisting of removal of user input associated with the word and receipt of a system generated input indicative of no error contained within the input. 8. The method of claim 6, wherein the automatically removing is performed responsive to a predetermined time period elapsing without further user input being received. 9. The method of claim 1, wherein the accepting comprises accepting editing input via an area of the touch screen selected from the enlarged view and the input entry field. 10. The method of claim 9, wherein the accepting comprises accepting editing input via the enlarged view. 11. An electronic device, comprising:
a touch screen; a processor operatively coupled to the touch screen; and a memory device that stores instructions executable by the processor to: receive an indication of an input including a word; provide, on the touch screen, an enlarged view of the input indicated, wherein the enlarged view is off set from an input entry field on the touch screen; and accept editing input that modifies the word. 12. The electronic device of claim 11, wherein the enlarged view of the input includes a phrase containing the word. 13. The electronic device of claim 11, wherein the indication is selected from the group consisting of a user provided indication received via the touch screen and a system generated indication. 14. The electronic device of claim 13, wherein the user provided indication is selected from the group consisting of touch input within the word and hover input associated with the word. 15. The electronic device of claim 13, wherein the system generated indication is generated by a spell check application running on the system. 16. The electronic device of claim 11, wherein the instructions are further executable by the processor to automatically remove the enlarged view responsive to a predetermined criterion. 17. The electronic device of claim 16, wherein the predetermined criterion is selected from the group consisting of removal of user input associated with the word and receipt of a system generated input indicative of no error contained within the input. 18. The electronic device of claim 16, wherein to automatic removal is performed responsive to a predetermined time period elapsing without further user input being received. 19. The electronic device of claim 11, wherein to accept comprises accepting editing input via an area of the touch screen selected from the enlarged view and the input entry field. 20. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that receives an indication of an input including a word; code that provides, on a touch screen, an enlarged view of the input indicated, wherein the enlarged view is of set from an input entry field on the touch screen; and code that accepts editing input that modifies the word. | 2,100 |
4,461 | 14,571,224 | 2,127 | Systems and methods for linear regression using safe screening techniques. A computing system may receive, from a user of the system, a data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set. The computing system may determine an active set of variables using a safe screening algorithm The computing system may generate the linear model using the active set and a least angle regression algorithm. The computing system may provide, to the user of the system, information related to the linear model. | 1. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to be executed to cause a data processing apparatus to:
receive, from a user of the computer-program product, information associated with a data set, the data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set; determine an active set of variables using a safe screening algorithm, the active set of variables being a subset of the set of variables included in the data set that are determined to be below a threshold degree of relevance for predicting the response variable; generate the linear model using the active set and a least angle regression algorithm including a least squares regression algorithm, the least squares regression algorithm constraining a number of absolute regression coefficients utilized in the least angle regression algorithm; and provide, to the user of the computer-program product, information related to the linear model. 2. The computer-program product of claim 1, wherein the linear model is a best-fit regression line for the data set, the best-fit regression line being calculated based on the set of variables and the response variable. 3. The computer-program product of claim 1, wherein the least angle regression algorithm is a LARS-LASSO algorithm, and wherein the instructions on the data processing apparatus are configured to reduce an execution time of the LARS-LASSO algorithm with safe screening techniques. 4. The computer-program product of claim 1, wherein the instructions that are configured to determine the active set using the safe screening algorithm are further configured to be executed to cause the data processing apparatus to:
identify inactive variables in the data set that are guaranteed to have zero coefficients; and exclude the inactive variables from the active set. 5. The computer-program product of claim 1, wherein the instructions that are configured to determine the active set using the safe screening algorithm are further configured to be executed to cause the data processing apparatus to calculate a regularization parameter for the safe screening algorithm, the regularization parameter indicating an absolute correlation between the set of variables of the data set and the response variable. 6. The computer-program product of claim 5, wherein the regularization parameter for the safe screening algorithm is has not been calculated prior to determining the active set. 7. The computer-program product of claim 5, wherein the instructions that are configured to determine the active set using the safe screening algorithm are further configured to be executed to cause the data processing apparatus to, for each particular variable of the set of variables included in the data set:
calculate a removal parameter for the particular variable based on the particular variable to the response variable; if the removal parameter is greater than the regularization parameter, include the particular variable in the active set; and if the removal parameter is less than the regularization parameter, exclude the particular variable from the active set. 8. The computer-program product of claim 5, wherein the instructions are further configured to be executed to cause the data processing apparatus to:
calculate a residual for the data set, the residual estimating a statistical error for the data set; for each variable in the active set:
calculate a correlation between the variable in the active set and the residual; and
calculate a equiangular vector based on the data set, the equiangular vector indicating a predicted response of the data set. 9. The computer-program product of claim 5, wherein the instructions are further configured to be executed to cause the data processing apparatus to:
determine whether the correlation is within an error threshold of the predicted response; if the correlation is less than the error threshold, update the regularization parameter; and if the correlation is greater than the error threshold:
calculate a removal parameter for the particular variable based on a correlation of the particular variable to the response variable; and
update the active set based on the calculated removal parameter. 10. A computer-implemented method comprising:
receiving, from a user of a computing device, a data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set; determining, by the computing device, an active set of variables using a safe screening algorithm, the active set of variables being a subset of the set of variables included in the data set, the active set excluding variables from the data set that are determined to be below a threshold degree of relevance for predicting the response variable; generating, by the computing device, the linear model using the active set and a least angle regression algorithm, the least angle regression including a least squares regression algorithm, the least squares regression algorithm constraining a number of absolute regression coefficients utilized in the least angle regression algorithm; and providing, to the user of the computing device, information related to the linear model. 11.-19. (canceled) 20. A system, comprising:
a processor, and a non-transitory computer-readable storage medium including instructions configured to be executed that, when executed by the processor, cause the system to perform operations including: receiving, from a user of the system, a data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set; determining an active set of variables using a safe screening algorithm, the active set of variables being a subset of the set of variables included in the data set, the active set excluding variables from the data set that are determined to be below a threshold degree of relevance for predicting the response variable; and generating the linear model using the active set and a least angle regression algorithm, the least angle regression including a least squares regression algorithm, the least squares regression algorithm constraining a number of absolute regression coefficients utilized in the least angle regression algorithm; and providing, to the user of the system, information related to the linear model. 21. The system of claim 20, wherein the electronic linear model is a best-fit regression line for the data set, the best-fit regression line being calculated based on the set of variables and the response variable. 22. The system of claim 20, wherein the least angle regression algorithm is a LARS-LASSO algorithm, and wherein the instructions on the system are configured to reduce an execution time of the LARS-LASSO algorithm with safe screening techniques. 23. The system of claim 20, wherein the safe screening algorithm causes removal of variables from the data set that are determined to be substantially irrelevant for predicting the response variable. 24. The system of claim 20, wherein the instructions that are, when executed by the processor, configured to determine the active set using the safe screening algorithm include further instructions that are configured to, when executed by the processor, cause the system to perform operations including:
identifying inactive variables in the data set that are guaranteed to have zero coefficients; and excluding the inactive variables from the active set. 25. The system of claim 20, wherein the instructions that are, when executed by the processor, configured to determine the active set using the safe screening algorithm include further instructions that are configured to, when executed by the processor, cause the system to perform operations including calculating a regularization parameter for the safe screening algorithm, the regularization parameter indicating an absolute correlation between the set of variables of the data set and the response variable. 26. The system of claim 25, wherein the regularization parameter for the safe screening algorithm has not been calculated prior to determining the active set. 27. The system of claim 25, wherein the instructions that are, when executed by the processor, configured to determine the active set using the safe screening algorithm further comprises, include further instructions that are configured to, when executed by the processor, cause the system to perform operations for each particular variable of the set of variables included in the data set, the operations including:
calculating a removal parameter for the particular variable based on the particular variable to the response variable; including the particular variable in the active set when the removal parameter is greater than the regularization parameter; and excluding the particular variable from the active set when the removal parameter is less than the regularization parameter. 28. The system of claim 25, including further instructions configured to be executed that, when executed by the processor, cause the system to perform further operations including:
calculating a residual for the data set, the residual estimating a statistical error for the data set; and for each variable in the active set:
calculating a correlation between the variable in the active set and the residual; and
calculating a equiangular vector based on the data set, the equiangular vector indicating a predicted response of the data set. 29. The system of claim 27, including further instructions configured to be executed that, when executed by the processor, cause the system to perform further operations including:
determining whether the correlation is within an error threshold of the predicted response; updating the regularization parameter when the correlation is less than the error threshold; and if the correlation is greater than the error threshold:
calculating a removal parameter for the particular variable based on a correlation of the particular variable to the response variable; and
updating the active set based on the recalculated removal parameter. | Systems and methods for linear regression using safe screening techniques. A computing system may receive, from a user of the system, a data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set. The computing system may determine an active set of variables using a safe screening algorithm The computing system may generate the linear model using the active set and a least angle regression algorithm. The computing system may provide, to the user of the system, information related to the linear model.1. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to be executed to cause a data processing apparatus to:
receive, from a user of the computer-program product, information associated with a data set, the data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set; determine an active set of variables using a safe screening algorithm, the active set of variables being a subset of the set of variables included in the data set that are determined to be below a threshold degree of relevance for predicting the response variable; generate the linear model using the active set and a least angle regression algorithm including a least squares regression algorithm, the least squares regression algorithm constraining a number of absolute regression coefficients utilized in the least angle regression algorithm; and provide, to the user of the computer-program product, information related to the linear model. 2. The computer-program product of claim 1, wherein the linear model is a best-fit regression line for the data set, the best-fit regression line being calculated based on the set of variables and the response variable. 3. The computer-program product of claim 1, wherein the least angle regression algorithm is a LARS-LASSO algorithm, and wherein the instructions on the data processing apparatus are configured to reduce an execution time of the LARS-LASSO algorithm with safe screening techniques. 4. The computer-program product of claim 1, wherein the instructions that are configured to determine the active set using the safe screening algorithm are further configured to be executed to cause the data processing apparatus to:
identify inactive variables in the data set that are guaranteed to have zero coefficients; and exclude the inactive variables from the active set. 5. The computer-program product of claim 1, wherein the instructions that are configured to determine the active set using the safe screening algorithm are further configured to be executed to cause the data processing apparatus to calculate a regularization parameter for the safe screening algorithm, the regularization parameter indicating an absolute correlation between the set of variables of the data set and the response variable. 6. The computer-program product of claim 5, wherein the regularization parameter for the safe screening algorithm is has not been calculated prior to determining the active set. 7. The computer-program product of claim 5, wherein the instructions that are configured to determine the active set using the safe screening algorithm are further configured to be executed to cause the data processing apparatus to, for each particular variable of the set of variables included in the data set:
calculate a removal parameter for the particular variable based on the particular variable to the response variable; if the removal parameter is greater than the regularization parameter, include the particular variable in the active set; and if the removal parameter is less than the regularization parameter, exclude the particular variable from the active set. 8. The computer-program product of claim 5, wherein the instructions are further configured to be executed to cause the data processing apparatus to:
calculate a residual for the data set, the residual estimating a statistical error for the data set; for each variable in the active set:
calculate a correlation between the variable in the active set and the residual; and
calculate a equiangular vector based on the data set, the equiangular vector indicating a predicted response of the data set. 9. The computer-program product of claim 5, wherein the instructions are further configured to be executed to cause the data processing apparatus to:
determine whether the correlation is within an error threshold of the predicted response; if the correlation is less than the error threshold, update the regularization parameter; and if the correlation is greater than the error threshold:
calculate a removal parameter for the particular variable based on a correlation of the particular variable to the response variable; and
update the active set based on the calculated removal parameter. 10. A computer-implemented method comprising:
receiving, from a user of a computing device, a data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set; determining, by the computing device, an active set of variables using a safe screening algorithm, the active set of variables being a subset of the set of variables included in the data set, the active set excluding variables from the data set that are determined to be below a threshold degree of relevance for predicting the response variable; generating, by the computing device, the linear model using the active set and a least angle regression algorithm, the least angle regression including a least squares regression algorithm, the least squares regression algorithm constraining a number of absolute regression coefficients utilized in the least angle regression algorithm; and providing, to the user of the computing device, information related to the linear model. 11.-19. (canceled) 20. A system, comprising:
a processor, and a non-transitory computer-readable storage medium including instructions configured to be executed that, when executed by the processor, cause the system to perform operations including: receiving, from a user of the system, a data set including a set of variables, the set of variables being related to a linear model for predicting a response variable of the data set; determining an active set of variables using a safe screening algorithm, the active set of variables being a subset of the set of variables included in the data set, the active set excluding variables from the data set that are determined to be below a threshold degree of relevance for predicting the response variable; and generating the linear model using the active set and a least angle regression algorithm, the least angle regression including a least squares regression algorithm, the least squares regression algorithm constraining a number of absolute regression coefficients utilized in the least angle regression algorithm; and providing, to the user of the system, information related to the linear model. 21. The system of claim 20, wherein the electronic linear model is a best-fit regression line for the data set, the best-fit regression line being calculated based on the set of variables and the response variable. 22. The system of claim 20, wherein the least angle regression algorithm is a LARS-LASSO algorithm, and wherein the instructions on the system are configured to reduce an execution time of the LARS-LASSO algorithm with safe screening techniques. 23. The system of claim 20, wherein the safe screening algorithm causes removal of variables from the data set that are determined to be substantially irrelevant for predicting the response variable. 24. The system of claim 20, wherein the instructions that are, when executed by the processor, configured to determine the active set using the safe screening algorithm include further instructions that are configured to, when executed by the processor, cause the system to perform operations including:
identifying inactive variables in the data set that are guaranteed to have zero coefficients; and excluding the inactive variables from the active set. 25. The system of claim 20, wherein the instructions that are, when executed by the processor, configured to determine the active set using the safe screening algorithm include further instructions that are configured to, when executed by the processor, cause the system to perform operations including calculating a regularization parameter for the safe screening algorithm, the regularization parameter indicating an absolute correlation between the set of variables of the data set and the response variable. 26. The system of claim 25, wherein the regularization parameter for the safe screening algorithm has not been calculated prior to determining the active set. 27. The system of claim 25, wherein the instructions that are, when executed by the processor, configured to determine the active set using the safe screening algorithm further comprises, include further instructions that are configured to, when executed by the processor, cause the system to perform operations for each particular variable of the set of variables included in the data set, the operations including:
calculating a removal parameter for the particular variable based on the particular variable to the response variable; including the particular variable in the active set when the removal parameter is greater than the regularization parameter; and excluding the particular variable from the active set when the removal parameter is less than the regularization parameter. 28. The system of claim 25, including further instructions configured to be executed that, when executed by the processor, cause the system to perform further operations including:
calculating a residual for the data set, the residual estimating a statistical error for the data set; and for each variable in the active set:
calculating a correlation between the variable in the active set and the residual; and
calculating a equiangular vector based on the data set, the equiangular vector indicating a predicted response of the data set. 29. The system of claim 27, including further instructions configured to be executed that, when executed by the processor, cause the system to perform further operations including:
determining whether the correlation is within an error threshold of the predicted response; updating the regularization parameter when the correlation is less than the error threshold; and if the correlation is greater than the error threshold:
calculating a removal parameter for the particular variable based on a correlation of the particular variable to the response variable; and
updating the active set based on the recalculated removal parameter. | 2,100 |
4,462 | 14,504,702 | 2,113 | Each task assigned to a core can be considered an “active” task. Sequential strobe signals of a watchdog signal can be spaced apart in time by a certain duration. The duration between strobe signals is longer than the expected duration of an active task. By knowing that all tasks being monitored are expected to execute within an expected amount of time, the duration between the strobe signals can be set to be longer than that expected amount of time. If a task has not transitioned to inactive by a next strobe, a watchdog error has occurred. | 1. A method comprising:
in response to a watchdog check signal being asserted at a first time, storing a first indicator that indicates a state of a first task of a data processor at the first time; in response to the watchdog check signal being asserted at the first time, storing a second indicator that indicates a state of a second task of the data processor at the first time; determining, based on the first and second indicators at a second time, whether at least one of the first or second task has been active since the first time; and in response to determining that at least one of the first or second task has been active since the first time active, asserting an error indicator. 2. The method of claim 1, wherein determining whether at least one of the first or second task has been active since the first time is in response to the watchdog check signal being asserted at the second time. 3. The method of claim 1, wherein the watchdog check signal is asserted periodically. 4. The method of claim 3, further comprising:
programming a period of the watchdog timer from a task other than the first or second task. 5. The method of claim 1, wherein the first and second task are assigned to a same core of the data processor. 6. The method of claim 1, wherein the first and second task are assigned to different cores of the data processor. 7. The method of claim 1, wherein:
the first indicator indicates the state of the first task is active at the first time; and independent of a state of the watchdog check signal, updating the first indicator to indicate the state of the first state is inactive in response to the state of the first task becoming inactive subsequent to the first time and prior to the second time. 8. The method of claim 1 further comprising:
in response to determining that neither the state of the first nor second task is active at the second time, not asserting the error indictor. 9. The method of claim 8 further comprising:
in response to determining that neither the first nor second task is active, updating, in response to the watchdog check signal being asserted at the second time, the first state indicator to indicate whether the state of the first task at the second time is active or inactive, and updating the second state indicator to indicate whether the state of the second task at the second time is active or inactive. 10. The method of claim 1, wherein each task of a plurality of tasks, which includes the first task and the second task, is active in response to being assigned to a particular core of the data processor. 11. The method of claim 1, wherein the first indicator is stored at a first storage location, and a core executing the first task cannot write an indicator to the first storage location that indicates the first task is inactive. 12. The method of claim 1, wherein the first indicator is stored at a first storage location, the second indicator is stored at a second storage location, and a core executing the first task cannot store a value to either the first or second storage locations. 13. The method of claim 1, wherein the error indicator is further asserted in response to a watchdog function being enabled. 14. A data processor device comprising:
a task scheduler configured to assign a plurality of tasks to a corresponding plurality of task identifiers; a task state tracker configured to generate a state indicator for each one of the plurality of tasks that indicates whether a task is active or inactive; a watchdog status register having a plurality of storage locations, each storage location to store a task identifier of a corresponding one of the plurality of tasks; a watchdog check circuit configured to generate a watchdog check signal that is periodically asserted; watchdog monitor circuit, coupled to the watchdog status register, to the watchdog check circuit, and to the task state tracker, that is configured to assert each storage location of the plurality of storage locations corresponding to a task having an active state indicator at the time the check signal is asserted, and to negate each storage location of the plurality of storage locations corresponding to a task having an inactive state indicator at the time the check signal is asserted, and error detect circuitry, coupled the watchdog status register and to the watchdog check circuit, configured to generate a watchdog error in response one or more of the plurality of storage locations being asserted at the time the check signal is asserted. 15. The device of claim 14, wherein the watchdog monitor circuit configures each storage location in response to a watchdog error not being generated by the error detect circuitry. 16. The device of claim 14 further comprising:
a plurality of cores including a first core and a second core, a first portion of the plurality of tasks assigned to the first core, and a second portion of the plurality of tasks assigned to the second core. 17. The device of claim 14 further comprising:
a programmable check signal register coupled to the watchdog check circuit to indicate a period of the check signal to be implemented by the watchdog check circuit. 18. The device of claim 14 wherein the task state tracker generates a state indicator that indicates a task is active synchronously with the check signal being asserted, and generates a state indicator that indicate a task is inactive asynchronously with the check signal. 19. A method comprising:
in response to receiving an asserted watchdog check signal at a first time, storing a first indicator at a first storage location that indicates the first task of a data processor is active at the first time; receiving a negated watchdog check signal at a second time that is contiguous to, and after, the first time; in response to the watchdog check signal being asserted at a third time that is contiguous to, and after, the second time, asserting a watchdog error indicator in response to determining that the first indicator is stored at the first storage location. 20. The device of claim 19 further comprising:
storing a duration indicator;
asserting the second watchdog check signal at the third time relative to the first time based upon the stored duration indicator. | Each task assigned to a core can be considered an “active” task. Sequential strobe signals of a watchdog signal can be spaced apart in time by a certain duration. The duration between strobe signals is longer than the expected duration of an active task. By knowing that all tasks being monitored are expected to execute within an expected amount of time, the duration between the strobe signals can be set to be longer than that expected amount of time. If a task has not transitioned to inactive by a next strobe, a watchdog error has occurred.1. A method comprising:
in response to a watchdog check signal being asserted at a first time, storing a first indicator that indicates a state of a first task of a data processor at the first time; in response to the watchdog check signal being asserted at the first time, storing a second indicator that indicates a state of a second task of the data processor at the first time; determining, based on the first and second indicators at a second time, whether at least one of the first or second task has been active since the first time; and in response to determining that at least one of the first or second task has been active since the first time active, asserting an error indicator. 2. The method of claim 1, wherein determining whether at least one of the first or second task has been active since the first time is in response to the watchdog check signal being asserted at the second time. 3. The method of claim 1, wherein the watchdog check signal is asserted periodically. 4. The method of claim 3, further comprising:
programming a period of the watchdog timer from a task other than the first or second task. 5. The method of claim 1, wherein the first and second task are assigned to a same core of the data processor. 6. The method of claim 1, wherein the first and second task are assigned to different cores of the data processor. 7. The method of claim 1, wherein:
the first indicator indicates the state of the first task is active at the first time; and independent of a state of the watchdog check signal, updating the first indicator to indicate the state of the first state is inactive in response to the state of the first task becoming inactive subsequent to the first time and prior to the second time. 8. The method of claim 1 further comprising:
in response to determining that neither the state of the first nor second task is active at the second time, not asserting the error indictor. 9. The method of claim 8 further comprising:
in response to determining that neither the first nor second task is active, updating, in response to the watchdog check signal being asserted at the second time, the first state indicator to indicate whether the state of the first task at the second time is active or inactive, and updating the second state indicator to indicate whether the state of the second task at the second time is active or inactive. 10. The method of claim 1, wherein each task of a plurality of tasks, which includes the first task and the second task, is active in response to being assigned to a particular core of the data processor. 11. The method of claim 1, wherein the first indicator is stored at a first storage location, and a core executing the first task cannot write an indicator to the first storage location that indicates the first task is inactive. 12. The method of claim 1, wherein the first indicator is stored at a first storage location, the second indicator is stored at a second storage location, and a core executing the first task cannot store a value to either the first or second storage locations. 13. The method of claim 1, wherein the error indicator is further asserted in response to a watchdog function being enabled. 14. A data processor device comprising:
a task scheduler configured to assign a plurality of tasks to a corresponding plurality of task identifiers; a task state tracker configured to generate a state indicator for each one of the plurality of tasks that indicates whether a task is active or inactive; a watchdog status register having a plurality of storage locations, each storage location to store a task identifier of a corresponding one of the plurality of tasks; a watchdog check circuit configured to generate a watchdog check signal that is periodically asserted; watchdog monitor circuit, coupled to the watchdog status register, to the watchdog check circuit, and to the task state tracker, that is configured to assert each storage location of the plurality of storage locations corresponding to a task having an active state indicator at the time the check signal is asserted, and to negate each storage location of the plurality of storage locations corresponding to a task having an inactive state indicator at the time the check signal is asserted, and error detect circuitry, coupled the watchdog status register and to the watchdog check circuit, configured to generate a watchdog error in response one or more of the plurality of storage locations being asserted at the time the check signal is asserted. 15. The device of claim 14, wherein the watchdog monitor circuit configures each storage location in response to a watchdog error not being generated by the error detect circuitry. 16. The device of claim 14 further comprising:
a plurality of cores including a first core and a second core, a first portion of the plurality of tasks assigned to the first core, and a second portion of the plurality of tasks assigned to the second core. 17. The device of claim 14 further comprising:
a programmable check signal register coupled to the watchdog check circuit to indicate a period of the check signal to be implemented by the watchdog check circuit. 18. The device of claim 14 wherein the task state tracker generates a state indicator that indicates a task is active synchronously with the check signal being asserted, and generates a state indicator that indicate a task is inactive asynchronously with the check signal. 19. A method comprising:
in response to receiving an asserted watchdog check signal at a first time, storing a first indicator at a first storage location that indicates the first task of a data processor is active at the first time; receiving a negated watchdog check signal at a second time that is contiguous to, and after, the first time; in response to the watchdog check signal being asserted at a third time that is contiguous to, and after, the second time, asserting a watchdog error indicator in response to determining that the first indicator is stored at the first storage location. 20. The device of claim 19 further comprising:
storing a duration indicator;
asserting the second watchdog check signal at the third time relative to the first time based upon the stored duration indicator. | 2,100 |
4,463 | 14,125,785 | 2,161 | Systems and methods for merging partially aggregated query results are provided. A partially aggregated query result is determined. Each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration. A key and a value of the partially aggregated query result are identified. It is determined whether a function for the partially aggregated query result is identified. If so, a related partially aggregated query result is determined using the key. The partially aggregated query result is merged with the related partially aggregated query result. | 1. A method for processing aggregated query results, the method comprising:
determining a partially aggregated query result, wherein each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration; identifying a key and a value of the partially aggregated query result; determining whether a function for the partially aggregated query result is identified; determining a related partially aggregated query result of a plurality of partially aggregated query results using the key; and merging, at a local memory of a computing device, the partially aggregated query result and the related partially aggregated query result. 2. The method of claim 1, wherein merging comprises:
applying the function to the value of the partially aggregated query result and the value of the related partially aggregated query result. 3. The method of claim 1, further comprising:
storing a complete aggregation of the query result in a persistent storage, wherein the complete aggregation of the query result is determined upon merging the partially aggregated query result and the related partially aggregated query result. 4. The method of claim 1, wherein the partially aggregated query result is generated by a distributed manager of a network system, and the partially aggregated query result is received by a local manager of the network system. 5. The method of claim 1, further comprising:
detecting a query for real-time data; issuing the query for real-time data on a persistent storage, wherein the persistent storage includes the plurality of partially aggregated query result; determining a result of issuing the query on the persistent storage; and determining an in-memory aggregation of the query for real-time data, wherein the complete aggregation of the query result is generated using the result of issuing the query on the persistent storage and the in-memory aggregation. 6. The method of claim 1, further comprising:
receiving, at a local memory of the computing device, a plurality of events in an event stream; determining the plurality of events are out-of-order events; determining a query result for each of the plurality of events; and determining a partially aggregated query result based on the query result for each of the plurality of events. 7. A system for processing partially aggregated query results, the system comprising:
a persistent store for storage of partially aggregated query results and complete query results; and a computer that includes:
a trend aggregation module; and
a memory for merging of partially aggregated query results;
wherein the trend aggregation module is configured to:
determine a partially aggregated query result, wherein each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration;
identify a key and a value of the partially aggregated query result;
determine whether a function for the partially aggregated query result is identified;
determine a related partially aggregated query result of a plurality of partially aggregated query results using the key; and
merge the partially aggregated query result and the related partially aggregated query result. 8. The system of claim 7, wherein merging comprises:
applying the function to the value of the partially aggregated query result and to the value of the related partially aggregated query result. 9. The system of claim 7, wherein the trend aggregation module is further configured to:
store a complete query result in the persistent storage, wherein the complete query result is determined upon the partially aggregated query result and the related partially aggregated query result. 10. The system of claim 7, wherein the trend aggregation module is further configured to:
detect a query for real-time data; issue the query for real-time data on the persistent storage; determine a result of issuing the query on the persistent storage; and determine an in-memory aggregation of the query for real-time data, wherein a complete aggregation of the query result is generated using the result of issuing the query on the persistent storage and the in-memory aggregation. 11. The system of claim 7, wherein the memory is further configured to receive a plurality of events in an event stream, and wherein the trend aggregation module is further configured to:
determine the plurality of events are out-of-order events; determine a query result for each of the plurality of events; and determine a partially aggregated query result based on the query result for each of the plurality of events. 12. A non-transitory computer-readable medium storing a plurality of instructions to control a data processor to process partially aggregated query results, the plurality of instructions comprising instructions that cause the data processor to:
determine a partially aggregated query result, wherein each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration; identify a key and a value of the partially aggregated query result; determine whether a function for the partially aggregated query result is identified; determine a related partially aggregated query result of a plurality of partially aggregated query results using the key; and merge, at a local memory of a computing device, the partially aggregated query result and the related partially aggregated query result. 13. The non-transitory computer-readable medium of claim 12, wherein the instructions that cause the data processor to merge comprise instructions that cause the data processor to apply the function to the value of the partially aggregated query result and the value of the related partially aggregated query result. 14. The non-transitory computer-readable medium of claim 12, wherein the plurality of instructions further comprise instructions that cause the data processor to:
detect a query for real-time data; issue the query for real-time data on a persistent storage, wherein the persistent storage includes the plurality of partially aggregated query results; determine a result of issuing the query on the persistent storage; and determine an in-memory aggregation of the query for real-time data, wherein the complete aggregation of the query result is generated using the result of issuing the query on the persistent storage and the in-memory aggregation. 15. The non-transitory computer-readable medium of claim 12, wherein the plurality of instructions further comprise instructions that cause the data processor to:
receive a plurality of events in an event stream; determine the plurality of events are out-of-order events; determine a query result for each of the plurality of events; and determine a partially aggregated query result based on the query result for each of the plurality of events. | Systems and methods for merging partially aggregated query results are provided. A partially aggregated query result is determined. Each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration. A key and a value of the partially aggregated query result are identified. It is determined whether a function for the partially aggregated query result is identified. If so, a related partially aggregated query result is determined using the key. The partially aggregated query result is merged with the related partially aggregated query result.1. A method for processing aggregated query results, the method comprising:
determining a partially aggregated query result, wherein each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration; identifying a key and a value of the partially aggregated query result; determining whether a function for the partially aggregated query result is identified; determining a related partially aggregated query result of a plurality of partially aggregated query results using the key; and merging, at a local memory of a computing device, the partially aggregated query result and the related partially aggregated query result. 2. The method of claim 1, wherein merging comprises:
applying the function to the value of the partially aggregated query result and the value of the related partially aggregated query result. 3. The method of claim 1, further comprising:
storing a complete aggregation of the query result in a persistent storage, wherein the complete aggregation of the query result is determined upon merging the partially aggregated query result and the related partially aggregated query result. 4. The method of claim 1, wherein the partially aggregated query result is generated by a distributed manager of a network system, and the partially aggregated query result is received by a local manager of the network system. 5. The method of claim 1, further comprising:
detecting a query for real-time data; issuing the query for real-time data on a persistent storage, wherein the persistent storage includes the plurality of partially aggregated query result; determining a result of issuing the query on the persistent storage; and determining an in-memory aggregation of the query for real-time data, wherein the complete aggregation of the query result is generated using the result of issuing the query on the persistent storage and the in-memory aggregation. 6. The method of claim 1, further comprising:
receiving, at a local memory of the computing device, a plurality of events in an event stream; determining the plurality of events are out-of-order events; determining a query result for each of the plurality of events; and determining a partially aggregated query result based on the query result for each of the plurality of events. 7. A system for processing partially aggregated query results, the system comprising:
a persistent store for storage of partially aggregated query results and complete query results; and a computer that includes:
a trend aggregation module; and
a memory for merging of partially aggregated query results;
wherein the trend aggregation module is configured to:
determine a partially aggregated query result, wherein each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration;
identify a key and a value of the partially aggregated query result;
determine whether a function for the partially aggregated query result is identified;
determine a related partially aggregated query result of a plurality of partially aggregated query results using the key; and
merge the partially aggregated query result and the related partially aggregated query result. 8. The system of claim 7, wherein merging comprises:
applying the function to the value of the partially aggregated query result and to the value of the related partially aggregated query result. 9. The system of claim 7, wherein the trend aggregation module is further configured to:
store a complete query result in the persistent storage, wherein the complete query result is determined upon the partially aggregated query result and the related partially aggregated query result. 10. The system of claim 7, wherein the trend aggregation module is further configured to:
detect a query for real-time data; issue the query for real-time data on the persistent storage; determine a result of issuing the query on the persistent storage; and determine an in-memory aggregation of the query for real-time data, wherein a complete aggregation of the query result is generated using the result of issuing the query on the persistent storage and the in-memory aggregation. 11. The system of claim 7, wherein the memory is further configured to receive a plurality of events in an event stream, and wherein the trend aggregation module is further configured to:
determine the plurality of events are out-of-order events; determine a query result for each of the plurality of events; and determine a partially aggregated query result based on the query result for each of the plurality of events. 12. A non-transitory computer-readable medium storing a plurality of instructions to control a data processor to process partially aggregated query results, the plurality of instructions comprising instructions that cause the data processor to:
determine a partially aggregated query result, wherein each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration; identify a key and a value of the partially aggregated query result; determine whether a function for the partially aggregated query result is identified; determine a related partially aggregated query result of a plurality of partially aggregated query results using the key; and merge, at a local memory of a computing device, the partially aggregated query result and the related partially aggregated query result. 13. The non-transitory computer-readable medium of claim 12, wherein the instructions that cause the data processor to merge comprise instructions that cause the data processor to apply the function to the value of the partially aggregated query result and the value of the related partially aggregated query result. 14. The non-transitory computer-readable medium of claim 12, wherein the plurality of instructions further comprise instructions that cause the data processor to:
detect a query for real-time data; issue the query for real-time data on a persistent storage, wherein the persistent storage includes the plurality of partially aggregated query results; determine a result of issuing the query on the persistent storage; and determine an in-memory aggregation of the query for real-time data, wherein the complete aggregation of the query result is generated using the result of issuing the query on the persistent storage and the in-memory aggregation. 15. The non-transitory computer-readable medium of claim 12, wherein the plurality of instructions further comprise instructions that cause the data processor to:
receive a plurality of events in an event stream; determine the plurality of events are out-of-order events; determine a query result for each of the plurality of events; and determine a partially aggregated query result based on the query result for each of the plurality of events. | 2,100 |
4,464 | 11,967,637 | 2,177 | Embodiments of the present invention address deficiencies of the art in respect to context sensitive resource recommendations and provide a method, system and computer program product for activity sensitive context sensitive resource recommendations. In an embodiment of the invention, an activity-centric resource recommendation method can be provided. The method can include inferring an activity from a workspace in a graphical user interface, identifying resources from amongst a set of resources that are relevant to the inferred activity, and displaying the identified resources in the graphical user interface. | 1. An activity-centric resource recommendation method comprising:
inferring an activity from a workspace in a graphical user interface; identifying resources from amongst a set of resources that are relevant to the inferred activity; and, displaying the identified resources in the graphical user interface. 2. The method of claim 1, wherein inferring an activity from a workspace in a graphical user interface, comprises:
training a Bayesian predictor with words known to appear in connection with different activities; monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, providing the titles in the finite queue to the Bayesian predictor to compute a probability set of activities for the window titles. 3. The method of claim 1, wherein inferring an activity from a workspace in a graphical user interface, comprises:
training a Support Vector Machine (SVM) predictor with words known to appear in connection with different activities; monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, providing the titles in the finite queue to the SVM predictor to compute a probability set of activities for the window titles. 4. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises employing a stopword list to filter out common words amongst the words known to appear in connection with different activities. 5. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises employing semantic analysis to filter out common words amongst the words known to appear in connection with different activities. 6. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises stemming the common words amongst the words known to appear in connection with different activities. 7. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises using statistical co-occurrence analysis to identify synonyms amongst the words known to appear in connection with different activities. 8. The method of claim 2, wherein monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue, comprises monitoring active windows in the workspace to extract window titles from only active windows that have been active for more than a threshold period of time and to place the window titles in a finite queue. 9. The method of claim 2, wherein identifying resources from amongst a set of resources that are relevant to the inferred activity, comprises computing an expected relevance of a resource x as
R
c
(
x
)
=
∑
y
P
(
y
c
)
·
R
y
(
x
)
=
∑
y
P
(
y
c
)
·
P
(
y
x
)
where R is the expected relevance and y is the inferred activity and c is the queue. 10. A resource recommendation data processing system comprising:
a Bayesian predictor executing in a host computing platform, coupled to a workspace of a graphical user interface provided by the host computing platform, and trained with a bag of words associated with different activities performed through the host computing platform; and, resource recommendation logic also executing in the host computing platform, the logic comprising program code enabled to infer an activity from the workspace using the titles extracted from windows in the workspace and the Bayesian predictor, to identify resources from amongst a set of resources that are relevant to the inferred activity, and to display the identified resources in the graphical user interface. 11. A computer program product comprising a computer usable medium embodying computer usable program code for activity-centric resource recommendation, the computer program product comprising:
computer usable program code for inferring an activity from a workspace in a graphical user interface; computer usable program code for identifying resources from amongst a set of resources that are relevant to the inferred activity; and, computer usable program code for displaying the identified resources in the graphical user interface. 12. The computer program product of claim 11, wherein the computer usable program code for inferring an activity from a workspace in a graphical user interface, comprises:
computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities; computer usable program code for monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, computer usable program code for providing the titles in the finite queue to the Bayesian predictor to compute a probability set of activities for the window titles. 13. The computer program product of claim 11, wherein the computer usable program code for inferring an activity from a workspace in a graphical user interface, comprises:
computer usable program code for training a Support Vector Machine (SVM) predictor with words known to appear in connection with different activities; computer usable program code for monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, computer usable program code for providing the titles in the finite queue to the SVM predictor to compute a probability set of activities for the window titles. 14. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises computer usable program code for employing a stopword list to filter out common words amongst the words known to appear in connection with different activities. 15. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises computer usable program code for employing semantic analysis to filter out common words amongst the words known to appear in connection with different activities. 16. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises computer usable program code for stemming the common words amongst the words known to appear in connection with different activities. 17. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises using computer usable program code for statistical co-occurrence analysis to identify synonyms amongst the words known to appear in connection with different activities. 18. The computer program product of claim 11, wherein the computer usable program code for monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue, comprises computer usable program code for monitoring active windows in the workspace to extract window titles from only active windows that have been active for more than a threshold period of time and to place the window titles in a finite queue. 19. The computer program product of claim 11, wherein the computer usable program code for identifying resources from amongst a set of resources that are relevant to the inferred activity, comprises computer usable program code for computing an expected relevance of a resource x as
R
c
(
x
)
=
∑
y
P
(
y
c
)
·
R
y
(
x
)
=
∑
y
P
(
y
c
)
·
P
(
y
x
)
where R is the expected relevance and y is the inferred activity and c is the queue. | Embodiments of the present invention address deficiencies of the art in respect to context sensitive resource recommendations and provide a method, system and computer program product for activity sensitive context sensitive resource recommendations. In an embodiment of the invention, an activity-centric resource recommendation method can be provided. The method can include inferring an activity from a workspace in a graphical user interface, identifying resources from amongst a set of resources that are relevant to the inferred activity, and displaying the identified resources in the graphical user interface.1. An activity-centric resource recommendation method comprising:
inferring an activity from a workspace in a graphical user interface; identifying resources from amongst a set of resources that are relevant to the inferred activity; and, displaying the identified resources in the graphical user interface. 2. The method of claim 1, wherein inferring an activity from a workspace in a graphical user interface, comprises:
training a Bayesian predictor with words known to appear in connection with different activities; monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, providing the titles in the finite queue to the Bayesian predictor to compute a probability set of activities for the window titles. 3. The method of claim 1, wherein inferring an activity from a workspace in a graphical user interface, comprises:
training a Support Vector Machine (SVM) predictor with words known to appear in connection with different activities; monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, providing the titles in the finite queue to the SVM predictor to compute a probability set of activities for the window titles. 4. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises employing a stopword list to filter out common words amongst the words known to appear in connection with different activities. 5. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises employing semantic analysis to filter out common words amongst the words known to appear in connection with different activities. 6. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises stemming the common words amongst the words known to appear in connection with different activities. 7. The method of claim 2, wherein training a Bayesian predictor with words known to appear in connection with different activities, further comprises using statistical co-occurrence analysis to identify synonyms amongst the words known to appear in connection with different activities. 8. The method of claim 2, wherein monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue, comprises monitoring active windows in the workspace to extract window titles from only active windows that have been active for more than a threshold period of time and to place the window titles in a finite queue. 9. The method of claim 2, wherein identifying resources from amongst a set of resources that are relevant to the inferred activity, comprises computing an expected relevance of a resource x as
R
c
(
x
)
=
∑
y
P
(
y
c
)
·
R
y
(
x
)
=
∑
y
P
(
y
c
)
·
P
(
y
x
)
where R is the expected relevance and y is the inferred activity and c is the queue. 10. A resource recommendation data processing system comprising:
a Bayesian predictor executing in a host computing platform, coupled to a workspace of a graphical user interface provided by the host computing platform, and trained with a bag of words associated with different activities performed through the host computing platform; and, resource recommendation logic also executing in the host computing platform, the logic comprising program code enabled to infer an activity from the workspace using the titles extracted from windows in the workspace and the Bayesian predictor, to identify resources from amongst a set of resources that are relevant to the inferred activity, and to display the identified resources in the graphical user interface. 11. A computer program product comprising a computer usable medium embodying computer usable program code for activity-centric resource recommendation, the computer program product comprising:
computer usable program code for inferring an activity from a workspace in a graphical user interface; computer usable program code for identifying resources from amongst a set of resources that are relevant to the inferred activity; and, computer usable program code for displaying the identified resources in the graphical user interface. 12. The computer program product of claim 11, wherein the computer usable program code for inferring an activity from a workspace in a graphical user interface, comprises:
computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities; computer usable program code for monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, computer usable program code for providing the titles in the finite queue to the Bayesian predictor to compute a probability set of activities for the window titles. 13. The computer program product of claim 11, wherein the computer usable program code for inferring an activity from a workspace in a graphical user interface, comprises:
computer usable program code for training a Support Vector Machine (SVM) predictor with words known to appear in connection with different activities; computer usable program code for monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue; and, computer usable program code for providing the titles in the finite queue to the SVM predictor to compute a probability set of activities for the window titles. 14. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises computer usable program code for employing a stopword list to filter out common words amongst the words known to appear in connection with different activities. 15. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises computer usable program code for employing semantic analysis to filter out common words amongst the words known to appear in connection with different activities. 16. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises computer usable program code for stemming the common words amongst the words known to appear in connection with different activities. 17. The computer program product of claim 12, wherein the computer usable program code for training a Bayesian predictor with words known to appear in connection with different activities, further comprises using computer usable program code for statistical co-occurrence analysis to identify synonyms amongst the words known to appear in connection with different activities. 18. The computer program product of claim 11, wherein the computer usable program code for monitoring active windows in the workspace to extract window titles from the active windows and to place the window titles in a finite queue, comprises computer usable program code for monitoring active windows in the workspace to extract window titles from only active windows that have been active for more than a threshold period of time and to place the window titles in a finite queue. 19. The computer program product of claim 11, wherein the computer usable program code for identifying resources from amongst a set of resources that are relevant to the inferred activity, comprises computer usable program code for computing an expected relevance of a resource x as
R
c
(
x
)
=
∑
y
P
(
y
c
)
·
R
y
(
x
)
=
∑
y
P
(
y
c
)
·
P
(
y
x
)
where R is the expected relevance and y is the inferred activity and c is the queue. | 2,100 |
4,465 | 14,144,778 | 2,175 | A method for providing an adjustable video player is disclosed. The method includes providing, by an electronic device, a content item player for playback of a content item in a portion of a user interface (UI) of an application executed on the electronic device and receiving an indication of a gesture to minimize the content item player made by a user of the electronic device. The method further includes minimizing the content item player into a mini-player shown on the application UI without interrupting the playback of the content item in the content item player. | 1. A method comprising:
providing, by an electronic device, a content item player for playback of a content item in a portion of a user interface (UI) of an application executed on the electronic device; receiving an indication of a gesture to minimize the content item player made by a user of the electronic device; and minimizing the content item player into a mini-player shown on the application UI without interrupting the playback of the content item in the content item player. 2. The method of claim 1, wherein the mini-player persists on top of the application UI while the user interacts with the application UI. 3. The method of claim 1, wherein the user interacts with at least one of a suggestions interface, a search interface, a browsing interface, a settings interface, a subscriptions interface, a playlists interface, a favorites interface, a history interface, or an uploads interface of the application UI while the mini-player provides uninterrupted playback of the content item to the user. 4. The method of claim 1, wherein the gesture to minimize the content item player comprises at least one of a selection of a minimization indicator on the content item player or swiping in a predetermined direction on the content item player. 5. The method of claim 1, further comprising:
receiving an indication of a gesture made by the user to dismiss the mini-player; stopping playback of the content item in the mini-player; and removing the mini-player from the application UI. 6. The method of claim 5, wherein the gesture made by the user to dismiss the mini-player comprises a swipe gesture in a predetermined direction in a UI of the mini-player. 7. The method of claim 5, wherein the removing the mini-player further comprising applying at least one of animation or fading to the mini-player while the mini-player is removed from the application UI. 8. The method of claim 1, further comprising:
receiving an indication of a gesture made by the user to maximize the mini-player; and returning the content item player to an original presentation format in the application UI. 9. The method of claim 8, wherein the gesture made by the user to maximize the mini-player comprises at least one of a tap in the UI of the mini-player, a click in the UI of the mini-player, or a swipe gesture in a predetermined direction in the UI of the mini-player. 10. The method of claim 1, wherein the minimizing the content item player further comprising applying at least one of animation or fading to the content item player while the content item player transforms into the mini-player. 11. The method of claim 1, wherein a display quality format of the mini-player is the same as the display quality format of the content item player when originally displayed in the application UI. 12. An apparatus comprising:
a display device; a memory communicably coupled to the display device; and a processing device communicably coupled to the memory, the processing device to execute instructions to:
provide a content item player for playback of a content item in a portion of a user interface (UI) of an application executed on the electronic device, the application UI displayed by the display device;
receive an indication of a gesture to minimize the content item player made by a user of the electronic device; and
minimize the content item player into a mini-player shown on the application UI without interrupting the playback of the content item in the content item player. 13. The apparatus of claim 12, wherein the user interacts with at least one of a suggestions interface, a search interface, a browsing interface, a settings interface, a subscriptions interface, a playlists interface, a favorites interface, a history interface, or an uploads interface of the application UI while the mini-player provides uninterrupted playback of the content item to the user. 14. The apparatus of claim 12, wherein the gesture to minimize the content item player comprises at least one of a selection of a minimization indicator on the content item player or swiping in a predetermined direction on the content item player. 15. The apparatus of claim 12, wherein the processing device further to:
receive an indication of a gesture made by the user to dismiss the mini-player; stop playback of the content item in the mini-player; and remove the mini-player from the application UI; wherein the gesture made by the user to dismiss the mini-player comprises a swipe gesture in a predetermined direction in a UI of the mini-player. 16. The apparatus of claim 12, wherein the processing device further to:
receive an indication of a gesture made by the user to maximize the mini-player; and return the content item player to an original presentation format in the application UI; wherein the gesture made by the user to maximize the mini-player comprises at least one of a tap in the UI of the mini-player, a click in the UI of the mini-player, or a swipe gesture in a predetermined direction in the UI of the mini-player. 17. A non-transitory machine-readable storage medium storing instructions which, when executed, cause a processing device to perform operations comprising:
providing, by a processing device of a content sharing platform, first data of a content item hosted by the content sharing platform and second data of a content item player to an application of the content sharing platform executing on a client device, the first and second data utilized by the application for playback of the content item in the content item player at the application; receiving, by the processing device, an indication of a gesture made by a user of the application at the client device, the gesture to minimize the content item player; and providing, by the processing device to the application, third data for a mini-player of the content item player, the application to utilize the third data to provide the mini-player at the application without interrupting the playback of the content item in the content item player. 18. The non-transitory machine-readable storage medium of claim 17, wherein the user interacts with at least one of a suggestions interface, a search interface, a browsing interface, a settings interface, a subscriptions interface, a playlists interface, a favorites interface, a history interface, or an uploads interface of the application UI while the mini-player provides uninterrupted playback of the content item to the user. 19. The non-transitory machine-readable storage medium of claim 17, wherein the gesture to minimize the content item player comprises at least one of a selection of a minimization indicator on the content item player or swiping in a predetermined direction on the content item player. 20. The non-transitory machine-readable storage medium of claim 17, wherein the operations further comprise:
receiving an indication of a gesture made by the user to dismiss the mini-player; causing playback of the content item to stop in the mini-player; and causing the mini-player to be removed from the application UI; wherein the gesture made by the user to dismiss the mini-player comprises a swipe gesture in a predetermined direction in a UI of the mini-player. 21. The non-transitory machine-readable storage medium of claim 17, wherein the operations further comprise:
receiving an indication of a gesture made by the user to maximize the mini-player; and causing the content item player to return to an original presentation format in the application UI; wherein the gesture made by the user to maximize the mini-player comprises at least one of a tap in the UI of the mini-player, a click in the UI of the mini-player, or a swipe gesture in a predetermined direction in the UI of the mini-player. | A method for providing an adjustable video player is disclosed. The method includes providing, by an electronic device, a content item player for playback of a content item in a portion of a user interface (UI) of an application executed on the electronic device and receiving an indication of a gesture to minimize the content item player made by a user of the electronic device. The method further includes minimizing the content item player into a mini-player shown on the application UI without interrupting the playback of the content item in the content item player.1. A method comprising:
providing, by an electronic device, a content item player for playback of a content item in a portion of a user interface (UI) of an application executed on the electronic device; receiving an indication of a gesture to minimize the content item player made by a user of the electronic device; and minimizing the content item player into a mini-player shown on the application UI without interrupting the playback of the content item in the content item player. 2. The method of claim 1, wherein the mini-player persists on top of the application UI while the user interacts with the application UI. 3. The method of claim 1, wherein the user interacts with at least one of a suggestions interface, a search interface, a browsing interface, a settings interface, a subscriptions interface, a playlists interface, a favorites interface, a history interface, or an uploads interface of the application UI while the mini-player provides uninterrupted playback of the content item to the user. 4. The method of claim 1, wherein the gesture to minimize the content item player comprises at least one of a selection of a minimization indicator on the content item player or swiping in a predetermined direction on the content item player. 5. The method of claim 1, further comprising:
receiving an indication of a gesture made by the user to dismiss the mini-player; stopping playback of the content item in the mini-player; and removing the mini-player from the application UI. 6. The method of claim 5, wherein the gesture made by the user to dismiss the mini-player comprises a swipe gesture in a predetermined direction in a UI of the mini-player. 7. The method of claim 5, wherein the removing the mini-player further comprising applying at least one of animation or fading to the mini-player while the mini-player is removed from the application UI. 8. The method of claim 1, further comprising:
receiving an indication of a gesture made by the user to maximize the mini-player; and returning the content item player to an original presentation format in the application UI. 9. The method of claim 8, wherein the gesture made by the user to maximize the mini-player comprises at least one of a tap in the UI of the mini-player, a click in the UI of the mini-player, or a swipe gesture in a predetermined direction in the UI of the mini-player. 10. The method of claim 1, wherein the minimizing the content item player further comprising applying at least one of animation or fading to the content item player while the content item player transforms into the mini-player. 11. The method of claim 1, wherein a display quality format of the mini-player is the same as the display quality format of the content item player when originally displayed in the application UI. 12. An apparatus comprising:
a display device; a memory communicably coupled to the display device; and a processing device communicably coupled to the memory, the processing device to execute instructions to:
provide a content item player for playback of a content item in a portion of a user interface (UI) of an application executed on the electronic device, the application UI displayed by the display device;
receive an indication of a gesture to minimize the content item player made by a user of the electronic device; and
minimize the content item player into a mini-player shown on the application UI without interrupting the playback of the content item in the content item player. 13. The apparatus of claim 12, wherein the user interacts with at least one of a suggestions interface, a search interface, a browsing interface, a settings interface, a subscriptions interface, a playlists interface, a favorites interface, a history interface, or an uploads interface of the application UI while the mini-player provides uninterrupted playback of the content item to the user. 14. The apparatus of claim 12, wherein the gesture to minimize the content item player comprises at least one of a selection of a minimization indicator on the content item player or swiping in a predetermined direction on the content item player. 15. The apparatus of claim 12, wherein the processing device further to:
receive an indication of a gesture made by the user to dismiss the mini-player; stop playback of the content item in the mini-player; and remove the mini-player from the application UI; wherein the gesture made by the user to dismiss the mini-player comprises a swipe gesture in a predetermined direction in a UI of the mini-player. 16. The apparatus of claim 12, wherein the processing device further to:
receive an indication of a gesture made by the user to maximize the mini-player; and return the content item player to an original presentation format in the application UI; wherein the gesture made by the user to maximize the mini-player comprises at least one of a tap in the UI of the mini-player, a click in the UI of the mini-player, or a swipe gesture in a predetermined direction in the UI of the mini-player. 17. A non-transitory machine-readable storage medium storing instructions which, when executed, cause a processing device to perform operations comprising:
providing, by a processing device of a content sharing platform, first data of a content item hosted by the content sharing platform and second data of a content item player to an application of the content sharing platform executing on a client device, the first and second data utilized by the application for playback of the content item in the content item player at the application; receiving, by the processing device, an indication of a gesture made by a user of the application at the client device, the gesture to minimize the content item player; and providing, by the processing device to the application, third data for a mini-player of the content item player, the application to utilize the third data to provide the mini-player at the application without interrupting the playback of the content item in the content item player. 18. The non-transitory machine-readable storage medium of claim 17, wherein the user interacts with at least one of a suggestions interface, a search interface, a browsing interface, a settings interface, a subscriptions interface, a playlists interface, a favorites interface, a history interface, or an uploads interface of the application UI while the mini-player provides uninterrupted playback of the content item to the user. 19. The non-transitory machine-readable storage medium of claim 17, wherein the gesture to minimize the content item player comprises at least one of a selection of a minimization indicator on the content item player or swiping in a predetermined direction on the content item player. 20. The non-transitory machine-readable storage medium of claim 17, wherein the operations further comprise:
receiving an indication of a gesture made by the user to dismiss the mini-player; causing playback of the content item to stop in the mini-player; and causing the mini-player to be removed from the application UI; wherein the gesture made by the user to dismiss the mini-player comprises a swipe gesture in a predetermined direction in a UI of the mini-player. 21. The non-transitory machine-readable storage medium of claim 17, wherein the operations further comprise:
receiving an indication of a gesture made by the user to maximize the mini-player; and causing the content item player to return to an original presentation format in the application UI; wherein the gesture made by the user to maximize the mini-player comprises at least one of a tap in the UI of the mini-player, a click in the UI of the mini-player, or a swipe gesture in a predetermined direction in the UI of the mini-player. | 2,100 |
4,466 | 14,474,170 | 2,185 | Method and apparatus are provided for performing in-circuit serial programming of microcontrollers embedded within the connectors of smart cables. The method and apparatus involve providing a connector for the smart cables wherein the serial programming pins of the microcontroller are brought out or otherwise electrically connected to the sockets or pins of the connector. These sockets or pins may then be used to program the microcontroller directly from the smart cable using substantially the same programming protocols that are used with socket programmers and in-circuit programmers, but without requiring a socket programmer or an in-circuit programmer. | 1. A connector assembly, comprising:
a connector portion; a housing portion attached to and extending from the connector portion; a printed circuit board disposed within the housing portion, the printed circuit board including a plurality of conductive contact pads and a plurality of conductive mounting pads formed thereon, each mounting pad being electrically connected to at least one of the contact pads; a microcontroller mounted on the printed circuit board, the microcontroller having a plurality of conductive contacts electrically connected to the mounting pads of the printed circuit board, the conductive contacts including programming contacts that are required for programming of the microcontroller; and a plurality of conductive leads disposed within the housing portion, each lead having a first end extending into the connector portion and a second end electrically connected to one of the contact pads such that each programming contact of the microcontroller is electrically connected to at least one lead. 2. The connector assembly of claim 1, wherein the connector portion is a female connector portion and the first end of each lead is a socket contact. 3. The connector assembly of claim 1, wherein the connector portion is a male connector portion and the first end of each lead is a pin contact. 4. The connector assembly of claim 1, further comprising a plurality of wafers disposed within the housing portion, the wafers being stacked on top of each other and each wafer holding a predefined number of leads. 5. The connector assembly of claim 1, wherein the leads are arranged in four rows and seven columns for a total of 28 leads. 6. The connector assembly of claim 5, wherein the printed circuit board is a first printed circuit board, further comprising a second printed circuit board disposed within the housing adjacent to the first printed circuit board, each printed circuit board having seven conductive contacts on a topside and seven conductive contacts on a bottom side for electrically connecting the 28 leads. 7. A smart cable, comprising:
a housing portion; a cable having a plurality of wires therein, the wires extending into the housing portion; a printed circuit board disposed within the housing portion, the printed circuit board including a plurality of conductive contact pads and a plurality of conductive mounting pads formed thereon, each mounting pad being electrically connected to at least one of the contact pads; a microcontroller mounted on the printed circuit board, the microcontroller having a plurality of conductive contacts electrically connected to the mounting pads of the printed circuit board, the conductive contacts including serial programming contacts that are required for serial programming of the microcontroller; a connector portion attached to and extending from the housing portion; and a plurality of conductive leads disposed within the housing portion, each lead having a first end extending into the connector portion and a second end electrically connected to one of the contact pads such that each serial programming contact of the microcontroller is electrically connected to at least one lead. 8. The smart cable of claim 7, wherein the microcontroller is programmed to provide information regarding the cable to an external device over the leads, the information including cable authentication information, cable identification information, and cable signal information. 9. The smart cable of claim 8, further comprising non-volatile memory mounted on the circuit board and connected to the microcontroller, wherein the information regarding the cable is stored in the non-volatile memory. 10. The smart cable of claim 7, wherein the microcontroller is a PIC microcontroller. 11. The smart cable of claim 7, wherein the smart cable is a PCIe smart cable. 12. The smart cable of claim 7, wherein the connector portion is a female connector portion and the first end of each lead is a socket contact. 13. The smart cable of claim 7, wherein the connector portion is a male connector portion and the first end of each lead is a pin contact. 14. The smart cable of claim 7, further comprising a plurality of wafers disposed within the housing portion, the wafers being stacked on top of each other and each wafer holding a predefined number of leads. 15. The smart cable of claim 7, wherein the leads are arranged in four rows and seven columns for a total of 28 leads. 16. A method of in-circuit serial programming a microcontroller, comprising:
plugging a smart cable into an external device, the smart cable having the microcontroller embedded in a connector assembly of the smart cable; and performing serial programming of the microcontroller through one or more pins of the smart cable using the external device; wherein the connector assembly comprises a connector portion having a plurality of pins therein, a housing portion attached to and extending from the connector portion, and a printed circuit board disposed within the housing portion, the printed circuit board including a plurality of conductive contact pads and a plurality of conductive mounting pads formed thereon, each mounting pad being electrically connected to at least one of the contact pads; and wherein the microcontroller is mounted on the printed circuit board, the microcontroller having a plurality of conductive contacts electrically connected to the mounting pads of the printed circuit board, the conductive contacts including serial programming contacts that are required for serial programming of the microcontroller, the serial programming contacts being electrically connected to at least one of the contact pads. 17. The method of claim 16, wherein serial programming of the microcontroller comprises copying a program from a HEX file into a designated memory of the microcontroller through the connector assembly of the smart cable using the external device. | Method and apparatus are provided for performing in-circuit serial programming of microcontrollers embedded within the connectors of smart cables. The method and apparatus involve providing a connector for the smart cables wherein the serial programming pins of the microcontroller are brought out or otherwise electrically connected to the sockets or pins of the connector. These sockets or pins may then be used to program the microcontroller directly from the smart cable using substantially the same programming protocols that are used with socket programmers and in-circuit programmers, but without requiring a socket programmer or an in-circuit programmer.1. A connector assembly, comprising:
a connector portion; a housing portion attached to and extending from the connector portion; a printed circuit board disposed within the housing portion, the printed circuit board including a plurality of conductive contact pads and a plurality of conductive mounting pads formed thereon, each mounting pad being electrically connected to at least one of the contact pads; a microcontroller mounted on the printed circuit board, the microcontroller having a plurality of conductive contacts electrically connected to the mounting pads of the printed circuit board, the conductive contacts including programming contacts that are required for programming of the microcontroller; and a plurality of conductive leads disposed within the housing portion, each lead having a first end extending into the connector portion and a second end electrically connected to one of the contact pads such that each programming contact of the microcontroller is electrically connected to at least one lead. 2. The connector assembly of claim 1, wherein the connector portion is a female connector portion and the first end of each lead is a socket contact. 3. The connector assembly of claim 1, wherein the connector portion is a male connector portion and the first end of each lead is a pin contact. 4. The connector assembly of claim 1, further comprising a plurality of wafers disposed within the housing portion, the wafers being stacked on top of each other and each wafer holding a predefined number of leads. 5. The connector assembly of claim 1, wherein the leads are arranged in four rows and seven columns for a total of 28 leads. 6. The connector assembly of claim 5, wherein the printed circuit board is a first printed circuit board, further comprising a second printed circuit board disposed within the housing adjacent to the first printed circuit board, each printed circuit board having seven conductive contacts on a topside and seven conductive contacts on a bottom side for electrically connecting the 28 leads. 7. A smart cable, comprising:
a housing portion; a cable having a plurality of wires therein, the wires extending into the housing portion; a printed circuit board disposed within the housing portion, the printed circuit board including a plurality of conductive contact pads and a plurality of conductive mounting pads formed thereon, each mounting pad being electrically connected to at least one of the contact pads; a microcontroller mounted on the printed circuit board, the microcontroller having a plurality of conductive contacts electrically connected to the mounting pads of the printed circuit board, the conductive contacts including serial programming contacts that are required for serial programming of the microcontroller; a connector portion attached to and extending from the housing portion; and a plurality of conductive leads disposed within the housing portion, each lead having a first end extending into the connector portion and a second end electrically connected to one of the contact pads such that each serial programming contact of the microcontroller is electrically connected to at least one lead. 8. The smart cable of claim 7, wherein the microcontroller is programmed to provide information regarding the cable to an external device over the leads, the information including cable authentication information, cable identification information, and cable signal information. 9. The smart cable of claim 8, further comprising non-volatile memory mounted on the circuit board and connected to the microcontroller, wherein the information regarding the cable is stored in the non-volatile memory. 10. The smart cable of claim 7, wherein the microcontroller is a PIC microcontroller. 11. The smart cable of claim 7, wherein the smart cable is a PCIe smart cable. 12. The smart cable of claim 7, wherein the connector portion is a female connector portion and the first end of each lead is a socket contact. 13. The smart cable of claim 7, wherein the connector portion is a male connector portion and the first end of each lead is a pin contact. 14. The smart cable of claim 7, further comprising a plurality of wafers disposed within the housing portion, the wafers being stacked on top of each other and each wafer holding a predefined number of leads. 15. The smart cable of claim 7, wherein the leads are arranged in four rows and seven columns for a total of 28 leads. 16. A method of in-circuit serial programming a microcontroller, comprising:
plugging a smart cable into an external device, the smart cable having the microcontroller embedded in a connector assembly of the smart cable; and performing serial programming of the microcontroller through one or more pins of the smart cable using the external device; wherein the connector assembly comprises a connector portion having a plurality of pins therein, a housing portion attached to and extending from the connector portion, and a printed circuit board disposed within the housing portion, the printed circuit board including a plurality of conductive contact pads and a plurality of conductive mounting pads formed thereon, each mounting pad being electrically connected to at least one of the contact pads; and wherein the microcontroller is mounted on the printed circuit board, the microcontroller having a plurality of conductive contacts electrically connected to the mounting pads of the printed circuit board, the conductive contacts including serial programming contacts that are required for serial programming of the microcontroller, the serial programming contacts being electrically connected to at least one of the contact pads. 17. The method of claim 16, wherein serial programming of the microcontroller comprises copying a program from a HEX file into a designated memory of the microcontroller through the connector assembly of the smart cable using the external device. | 2,100 |
4,467 | 15,176,351 | 2,111 | A bit interleaving method involves applying a bit permutation process to a QC-LDPC codeword made up of N cyclic blocks each including Q bits, and dividing the codeword after the permutation process into a plurality of constellation words each including M bits, the codeword being divided into F×N/M folding sections, each of the constellation words being associated with one of the F×N/M folding sections, and the bit permutation process being applied such that each of the constellation words includes F bits from each of M/F different cyclic blocks in a given folding section associated with a given constellation word. | 1. A bit interleaving method for interleaving bits of a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, the bit interleaving method comprising:
a cyclic block permutation step of applying a cyclic block permutation process to a codeword made up of N cyclic blocks each consisting of Q bits, to reorder the cyclic blocks in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; a bit permutation step of applying a bit permutation process to the codeword after the cyclic block permutation process, to reorder the bits of the codeword in accordance with a bit permutation rule defining a reordering of the bits; and a dividing step of dividing the codeword after the bit permutation process into a plurality of constellation words, each of the constellation words being made up of M bits, wherein N is not a multiple of M, the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule. 2. A bit interleaver for interleaving bits of a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, the bit interleaver comprising:
a cyclic block permutator applying a cyclic block permutation process to a codeword made up of N cyclic blocks each consisting of Q bits, to reorder the cyclic blocks in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; and a bit permutator applying a bit permutation process to the codeword after the cyclic block permutation process, to reorder the bits of the codeword in accordance with a bit permutation rule defining a reordering of the bits; and a divider dividing the codeword after the bit permutation process into a plurality of constellation words, each of the constellation words being made up of M bits, wherein N is not a multiple of M, the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule. 3. A signal processing method for processing a signal transmitted by modulating N×Q/M constellation words, the constellation words being generated by applying a bit reordering process to a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, and dividing bits of the codeword for each M bits, the codeword being made up of N cyclic blocks each including Q bits,
the bit reordering process comprising:
a cyclic block permutation process of reordering the cyclic blocks of the codeword in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; and
a bit permutation process of reordering the bits of the codeword after the cyclic block permutation process in accordance with a bit permutation rule defining a reordering of the bits, wherein
N is not a multiple of M,
the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and
the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule,
the signal processing method comprising:
a demodulating step of generating a demodulated signal by demodulating the signal, which has been transmitted by modulating the N×Q/M constellation words; and
a decoding step of decoding the demodulated signal in accordance with the cyclic block permutation rule and the bit permutation rule to generate data before coding according to the quasi-cyclic low-density parity check coding scheme. 4. A signal processor for processing a signal transmitted by modulating N×Q/M constellation words, the constellation words being generated by applying a bit reordering process to a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, and dividing bits of the codeword for each M bits, the codeword being made up of N cyclic blocks each including Q bits,
the bit reordering process comprising:
a cyclic block permutation process of reordering the cyclic blocks of the codeword in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; and
a bit permutation process of reordering the bits of the codeword after the cyclic block permutation process in accordance with a bit permutation rule defining a reordering of the bits, wherein
N is not a multiple of M,
the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and
the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule,
the signal processor comprising:
a demodulator generating a demodulated signal by demodulating the signal, which has been transmitted by modulating the N×Q/M constellation words; and
a decoder decoding the demodulated signal in accordance with the cyclic block permutation rule and the bit permutation rule to generate data before coding according to the quasi-cyclic low-density parity check coding scheme. | A bit interleaving method involves applying a bit permutation process to a QC-LDPC codeword made up of N cyclic blocks each including Q bits, and dividing the codeword after the permutation process into a plurality of constellation words each including M bits, the codeword being divided into F×N/M folding sections, each of the constellation words being associated with one of the F×N/M folding sections, and the bit permutation process being applied such that each of the constellation words includes F bits from each of M/F different cyclic blocks in a given folding section associated with a given constellation word.1. A bit interleaving method for interleaving bits of a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, the bit interleaving method comprising:
a cyclic block permutation step of applying a cyclic block permutation process to a codeword made up of N cyclic blocks each consisting of Q bits, to reorder the cyclic blocks in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; a bit permutation step of applying a bit permutation process to the codeword after the cyclic block permutation process, to reorder the bits of the codeword in accordance with a bit permutation rule defining a reordering of the bits; and a dividing step of dividing the codeword after the bit permutation process into a plurality of constellation words, each of the constellation words being made up of M bits, wherein N is not a multiple of M, the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule. 2. A bit interleaver for interleaving bits of a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, the bit interleaver comprising:
a cyclic block permutator applying a cyclic block permutation process to a codeword made up of N cyclic blocks each consisting of Q bits, to reorder the cyclic blocks in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; and a bit permutator applying a bit permutation process to the codeword after the cyclic block permutation process, to reorder the bits of the codeword in accordance with a bit permutation rule defining a reordering of the bits; and a divider dividing the codeword after the bit permutation process into a plurality of constellation words, each of the constellation words being made up of M bits, wherein N is not a multiple of M, the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule. 3. A signal processing method for processing a signal transmitted by modulating N×Q/M constellation words, the constellation words being generated by applying a bit reordering process to a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, and dividing bits of the codeword for each M bits, the codeword being made up of N cyclic blocks each including Q bits,
the bit reordering process comprising:
a cyclic block permutation process of reordering the cyclic blocks of the codeword in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; and
a bit permutation process of reordering the bits of the codeword after the cyclic block permutation process in accordance with a bit permutation rule defining a reordering of the bits, wherein
N is not a multiple of M,
the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and
the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule,
the signal processing method comprising:
a demodulating step of generating a demodulated signal by demodulating the signal, which has been transmitted by modulating the N×Q/M constellation words; and
a decoding step of decoding the demodulated signal in accordance with the cyclic block permutation rule and the bit permutation rule to generate data before coding according to the quasi-cyclic low-density parity check coding scheme. 4. A signal processor for processing a signal transmitted by modulating N×Q/M constellation words, the constellation words being generated by applying a bit reordering process to a codeword generated by using a repeat-accumulate quasi-cyclic low-density parity check coding scheme, parity portions of the codeword having been reordered by parity interleaving, and dividing bits of the codeword for each M bits, the codeword being made up of N cyclic blocks each including Q bits,
the bit reordering process comprising:
a cyclic block permutation process of reordering the cyclic blocks of the codeword in accordance with a cyclic block permutation rule defining a reordering of the cyclic blocks; and
a bit permutation process of reordering the bits of the codeword after the cyclic block permutation process in accordance with a bit permutation rule defining a reordering of the bits, wherein
N is not a multiple of M,
the bit permutation rule defines the reordering of the bits of the codeword after the cyclic block permutation process, such that the Q bits in each of the N′=N−X cyclic blocks are each allocated to a bit of an identical bit index in Q constellation words and the Q constellation words are each made up of one bit in each of M cyclic blocks, the M cyclic blocks being common to the Q constellation words, where X is a remainder of N divided by M, and
the bit index of the bit in each of the Q constellation words to which the bits in each of the N′=N−X cyclic blocks are each allocated is determined in accordance with the cyclic block permutation rule,
the signal processor comprising:
a demodulator generating a demodulated signal by demodulating the signal, which has been transmitted by modulating the N×Q/M constellation words; and
a decoder decoding the demodulated signal in accordance with the cyclic block permutation rule and the bit permutation rule to generate data before coding according to the quasi-cyclic low-density parity check coding scheme. | 2,100 |
4,468 | 14,076,572 | 2,139 | Apparatus and method for performing secure erasure of a processing device, such as a data storage device in an object storage system. In accordance with some embodiments, an apparatus is provided with a plurality of processing devices arranged within an enclosed housing and each having an associated memory. A mechanical switch is coupled to the enclosed housing. The associated memories of the processing devices are securely erased responsive to activation of the mechanical switch. | 1. An apparatus comprising:
a plurality of processing devices arranged within an enclosed housing each comprising an associated memory; and a mechanical switch coupled to the enclosed housing that securely erases the associated memory of each of the processing devices responsive to activation of the mechanical switch. 2. The apparatus of claim 1, wherein the switch is moveable between an active position and an inactive position, wherein movement of the switch to the active position generates an internal secure erasure activation signal, and wherein each of the processing devices securely erase the associated memories responsive to the secure erasure activation signal. 3. The apparatus of claim 1, wherein the processing devices each comprise a data storage device to store data objects in a storage node of an object storage system having a server which communicates with the storage node via network, wherein the associated memories of the data storage devices are securely erased responsive to both the activation of the switch and a receipt of an external secure erasure activation signal from the server within a predetermined time interval. 4. The apparatus of claim 1, wherein the processing devices each comprise a data storage device to store data objects in a storage node of an object storage system having an associated storage controller which communicates with a remote server via a network, wherein the associated memories of the data storage devices are securely erased responsive to both the activation of the switch and a receipt of an external secure erasure activation signal from the storage controller within a predetermined time interval. 5. The apparatus of claim 1, wherein the enclosed housing comprises a cover panel and the switch is located behind the cover panel within an interior of the enclosed housing, wherein the switch is activated by a user opening the cover panel and mechanically advancing the switch from a first position to a second position. 6. The apparatus of claim 5, further comprising a lock and key arrangement connected to the cover panel, wherein the user uses the key to unlock the lock and key arrangement to open the cover panel and access the switch. 7. The apparatus of claim 1, wherein the switch is characterized as a hardware switch which generates a first secure erasure activation signal responsive to movement of the switch from an inactive position to an active position, and wherein the apparatus further comprises a controller adapted to execute a software routine in a controller memory to activate a software switch responsive to a user input, wherein activation of the software switch generates a second secure activation signal to initiate the secure erasure of data in the associated memories of the processing devices. 8. The apparatus of claim 7, wherein a control circuit forwards a secure erasure command to the processing devices responsive to receipt of both the first and second secure erasure activation signals. 9. The apparatus of claim 8, wherein the control circuit comprises a timer which initiates a predetermined time interval responsive to receipt of a selected one of the first or second secure erasure activation signals, wherein the control circuit generates the secure erasure command responsive to receipt of the remaining one of the first or second erasure activation signals prior to a conclusion of the predetermined time interval, and wherein the control circuit does not generate the secure erasure command responsive to the control circuit not receiving the remaining one of the first or second erasure activation signals prior to the conclusion of the predetermined time interval. 10. The apparatus of claim 1, wherein the processing devices perform multiple data overwrite operations upon the associated memories to securely erase data stored therein. 11. The apparatus of claim 1, wherein the plurality of processing devices is a first group of processing devices within the enclosed housing, wherein the apparatus further comprises:
a second group of processing devices within the enclosed housing having associated memory; a software switch module configured to generate a software secure erasure activation signal that selectively identifies the first group of processing devices for erasure; and a control circuit which, responsive to activation of the mechanical switch and the software secure erasure activation signal, securely erases the first group of processing devices without securely erasing the second group of processing devices. 12. The apparatus of claim 1, wherein the processing devices perform a non-destructive secure erasure of the associated memories responsive to user activation of the hardware switch so that, at the conclusion of the non-destructive secure erasure, the memories remain usable for storage of subsequently presented data. 13. The apparatus of claim 1, wherein the processing devices perform a destructive secure erasure of the associated memories responsive to user activation of the hardware switch so that, at the conclusion of the destructive secure erasure, the memories are physically damaged so as to be unable to store subsequent data. 14. An apparatus comprising:
a plurality of data storage devices arranged within a housing each having a memory adapted to store data from a host device; a secure erasure hardware switch connected to the housing and configured to be manually moved between an inactive position and an active position, the secure erasure hardware switch generating a secure erasure signal responsive to manual movement of the switch to the active position; and a programmable processor disposed within the housing and having associated programming stored in a processor memory to issue a secure erasure command to each of the plurality of data storage devices responsive to the secure erasure signal, each of the plurality of data storage devices securely easing the associated memory thereof responsive to the secure erasure command. 15. The apparatus of claim 14, wherein the programmable processor is characterized as a storage enclosure processor, and the apparatus further comprises a host programmable processor and a memory which stores associated programming used by the host programmable processor to generate and transfer a software switch secure erasure signal to the storage processor, and wherein the storage enclosure processor further issues the secure erasure command to each of the plurality of data storage devices responsive to receipt of the software switch secure erasure signal. 16. The apparatus of claim 14, further comprising a secure erasure software switch comprising a software routine stored in a controller memory and executed by a controller to generate a second secure erasure signal, wherein the programmable processor issues the secure erasure command responsive to receipt of both the secure erasure signal and the second secure erasure signal within a predetermined time interval. 17. A computer implemented method comprising:
providing a storage enclosure comprising an enclosed housing, a processing device within the enclosed housing having an associated memory and a physical switch connected to an exterior of the enclosed housing; toggling the physical switch from an inactive position to an active position to generate a secure erasure activation signal; and securely erasing the associated memory of the processing device responsive to the secure erasure activation signal. 18. The method of claim 17, wherein the secure erasure activation signal is a hardware switch activation signal, and wherein the method further comprises generating a software switch activation signal using a software routine stored in a processor memory and executed by a programmable processor, wherein the secure erase command is further generated responsive to receipt of both the hardware switch activation signal and the software switch activation signal within a predetermined time interval. 19. The method of claim 17, further comprising removing the storage enclosure from a storage cabinet, and installing a new, replacement storage enclosure in the storage cabinet. 20. The method of claim 17, wherein the storage enclosure comprises a plurality of data storage devices each having associated memory arranged to store user data objects in an object storage system, wherein respective secure erasure commands are forwarded to each of the plurality of data storage devices responsive to the secure erasure activation signal, and wherein each of the associated memory of the plurality of data storage devices is securely erased responsive to the secure erasure commands. | Apparatus and method for performing secure erasure of a processing device, such as a data storage device in an object storage system. In accordance with some embodiments, an apparatus is provided with a plurality of processing devices arranged within an enclosed housing and each having an associated memory. A mechanical switch is coupled to the enclosed housing. The associated memories of the processing devices are securely erased responsive to activation of the mechanical switch.1. An apparatus comprising:
a plurality of processing devices arranged within an enclosed housing each comprising an associated memory; and a mechanical switch coupled to the enclosed housing that securely erases the associated memory of each of the processing devices responsive to activation of the mechanical switch. 2. The apparatus of claim 1, wherein the switch is moveable between an active position and an inactive position, wherein movement of the switch to the active position generates an internal secure erasure activation signal, and wherein each of the processing devices securely erase the associated memories responsive to the secure erasure activation signal. 3. The apparatus of claim 1, wherein the processing devices each comprise a data storage device to store data objects in a storage node of an object storage system having a server which communicates with the storage node via network, wherein the associated memories of the data storage devices are securely erased responsive to both the activation of the switch and a receipt of an external secure erasure activation signal from the server within a predetermined time interval. 4. The apparatus of claim 1, wherein the processing devices each comprise a data storage device to store data objects in a storage node of an object storage system having an associated storage controller which communicates with a remote server via a network, wherein the associated memories of the data storage devices are securely erased responsive to both the activation of the switch and a receipt of an external secure erasure activation signal from the storage controller within a predetermined time interval. 5. The apparatus of claim 1, wherein the enclosed housing comprises a cover panel and the switch is located behind the cover panel within an interior of the enclosed housing, wherein the switch is activated by a user opening the cover panel and mechanically advancing the switch from a first position to a second position. 6. The apparatus of claim 5, further comprising a lock and key arrangement connected to the cover panel, wherein the user uses the key to unlock the lock and key arrangement to open the cover panel and access the switch. 7. The apparatus of claim 1, wherein the switch is characterized as a hardware switch which generates a first secure erasure activation signal responsive to movement of the switch from an inactive position to an active position, and wherein the apparatus further comprises a controller adapted to execute a software routine in a controller memory to activate a software switch responsive to a user input, wherein activation of the software switch generates a second secure activation signal to initiate the secure erasure of data in the associated memories of the processing devices. 8. The apparatus of claim 7, wherein a control circuit forwards a secure erasure command to the processing devices responsive to receipt of both the first and second secure erasure activation signals. 9. The apparatus of claim 8, wherein the control circuit comprises a timer which initiates a predetermined time interval responsive to receipt of a selected one of the first or second secure erasure activation signals, wherein the control circuit generates the secure erasure command responsive to receipt of the remaining one of the first or second erasure activation signals prior to a conclusion of the predetermined time interval, and wherein the control circuit does not generate the secure erasure command responsive to the control circuit not receiving the remaining one of the first or second erasure activation signals prior to the conclusion of the predetermined time interval. 10. The apparatus of claim 1, wherein the processing devices perform multiple data overwrite operations upon the associated memories to securely erase data stored therein. 11. The apparatus of claim 1, wherein the plurality of processing devices is a first group of processing devices within the enclosed housing, wherein the apparatus further comprises:
a second group of processing devices within the enclosed housing having associated memory; a software switch module configured to generate a software secure erasure activation signal that selectively identifies the first group of processing devices for erasure; and a control circuit which, responsive to activation of the mechanical switch and the software secure erasure activation signal, securely erases the first group of processing devices without securely erasing the second group of processing devices. 12. The apparatus of claim 1, wherein the processing devices perform a non-destructive secure erasure of the associated memories responsive to user activation of the hardware switch so that, at the conclusion of the non-destructive secure erasure, the memories remain usable for storage of subsequently presented data. 13. The apparatus of claim 1, wherein the processing devices perform a destructive secure erasure of the associated memories responsive to user activation of the hardware switch so that, at the conclusion of the destructive secure erasure, the memories are physically damaged so as to be unable to store subsequent data. 14. An apparatus comprising:
a plurality of data storage devices arranged within a housing each having a memory adapted to store data from a host device; a secure erasure hardware switch connected to the housing and configured to be manually moved between an inactive position and an active position, the secure erasure hardware switch generating a secure erasure signal responsive to manual movement of the switch to the active position; and a programmable processor disposed within the housing and having associated programming stored in a processor memory to issue a secure erasure command to each of the plurality of data storage devices responsive to the secure erasure signal, each of the plurality of data storage devices securely easing the associated memory thereof responsive to the secure erasure command. 15. The apparatus of claim 14, wherein the programmable processor is characterized as a storage enclosure processor, and the apparatus further comprises a host programmable processor and a memory which stores associated programming used by the host programmable processor to generate and transfer a software switch secure erasure signal to the storage processor, and wherein the storage enclosure processor further issues the secure erasure command to each of the plurality of data storage devices responsive to receipt of the software switch secure erasure signal. 16. The apparatus of claim 14, further comprising a secure erasure software switch comprising a software routine stored in a controller memory and executed by a controller to generate a second secure erasure signal, wherein the programmable processor issues the secure erasure command responsive to receipt of both the secure erasure signal and the second secure erasure signal within a predetermined time interval. 17. A computer implemented method comprising:
providing a storage enclosure comprising an enclosed housing, a processing device within the enclosed housing having an associated memory and a physical switch connected to an exterior of the enclosed housing; toggling the physical switch from an inactive position to an active position to generate a secure erasure activation signal; and securely erasing the associated memory of the processing device responsive to the secure erasure activation signal. 18. The method of claim 17, wherein the secure erasure activation signal is a hardware switch activation signal, and wherein the method further comprises generating a software switch activation signal using a software routine stored in a processor memory and executed by a programmable processor, wherein the secure erase command is further generated responsive to receipt of both the hardware switch activation signal and the software switch activation signal within a predetermined time interval. 19. The method of claim 17, further comprising removing the storage enclosure from a storage cabinet, and installing a new, replacement storage enclosure in the storage cabinet. 20. The method of claim 17, wherein the storage enclosure comprises a plurality of data storage devices each having associated memory arranged to store user data objects in an object storage system, wherein respective secure erasure commands are forwarded to each of the plurality of data storage devices responsive to the secure erasure activation signal, and wherein each of the associated memory of the plurality of data storage devices is securely erased responsive to the secure erasure commands. | 2,100 |
4,469 | 13,705,318 | 2,131 | A data processing apparatus comprising: at least one initiator device for issuing transactions, a hierarchical memory system comprising a plurality of caches and a memory and memory access control circuitry. The initiator device identifies storage locations using virtual addresses and the memory system stores data using physical addresses, the memory access control circuitry is configured to control virtual address to physical address translations. The plurality of caches, comprise a first cache and a second cache. The first cache is configured to store a plurality of address translations of virtual to physical addresses that the initiator device has requested. The second cache is configured to store a plurality of address translations of virtual to physical addresses that it is predicted that the initiator device will subsequently request. The first and second cache are arranged in parallel with each other such that the first and second caches can be accessed during a same access cycle. | 1. A data processing apparatus comprising: at least one initiator device for issuing transactions, a hierarchical memory system comprising a plurality of caches and a memory and memory access control circuitry, said initiator device identifying storage locations using virtual addresses and said memory system storing data using physical addresses, said memory access control circuitry being configured to control virtual address to physical address translations; wherein
said plurality of caches, comprise a first cache and a second cache; said first cache being configured to store a plurality of address translations of virtual to physical addresses that said initiator device has requested; and said second cache being configured to store a plurality of address translations of virtual to physical addresses that it is predicted that said initiator device will subsequently request; wherein said first and second cache are arranged in parallel with each other such that said first and second caches can be accessed during a same access cycle. 2. A data processing apparatus according to claim 1, wherein
said memory access control circuitry is configured in response to receipt of a request for an address translation from said initiator device, to look for said translation in said first cache and said second cache and in response to said requested translation not being present, to retrieve said translation from a lower hierarchical data store and to retrieve a translation for a predicted subsequently required virtual address while accessing said lower hierarchical data store and to update said first cache with said retrieved translation and said second cache with said retrieved predicted subsequently required translation at a same time. 3. A data processing apparatus according to claim 1, wherein said first cache comprises a macro table lookaside buffer and said second cache comprises a prefetch buffer. 4. A data processing apparatus according to claim 1, wherein said first cache and said second cache comprise level two caches, said data processing apparatus comprising a level one cache comprising a micro table lookaside buffer, said memory being configured to store address lookup tables comprising virtual to physical address translations. 5. A data processing apparatus according to claim 1, wherein said memory access control circuitry is configured in response to detecting said requested translation in said second cache to transfer said translation to a same line of said first cache. 6. A data processing apparatus according to claim 1, said data processing to apparatus comprising a data processing apparatus configured to operate a double virtualisation system that uses a set of virtual addresses and a set of intermediate physical addresses, wherein an operating system operating on said data processing apparatus uses said set of virtual addresses and said intermediate set of physical addresses, and a hypervisor manages the memory space by translating said set of intermediate physical addresses to physical addresses, said data processing apparatus further comprising:
a third cache and a fourth cache; said third cache being configured to store a plurality of partial virtual to physical address translations, said partial translations comprising translations for higher bits of said addresses, said partial translations forming an input to a lookup to memory required for completing said translations; and said fourth cache being configured to store a plurality of partial translations of said intermediate physical addresses to corresponding physical addresses, said plurality of partial translations corresponding to results from lookup steps performed in lookup tables in said memory during said translation; wherein said memory access control circuitry is configured to store in said fourth cache a final step in said intermediate physical address to physical address translation at a same time as storing said partial translation in said third cache. 7. A data processing apparatus according to claim 6, wherein said third cache comprises a walk cache and said fourth cache comprises an IPA2PA translation lookaside buffer. 8. A data processing apparatus according to claim 1 wherein said first and second caches each comprises a four set associative RAMs. 9. A data processing apparatus according to claim 5, wherein said first, second, third and fourth caches are formed from two RAMs, said first and second caches being on different RAMs and said third and fourth caches being on different RAMs. 10. A data processing apparatus according to claim 1, wherein said memory access control circuitry is configured to detect a request to invalidate a set of translations for a context and in response to detection of said invalidate request to perform said invalidation and while said invalidation is pending:
to determine whether any update or lookup requests for said context to be invalidated are received; and in response to detecting a lookup request said memory access control circuitry is configured to signal a miss in said plurality of caches without performing said lookup; and in response to detecting an update request said memory access control circuitry is configured to transmit an accept reply to said update request and not perform said update. 11. A data processing apparatus comprising: a initiator device for issuing a stream of transaction requests, a hierarchical memory system comprising a plurality of caches and a memory and memory access control circuitry, wherein said initiator device identifies storage locations using virtual addresses and said memory system stores data using physical addresses, said memory access control circuitry being configured to control virtual address to physical address translations; wherein
said memory access control circuitry is configured to detect a request to invalidate a set of virtual to physical address translations for a context and in response to detection of said invalidate request to perform said invalidation and while said invalidation is pending: to determine whether any update or lookup requests for said context are received; and in response to detecting a lookup request said memory access control circuitry is configured to signal a miss in said plurality of caches without performing said lookup; and in response to detecting an update request said memory access control circuitry is configured to transmit an accept update request reply and not perform said update. 12. A method of storing virtual to physical address translations in a plurality of caches comprising the steps of:
receiving a request for a virtual to physical address translation from an initiator device; in response to determining that said address translation is not stored in one of said plurality of caches; retrieving said translation from a lower hierarchical data store and also retrieving a translation for a predicted subsequent virtual address; updating a first cache with said retrieved translation; and updating a second cache with said retrieved predicted subsequent translation in a same access cycle. 13. A method according to claim 12, wherein said first cache comprises a macro table lookaside buffer and said second cache comprises a prefetch buffer. 14. A method according to claim 13, wherein said first cache and said second cache comprise level two caches, and said lower hierarchical data store comprises a memory storing address lookup tables comprising virtual to physical address translations. 15. A method according to claim 12, wherein the address translations are for addresses in a double virtualisation system that uses a set of virtual addresses and a set of intermediate physical addresses, an operating system operating on a data processing apparatus using said set of virtual addresses and said intermediate set of physical addresses, and a hypervisor managing the memory space by translating the set of intermediate physical addresses to physical addresses with said data processing apparatus the method further comprising:
storing in a third cache at least one partial virtual to intermediate physical address translation, said partial translation comprising a translation for higher bits of said addresses, said partial translation forming an input to a lookup to memory required for completing said translation; and in a same step storing in a fourth cache a a final step in said intermediate physical address to physical address translation. 16. A method according to claim 15, wherein said third cache comprises a walk to cache and said fourth cache comprises an IPA2PA translation lookaside buffer. 17. A method according to claim 12, comprising a further step of:
detecting a request from said initiator device to invalidate a set of translations for a context; responding to said request by performing said invalidation and while said invalidation is pending:
determining whether any update or lookup requests for said context are received; and
in response to detecting a lookup request, signalling a miss in said plurality of caches without performing said lookup; and
in response to detecting an update request transmitting an accept reply to said update request and not performing said update. 18. A data processing apparatus comprising: at least one initiator means for issuing transactions, a hierarchical memory system comprising a plurality of caches and a memory and memory access control means, said initiator means identifying storage locations using virtual addresses and said memory system storing data using physical addresses, said memory access control means being for controlling virtual address to physical address translations; wherein
said plurality of caches, comprise a first caching means and a second caching means; said first caching means being for storing a plurality of address translations of virtual to physical addresses that said initiator means has requested; and said second caching means being for storing a plurality of address translations of virtual to physical addresses that it is predicted that said initiator device will subsequently request; wherein said first and second caching means are arranged in parallel with each other such that said first and second caching means can be accessed during a same access cycle. | A data processing apparatus comprising: at least one initiator device for issuing transactions, a hierarchical memory system comprising a plurality of caches and a memory and memory access control circuitry. The initiator device identifies storage locations using virtual addresses and the memory system stores data using physical addresses, the memory access control circuitry is configured to control virtual address to physical address translations. The plurality of caches, comprise a first cache and a second cache. The first cache is configured to store a plurality of address translations of virtual to physical addresses that the initiator device has requested. The second cache is configured to store a plurality of address translations of virtual to physical addresses that it is predicted that the initiator device will subsequently request. The first and second cache are arranged in parallel with each other such that the first and second caches can be accessed during a same access cycle.1. A data processing apparatus comprising: at least one initiator device for issuing transactions, a hierarchical memory system comprising a plurality of caches and a memory and memory access control circuitry, said initiator device identifying storage locations using virtual addresses and said memory system storing data using physical addresses, said memory access control circuitry being configured to control virtual address to physical address translations; wherein
said plurality of caches, comprise a first cache and a second cache; said first cache being configured to store a plurality of address translations of virtual to physical addresses that said initiator device has requested; and said second cache being configured to store a plurality of address translations of virtual to physical addresses that it is predicted that said initiator device will subsequently request; wherein said first and second cache are arranged in parallel with each other such that said first and second caches can be accessed during a same access cycle. 2. A data processing apparatus according to claim 1, wherein
said memory access control circuitry is configured in response to receipt of a request for an address translation from said initiator device, to look for said translation in said first cache and said second cache and in response to said requested translation not being present, to retrieve said translation from a lower hierarchical data store and to retrieve a translation for a predicted subsequently required virtual address while accessing said lower hierarchical data store and to update said first cache with said retrieved translation and said second cache with said retrieved predicted subsequently required translation at a same time. 3. A data processing apparatus according to claim 1, wherein said first cache comprises a macro table lookaside buffer and said second cache comprises a prefetch buffer. 4. A data processing apparatus according to claim 1, wherein said first cache and said second cache comprise level two caches, said data processing apparatus comprising a level one cache comprising a micro table lookaside buffer, said memory being configured to store address lookup tables comprising virtual to physical address translations. 5. A data processing apparatus according to claim 1, wherein said memory access control circuitry is configured in response to detecting said requested translation in said second cache to transfer said translation to a same line of said first cache. 6. A data processing apparatus according to claim 1, said data processing to apparatus comprising a data processing apparatus configured to operate a double virtualisation system that uses a set of virtual addresses and a set of intermediate physical addresses, wherein an operating system operating on said data processing apparatus uses said set of virtual addresses and said intermediate set of physical addresses, and a hypervisor manages the memory space by translating said set of intermediate physical addresses to physical addresses, said data processing apparatus further comprising:
a third cache and a fourth cache; said third cache being configured to store a plurality of partial virtual to physical address translations, said partial translations comprising translations for higher bits of said addresses, said partial translations forming an input to a lookup to memory required for completing said translations; and said fourth cache being configured to store a plurality of partial translations of said intermediate physical addresses to corresponding physical addresses, said plurality of partial translations corresponding to results from lookup steps performed in lookup tables in said memory during said translation; wherein said memory access control circuitry is configured to store in said fourth cache a final step in said intermediate physical address to physical address translation at a same time as storing said partial translation in said third cache. 7. A data processing apparatus according to claim 6, wherein said third cache comprises a walk cache and said fourth cache comprises an IPA2PA translation lookaside buffer. 8. A data processing apparatus according to claim 1 wherein said first and second caches each comprises a four set associative RAMs. 9. A data processing apparatus according to claim 5, wherein said first, second, third and fourth caches are formed from two RAMs, said first and second caches being on different RAMs and said third and fourth caches being on different RAMs. 10. A data processing apparatus according to claim 1, wherein said memory access control circuitry is configured to detect a request to invalidate a set of translations for a context and in response to detection of said invalidate request to perform said invalidation and while said invalidation is pending:
to determine whether any update or lookup requests for said context to be invalidated are received; and in response to detecting a lookup request said memory access control circuitry is configured to signal a miss in said plurality of caches without performing said lookup; and in response to detecting an update request said memory access control circuitry is configured to transmit an accept reply to said update request and not perform said update. 11. A data processing apparatus comprising: a initiator device for issuing a stream of transaction requests, a hierarchical memory system comprising a plurality of caches and a memory and memory access control circuitry, wherein said initiator device identifies storage locations using virtual addresses and said memory system stores data using physical addresses, said memory access control circuitry being configured to control virtual address to physical address translations; wherein
said memory access control circuitry is configured to detect a request to invalidate a set of virtual to physical address translations for a context and in response to detection of said invalidate request to perform said invalidation and while said invalidation is pending: to determine whether any update or lookup requests for said context are received; and in response to detecting a lookup request said memory access control circuitry is configured to signal a miss in said plurality of caches without performing said lookup; and in response to detecting an update request said memory access control circuitry is configured to transmit an accept update request reply and not perform said update. 12. A method of storing virtual to physical address translations in a plurality of caches comprising the steps of:
receiving a request for a virtual to physical address translation from an initiator device; in response to determining that said address translation is not stored in one of said plurality of caches; retrieving said translation from a lower hierarchical data store and also retrieving a translation for a predicted subsequent virtual address; updating a first cache with said retrieved translation; and updating a second cache with said retrieved predicted subsequent translation in a same access cycle. 13. A method according to claim 12, wherein said first cache comprises a macro table lookaside buffer and said second cache comprises a prefetch buffer. 14. A method according to claim 13, wherein said first cache and said second cache comprise level two caches, and said lower hierarchical data store comprises a memory storing address lookup tables comprising virtual to physical address translations. 15. A method according to claim 12, wherein the address translations are for addresses in a double virtualisation system that uses a set of virtual addresses and a set of intermediate physical addresses, an operating system operating on a data processing apparatus using said set of virtual addresses and said intermediate set of physical addresses, and a hypervisor managing the memory space by translating the set of intermediate physical addresses to physical addresses with said data processing apparatus the method further comprising:
storing in a third cache at least one partial virtual to intermediate physical address translation, said partial translation comprising a translation for higher bits of said addresses, said partial translation forming an input to a lookup to memory required for completing said translation; and in a same step storing in a fourth cache a a final step in said intermediate physical address to physical address translation. 16. A method according to claim 15, wherein said third cache comprises a walk to cache and said fourth cache comprises an IPA2PA translation lookaside buffer. 17. A method according to claim 12, comprising a further step of:
detecting a request from said initiator device to invalidate a set of translations for a context; responding to said request by performing said invalidation and while said invalidation is pending:
determining whether any update or lookup requests for said context are received; and
in response to detecting a lookup request, signalling a miss in said plurality of caches without performing said lookup; and
in response to detecting an update request transmitting an accept reply to said update request and not performing said update. 18. A data processing apparatus comprising: at least one initiator means for issuing transactions, a hierarchical memory system comprising a plurality of caches and a memory and memory access control means, said initiator means identifying storage locations using virtual addresses and said memory system storing data using physical addresses, said memory access control means being for controlling virtual address to physical address translations; wherein
said plurality of caches, comprise a first caching means and a second caching means; said first caching means being for storing a plurality of address translations of virtual to physical addresses that said initiator means has requested; and said second caching means being for storing a plurality of address translations of virtual to physical addresses that it is predicted that said initiator device will subsequently request; wherein said first and second caching means are arranged in parallel with each other such that said first and second caching means can be accessed during a same access cycle. | 2,100 |
4,470 | 13,891,541 | 2,131 | One aspect provides an apparatus including: at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code including: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. Other aspects are described and claimed. | 1. An apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. 2. The apparatus of claim 1, wherein the first cache is a tag cache. 3. The apparatus of claim 2, wherein the second cache is a primary cache. 4. The apparatus of claim 3, wherein the primary cache is an off-chip cache. 5. The apparatus of claim 1, wherein the information pertaining to the first cache is stored in the second cache. 6. The apparatus of claim 5, wherein the information pertaining to the first cache is stored in the second cache as a tag tracking bit. 7. The apparatus of claim 6, wherein at least one tag tracking bit is stored per entry in the second cache. 8. The apparatus of claim 1, wherein the information pertaining to the first cache is least recently used information regarding one or more entries in the tag cache. 9. The apparatus of claim 1, wherein:
the information pertaining to the first cache indicates an entry is not present in the tag cache; and further comprising computer readable program code configured to select the entry not present in the tag cache for replacement in the second cache with the data from memory. 10. The apparatus of claim 9, further comprising computer readable program code configured to:
responsive to replacing the entry in the primary cache not present in the tag cache, update the tag cache with the entry; and update the least recently used information of the tag cache. 11. A computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. | One aspect provides an apparatus including: at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code including: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. Other aspects are described and claimed.1. An apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. 2. The apparatus of claim 1, wherein the first cache is a tag cache. 3. The apparatus of claim 2, wherein the second cache is a primary cache. 4. The apparatus of claim 3, wherein the primary cache is an off-chip cache. 5. The apparatus of claim 1, wherein the information pertaining to the first cache is stored in the second cache. 6. The apparatus of claim 5, wherein the information pertaining to the first cache is stored in the second cache as a tag tracking bit. 7. The apparatus of claim 6, wherein at least one tag tracking bit is stored per entry in the second cache. 8. The apparatus of claim 1, wherein the information pertaining to the first cache is least recently used information regarding one or more entries in the tag cache. 9. The apparatus of claim 1, wherein:
the information pertaining to the first cache indicates an entry is not present in the tag cache; and further comprising computer readable program code configured to select the entry not present in the tag cache for replacement in the second cache with the data from memory. 10. The apparatus of claim 9, further comprising computer readable program code configured to:
responsive to replacing the entry in the primary cache not present in the tag cache, update the tag cache with the entry; and update the least recently used information of the tag cache. 11. A computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. | 2,100 |
4,471 | 13,849,775 | 2,131 | One aspect provides a method including: responsive to a request for data and a miss in both a first cache and a second cache, retrieving the data from memory, the first cache storing at least a subset of data stored in the second cache; inferring from information pertaining to the first cache a replacement entry in the second cache; and responsive to inferring from information pertaining to the first cache a replacement entry in the second cache, replacing an entry in the second cache with the data from memory. Other aspects are described and claimed. | 1. A method comprising:
responsive to a request for data and a miss in both a first cache and a second cache, retrieving the data from memory, the first cache storing at least a subset of data stored in the second cache; inferring from information pertaining to the first cache a replacement entry in the second cache; and responsive to inferring from information pertaining to the first cache a replacement entry in the second cache, replacing an entry it the second cache with the data from memory. 2. The method of claim 1, wherein the first cache is a tag cache. 3. The method of claim 2, wherein the second cache is primary cache. 4. The method of claim 3, wherein the primary cache is an off-chip cache. 5. The method of claim 1, wherein the information pertaining to the first cache is stored in the second cache. 6. The method of claim 5, wherein the information pertaining to the first cache is stored in the second cache as a tag tracking bit. 7. The method of claim 6, wherein at least one tag tracking bit is stored per entry in the second cache. 8. The method of claim 1, wherein the information pertaining to the first cache is least recently used information regarding one or more entries in the tag cache. 9. The method of claim 1, wherein:
the information pertaining to the first cache indicates an entry is not present in the tag caches; and further comprising selecting the entry not present in the tag cache for replacement in the second cache with the data from memory. 10-20. (canceled) | One aspect provides a method including: responsive to a request for data and a miss in both a first cache and a second cache, retrieving the data from memory, the first cache storing at least a subset of data stored in the second cache; inferring from information pertaining to the first cache a replacement entry in the second cache; and responsive to inferring from information pertaining to the first cache a replacement entry in the second cache, replacing an entry in the second cache with the data from memory. Other aspects are described and claimed.1. A method comprising:
responsive to a request for data and a miss in both a first cache and a second cache, retrieving the data from memory, the first cache storing at least a subset of data stored in the second cache; inferring from information pertaining to the first cache a replacement entry in the second cache; and responsive to inferring from information pertaining to the first cache a replacement entry in the second cache, replacing an entry it the second cache with the data from memory. 2. The method of claim 1, wherein the first cache is a tag cache. 3. The method of claim 2, wherein the second cache is primary cache. 4. The method of claim 3, wherein the primary cache is an off-chip cache. 5. The method of claim 1, wherein the information pertaining to the first cache is stored in the second cache. 6. The method of claim 5, wherein the information pertaining to the first cache is stored in the second cache as a tag tracking bit. 7. The method of claim 6, wherein at least one tag tracking bit is stored per entry in the second cache. 8. The method of claim 1, wherein the information pertaining to the first cache is least recently used information regarding one or more entries in the tag cache. 9. The method of claim 1, wherein:
the information pertaining to the first cache indicates an entry is not present in the tag caches; and further comprising selecting the entry not present in the tag cache for replacement in the second cache with the data from memory. 10-20. (canceled) | 2,100 |
4,472 | 13,077,862 | 2,174 | An electronic device with a display and a touch-sensitive surface stores a document having primary content, supplementary content, and user-generated content. The device displays a representation of the document in a segmented user interface on the display. Primary content of the document is displayed in a first segment of the segmented user interface and supplementary content of the document is concurrently displayed in a second segment of the segmented user interface distinct from the first segment. The device receives a request to view user-generated content of the document. In response to the request, the device maintains display of the previously displayed primary content, ceases to display at least a portion of the previously displayed supplementary content, and displays user-generated content of the document in a third segment of the segmented user interface distinct from the first segment and the second segment. | 1. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
storing a document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type;
displaying at least a portion of the document on the display;
detecting a first gesture on the touch-sensitive surface; and
in response to detecting the first gesture:
in accordance with a determination that the first gesture is a single contact gesture, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. 2. The device of claim 1, wherein the first feature type is a page or a page break. 3. The device of claim 1, wherein the second feature type is one of: a section, a section break, a chapter, a chapter break or an annotation. 4. The device of claim 1, wherein the first gesture is a swipe gesture. 5. The device of claim 1, wherein the multi-contact gesture is a two contact swipe gesture and the second type of feature is a section break. 6. The device of claim 1, wherein the multi-contact gesture is a two contact swipe gesture and the second type of feature is a chapter break. 7. The device of claim 1, wherein the multi-contact gesture is a three contact swipe gesture and the second type of feature is an annotation. 8. The device of claim 1, wherein:
the first gesture has a direction; in accordance with a determination that the direction of the gesture includes a component in a first direction, the sequentially adjacent feature is an immediately subsequent feature; and in accordance with a determination that the direction of the gesture includes a component in a second direction that is opposite to the first direction, the sequentially adjacent feature is an immediately preceding feature. 9. A method, comprising:
at an electronic device having a display and a touch-sensitive surface:
storing a document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type;
displaying at least a portion of the document on the display;
detecting a first gesture on the touch-sensitive surface; and
in response to detecting the first gesture:
in accordance with a determination that the first gesture is a single contact gesture, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. 10. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which, when executed by an electronic device with a display and a touch-sensitive surface, cause the device to:
store a document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type; display at least a portion of the document on the display; detect a first gesture on the touch-sensitive surface; and in response to detecting the first gesture:
in accordance with a determination that the first gesture is a single contact gesture, navigate to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, navigate to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. 11. A graphical user interface on an electronic device with a display, a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
display of at least a portion of a document, the document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type; wherein, in response to detecting a first gesture on the touch-sensitive surface:
in accordance with a determination that the first gesture is a single contact gesture, the document is navigated to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, the document is navigated to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. | An electronic device with a display and a touch-sensitive surface stores a document having primary content, supplementary content, and user-generated content. The device displays a representation of the document in a segmented user interface on the display. Primary content of the document is displayed in a first segment of the segmented user interface and supplementary content of the document is concurrently displayed in a second segment of the segmented user interface distinct from the first segment. The device receives a request to view user-generated content of the document. In response to the request, the device maintains display of the previously displayed primary content, ceases to display at least a portion of the previously displayed supplementary content, and displays user-generated content of the document in a third segment of the segmented user interface distinct from the first segment and the second segment.1. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
storing a document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type;
displaying at least a portion of the document on the display;
detecting a first gesture on the touch-sensitive surface; and
in response to detecting the first gesture:
in accordance with a determination that the first gesture is a single contact gesture, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. 2. The device of claim 1, wherein the first feature type is a page or a page break. 3. The device of claim 1, wherein the second feature type is one of: a section, a section break, a chapter, a chapter break or an annotation. 4. The device of claim 1, wherein the first gesture is a swipe gesture. 5. The device of claim 1, wherein the multi-contact gesture is a two contact swipe gesture and the second type of feature is a section break. 6. The device of claim 1, wherein the multi-contact gesture is a two contact swipe gesture and the second type of feature is a chapter break. 7. The device of claim 1, wherein the multi-contact gesture is a three contact swipe gesture and the second type of feature is an annotation. 8. The device of claim 1, wherein:
the first gesture has a direction; in accordance with a determination that the direction of the gesture includes a component in a first direction, the sequentially adjacent feature is an immediately subsequent feature; and in accordance with a determination that the direction of the gesture includes a component in a second direction that is opposite to the first direction, the sequentially adjacent feature is an immediately preceding feature. 9. A method, comprising:
at an electronic device having a display and a touch-sensitive surface:
storing a document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type;
displaying at least a portion of the document on the display;
detecting a first gesture on the touch-sensitive surface; and
in response to detecting the first gesture:
in accordance with a determination that the first gesture is a single contact gesture, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, navigating to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. 10. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which, when executed by an electronic device with a display and a touch-sensitive surface, cause the device to:
store a document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type; display at least a portion of the document on the display; detect a first gesture on the touch-sensitive surface; and in response to detecting the first gesture:
in accordance with a determination that the first gesture is a single contact gesture, navigate to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, navigate to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. 11. A graphical user interface on an electronic device with a display, a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
display of at least a portion of a document, the document having a plurality of features having respective locations within the document, the plurality of features including features of a first feature type in a first sequence and features of a second feature type in a second sequence, wherein the second feature type is distinct from the first feature type; wherein, in response to detecting a first gesture on the touch-sensitive surface:
in accordance with a determination that the first gesture is a single contact gesture, the document is navigated to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the first feature type in the document; and
in accordance with a determination that the first gesture is a multi-contact gesture with a first predefined number of contacts, the document is navigated to a portion of the document that includes or is located proximate to a sequentially adjacent feature of the second feature type in the document. | 2,100 |
4,473 | 13,664,846 | 2,159 | A system may receive, at least in part from an update database, a plurality of updates to a plurality of profiles that individually describe ones of a plurality of users of a social network. The system may process, using a batch processor, at least some of the plurality of updates to generate a consolidated update indicative of a status of at least some of the plurality of profiles. The system may transmit the consolidated update to the update database. The system may display the consolidated update on an update stream of the social network corresponding to at least one of the plurality of users. | 1. A memory device, the memory device communicatively coupled to a processor and comprising instructions which, when performed on the processor, cause the processor to:
receive, at least in part from an update database, a plurality of updates to a plurality of profiles that individually describe ones of a plurality of users of a social network; process, using a batch processor, at least some of the plurality of updates to generate a consolidated update indicative of a status of at least some of the plurality of profiles; transmit the consolidated update to the update database; and display the consolidated update on an update stream of the social network corresponding to at least one of the plurality of users. 2. The memory device of claim 1, wherein the consolidated update is indicative of a change in status of the at least some of the plurality of profiles. 3. The memory device of claim 1, wherein the consolidated update is indicative of a similar status of the at least some of the plurality of profiles. 4. The memory device of claim 1, wherein the batch processor is configured to concurrently generate a plurality of consolidated updates, each of the plurality of consolidated updates based on at least some of the plurality of updates. 5. The memory device of claim 1, wherein the plurality of updates are received via a web-based user interface, wherein the consolidated update is displayed on the web-based user interface, and wherein the batch processor is a component of an offline system. 6. The memory device of claim 5, wherein the web-based user interface and the update database are components of an online system communicatively coupled to the offline system, and wherein the memory device further comprises instructions to cause the processor to:
store the plurality of updates in a file system of the offline system, wherein the batch processor processes the at least some of the plurality of updates from the file system of the offline system. 7. The memory device of claim 6, wherein the memory device further comprises instructions to cause the processor to:
display the consolidated update on an update stream of the social network based, at least in part, on: a lack of duplication of the consolidated update with other updates in the update stream; and a conformity of the consolidated update with a business rule. 8. The memory device of claim 7, wherein the memory device further comprises instructions to cause the processor to:
determine the lack of duplication of the consolidated update based, at least in part, on a characteristic of the consolidated update in comparison with a characteristic of the update stream corresponding to the at least one of the plurality of users of the social network. 9. The memory device of claim 7, wherein the business rule comprises a restriction on displaying the consolidated update on the update stream based on a personal characteristic of the at least one of the plurality of users of the social network. 10. A memory device, the memory device communicatively coupled to a processor and comprising instructions which, when performed on the processor, cause the processor to:
receive a plurality of interactions with a social network; process, using a batch processor, at least some of the plurality of interactions to generate a consolidated update indicative of interactions with at least some of a plurality of profiles of the social network; display the consolidated update on an update stream of the social network. 11. The memory device of claim 10, wherein the plurality of interactions include at least some of:
an update to a profile of the social network; a common status of the plurality of profiles; an interaction between a plurality of users of the social network; a reference to the profile; and a view of the profile by a third-party user. 12. The memory device of claim 11, wherein the consolidated update is indicative of a change in status of the at least some of the plurality of profiles. 13. The memory device of claim 11, wherein the consolidated update is indicative of a similar status of the at least some of the plurality of profiles. 14. The memory device of claim 11, wherein the batch processor is configured to concurrently generate a plurality of consolidated updates, each of the plurality of consolidated updates based on at least some of the plurality of updates. 15. The memory device of claim 11, wherein the plurality of updates are received via a web-based user interface, wherein the consolidated update is displayed on the web-based user interface, and wherein the batch processor is a component of an offline system. 16. The memory device of claim 15, wherein the web-based user interface and the update database are components of an online system communicatively coupled to the offline system, and wherein the memory device further comprises instructions to cause the processor to:
store the plurality of updates in a file system of the offline system, wherein the batch processor processes the at least some of the plurality of updates from the file system of the offline system. 17. The memory device of claim 16, wherein the memory device further comprises instructions to cause the processor to:
display the consolidated update on an update stream of the social network based, at least in part, on: a lack of duplication of the consolidated update with other updates in the update stream; and a conformity of the consolidated update with a business rule. 18. The memory device of claim 17, wherein the memory device further comprises instructions to cause the processor to:
determine the lack of duplication of the consolidated update based, at least in part, on a characteristic of the consolidated update in comparison with a characteristic of the update stream corresponding to the at least one of the plurality of users of the social network. 19. The memory device of claim 17, wherein the business rule comprises a restriction on displaying the consolidated update on the update stream based on a personal characteristic of the at least one of the plurality of users of the social network. 20. A system comprising:
a receiver module configured to receive a plurality of updates to a plurality of profiles that individually describe ones of a plurality of users on a social network; a batch processor configured to process at least some of the plurality of updates to generate a consolidated update indicative of a status of at least some of the plurality of profiles; a display module configured to display the consolidated update on an update stream of the social network corresponding to at least one of the plurality of users. 21. The system of claim 20, wherein the consolidated update is indicative of a change in status of the at least some of the plurality of profiles. 22. The system of claim 20, wherein the consolidated update is indicative of a similar status of the at least some of the plurality of profiles. 23. The system of claim 20, wherein the batch processor is configured to concurrently generate a plurality of consolidated updates, each of the plurality of consolidated updates based on at least some of the plurality of updates. 24. The system of claim 20, further comprising:
a web-based user interface configured to receive the plurality of updates and display the consolidated update; and an offline system comprising the batch processor. 25. The system of claim 24, further comprising an online system comprising the web-based user interface and the update database, the online system being communicatively coupled to the offline system, and wherein the offline system further comprises a file system configured to store the plurality of updates, wherein the batch processor processes the at least some of the plurality of updates from the file system. 26. The system of claim 25, wherein the batch processor is further configured to cause the display module to display the consolidated update on an update stream of the social network based, at least in part, on:
a lack of duplication of the consolidated update with other updates in the update stream; and a conformity of the consolidated update with a business rule. 27. The system of claim 26, wherein the batch processor is further configured to determine the lack of duplication of the consolidated update based, at least in part, on a characteristic of the consolidated update in comparison with a characteristic of the update stream corresponding to the at least one of the plurality of users of the social network. 28. The system of claim 26, wherein the business rule comprises a restriction on displaying the consolidated update on the update stream based on a personal characteristic of the at least one of the plurality of users of the social network. | A system may receive, at least in part from an update database, a plurality of updates to a plurality of profiles that individually describe ones of a plurality of users of a social network. The system may process, using a batch processor, at least some of the plurality of updates to generate a consolidated update indicative of a status of at least some of the plurality of profiles. The system may transmit the consolidated update to the update database. The system may display the consolidated update on an update stream of the social network corresponding to at least one of the plurality of users.1. A memory device, the memory device communicatively coupled to a processor and comprising instructions which, when performed on the processor, cause the processor to:
receive, at least in part from an update database, a plurality of updates to a plurality of profiles that individually describe ones of a plurality of users of a social network; process, using a batch processor, at least some of the plurality of updates to generate a consolidated update indicative of a status of at least some of the plurality of profiles; transmit the consolidated update to the update database; and display the consolidated update on an update stream of the social network corresponding to at least one of the plurality of users. 2. The memory device of claim 1, wherein the consolidated update is indicative of a change in status of the at least some of the plurality of profiles. 3. The memory device of claim 1, wherein the consolidated update is indicative of a similar status of the at least some of the plurality of profiles. 4. The memory device of claim 1, wherein the batch processor is configured to concurrently generate a plurality of consolidated updates, each of the plurality of consolidated updates based on at least some of the plurality of updates. 5. The memory device of claim 1, wherein the plurality of updates are received via a web-based user interface, wherein the consolidated update is displayed on the web-based user interface, and wherein the batch processor is a component of an offline system. 6. The memory device of claim 5, wherein the web-based user interface and the update database are components of an online system communicatively coupled to the offline system, and wherein the memory device further comprises instructions to cause the processor to:
store the plurality of updates in a file system of the offline system, wherein the batch processor processes the at least some of the plurality of updates from the file system of the offline system. 7. The memory device of claim 6, wherein the memory device further comprises instructions to cause the processor to:
display the consolidated update on an update stream of the social network based, at least in part, on: a lack of duplication of the consolidated update with other updates in the update stream; and a conformity of the consolidated update with a business rule. 8. The memory device of claim 7, wherein the memory device further comprises instructions to cause the processor to:
determine the lack of duplication of the consolidated update based, at least in part, on a characteristic of the consolidated update in comparison with a characteristic of the update stream corresponding to the at least one of the plurality of users of the social network. 9. The memory device of claim 7, wherein the business rule comprises a restriction on displaying the consolidated update on the update stream based on a personal characteristic of the at least one of the plurality of users of the social network. 10. A memory device, the memory device communicatively coupled to a processor and comprising instructions which, when performed on the processor, cause the processor to:
receive a plurality of interactions with a social network; process, using a batch processor, at least some of the plurality of interactions to generate a consolidated update indicative of interactions with at least some of a plurality of profiles of the social network; display the consolidated update on an update stream of the social network. 11. The memory device of claim 10, wherein the plurality of interactions include at least some of:
an update to a profile of the social network; a common status of the plurality of profiles; an interaction between a plurality of users of the social network; a reference to the profile; and a view of the profile by a third-party user. 12. The memory device of claim 11, wherein the consolidated update is indicative of a change in status of the at least some of the plurality of profiles. 13. The memory device of claim 11, wherein the consolidated update is indicative of a similar status of the at least some of the plurality of profiles. 14. The memory device of claim 11, wherein the batch processor is configured to concurrently generate a plurality of consolidated updates, each of the plurality of consolidated updates based on at least some of the plurality of updates. 15. The memory device of claim 11, wherein the plurality of updates are received via a web-based user interface, wherein the consolidated update is displayed on the web-based user interface, and wherein the batch processor is a component of an offline system. 16. The memory device of claim 15, wherein the web-based user interface and the update database are components of an online system communicatively coupled to the offline system, and wherein the memory device further comprises instructions to cause the processor to:
store the plurality of updates in a file system of the offline system, wherein the batch processor processes the at least some of the plurality of updates from the file system of the offline system. 17. The memory device of claim 16, wherein the memory device further comprises instructions to cause the processor to:
display the consolidated update on an update stream of the social network based, at least in part, on: a lack of duplication of the consolidated update with other updates in the update stream; and a conformity of the consolidated update with a business rule. 18. The memory device of claim 17, wherein the memory device further comprises instructions to cause the processor to:
determine the lack of duplication of the consolidated update based, at least in part, on a characteristic of the consolidated update in comparison with a characteristic of the update stream corresponding to the at least one of the plurality of users of the social network. 19. The memory device of claim 17, wherein the business rule comprises a restriction on displaying the consolidated update on the update stream based on a personal characteristic of the at least one of the plurality of users of the social network. 20. A system comprising:
a receiver module configured to receive a plurality of updates to a plurality of profiles that individually describe ones of a plurality of users on a social network; a batch processor configured to process at least some of the plurality of updates to generate a consolidated update indicative of a status of at least some of the plurality of profiles; a display module configured to display the consolidated update on an update stream of the social network corresponding to at least one of the plurality of users. 21. The system of claim 20, wherein the consolidated update is indicative of a change in status of the at least some of the plurality of profiles. 22. The system of claim 20, wherein the consolidated update is indicative of a similar status of the at least some of the plurality of profiles. 23. The system of claim 20, wherein the batch processor is configured to concurrently generate a plurality of consolidated updates, each of the plurality of consolidated updates based on at least some of the plurality of updates. 24. The system of claim 20, further comprising:
a web-based user interface configured to receive the plurality of updates and display the consolidated update; and an offline system comprising the batch processor. 25. The system of claim 24, further comprising an online system comprising the web-based user interface and the update database, the online system being communicatively coupled to the offline system, and wherein the offline system further comprises a file system configured to store the plurality of updates, wherein the batch processor processes the at least some of the plurality of updates from the file system. 26. The system of claim 25, wherein the batch processor is further configured to cause the display module to display the consolidated update on an update stream of the social network based, at least in part, on:
a lack of duplication of the consolidated update with other updates in the update stream; and a conformity of the consolidated update with a business rule. 27. The system of claim 26, wherein the batch processor is further configured to determine the lack of duplication of the consolidated update based, at least in part, on a characteristic of the consolidated update in comparison with a characteristic of the update stream corresponding to the at least one of the plurality of users of the social network. 28. The system of claim 26, wherein the business rule comprises a restriction on displaying the consolidated update on the update stream based on a personal characteristic of the at least one of the plurality of users of the social network. | 2,100 |
4,474 | 14,214,700 | 2,162 | A data search and manipulation method includes accessing, by a processor, a first data element of a first data structure, the first data structure represented by a first icon, the first icon displayed in a user interface; accessing, by the processor, a second data element of a second data structure, the second data structure represented by a second icon displayed in the user interface; executing, by the processor, a first data manipulation process in response to the first icon dragged over the second icon; and executing, by the processor, a second data manipulation process in response to the second icon dragged over t | 1. A method for searching and manipulating data using a search-on-the-fly search engine executed by a processor, the data in a first database represented by a first icon and a second database represented by a second icon, the method, comprising:
the processor receiving a search request for a data element in the first database; the processor returning the data element; the processor responding to a first manipulation of the first and second icons, comprising:
detecting a first move of the first icon over the second icon,
identifying the first move as a first search request,
the processor executing a first search operation in response to the first search request, and
providing a first search result; and
the processor responding to a second manipulation of the first and second icons, comprising:
detecting a second move of the second icon over the first icon,
identifying the second move as a second search request,
the processor executing a second search operation in response to the second search request, and
providing a second search result different from the first search result. 2. The method of claim 1, further comprising displaying the first and second search results in a user interface. 3. The method of claim 1, wherein the first search result includes a first online operation and the second search result includes a second online operation, the method further comprising:
the processor executing the first online operation; and the processor executing the second online operation. 4. The method of claim 3, wherein the processor automatically executes the first and second online operations. 5. The method of claim 3, wherein the processor presents a menu of selectable action items for execution. 6. The method of claim 1, further comprising merging the first and the second databases, comprising:
identifying first data fields of the first database, the first data fields comprising first data field descriptors, each of the first data fields including a plurality of first data elements; identifying second data fields of the second database, the second data fields comprising second data field descriptors, each of the second data fields including a plurality of second data elements; identifying overlapping first and second data fields based on the first and second data field descriptors; combining overlapped first and second data fields, comprising:
combining first and second data elements of the overlapped first and second data fields; and
saving the combined first and second data fields as a merged database. 7. The method of claim 6, further comprising
representing the first database as a first faceted virtual object having N facets, each of the N facets identified by a first data field descriptor; representing the second database as a second faceted virtual object having M facets, each of the M facets identified by a second data field descriptor; and representing the merged database as a merged, faceted virtual object having O facets, where O equals the union of N and M. 8. The method of claim 7, wherein the first and second faceted virtual objects are flat displays. 9. The method of claim 7, wherein the first and second faceted virtual objects are virtual solids. 10. The method of claim 7, further comprising displaying the virtual objects in a user interface. 11. The method of claim 10, further comprising:
identifying inconsistent data elements in the first data elements, comprising:
displaying the first data elements in the user interface, comprising:
displaying inconsistent first data elements in a first window of the user interface, and
displaying correct first data elements in the first window;
receiving an identity of an inconsistent first data element and an identity of a correct first data element;
receiving a data cleanse command; and
correcting the inconsistent first data element to match the correct first data element. 12. The method of claim 11, wherein the inconsistent first data element is an erroneous first data element. 13. The method of claim 6, wherein one or more of the first and second data elements comprises parseable data subelements, the method further comprising:
parsing the data subelements; generating new data fields for the parsed data subelements; and storing the new data fields as one of new first and new second data fields. 14. The method of claim 6, wherein the first database is stored on a first media device and the second database is stored remotely from the first media device. 15. The method of claim 6, wherein contents of the first and second databases are displayed in a user interface of a terminal, the method further comprising:
for each of the first data fields, determining, respectively, a first size of a number of first data elements; for each of the second data fields, determining, respectively, a second size of a number of second data elements; determining a capacity of the user interface and the terminal; and adjusting the first and second sizes so that each of the first and second data elements are represented in the user interface as displayed in the terminal. 16. The method of claim 1, wherein the first and the second databases are data dimensions of larger third and fourth databases, respectively. 17. A system for searching and manipulating data, the data in a first database represented by a first icon and a second database represented by a second icon, comprising:
a processor; and a computer-readable storage medium containing search-on-the-fly search and data manipulation instruction, wherein the processor executes the instructions to:
receive a search request for a data element in the first database and return the data element;
respond to a first manipulation of the first and second icons, comprising:
detecting a first move of the first icon over the second icon,
identifying the first move as a first search request,
executing a first search operation in response to the first search request, and
providing a first search result; and
respond to a second manipulation of the first and second icons, comprising:
detecting a second move of the second icon over the first icon,
identifying the second move as a second search request,
executing a second search operation in response to the second search request, and
providing a second search result different from the first search result. 18. The system of claim 17, wherein the first database comprises a data field of a third database and the second database comprises a data field of a fourth database. 19. A data search and manipulation method, comprising:
accessing, by a processor, a first data element of a first data structure, the first data structure represented by a first icon, the first icon displayed in a user interface; accessing, by the processor, a second data element of a second data structure, the second data structure represented by a second icon displayed in the user interface; executing, by the processor, a first data manipulation process in response to the first icon dragged over the second icon; and executing, by the processor, a second data manipulation process in response to the second icon dragged over the first icon. 20. The method of claim 19, wherein the first data manipulation process comprises executing a purchase process for a product represented by the first data element. | A data search and manipulation method includes accessing, by a processor, a first data element of a first data structure, the first data structure represented by a first icon, the first icon displayed in a user interface; accessing, by the processor, a second data element of a second data structure, the second data structure represented by a second icon displayed in the user interface; executing, by the processor, a first data manipulation process in response to the first icon dragged over the second icon; and executing, by the processor, a second data manipulation process in response to the second icon dragged over t1. A method for searching and manipulating data using a search-on-the-fly search engine executed by a processor, the data in a first database represented by a first icon and a second database represented by a second icon, the method, comprising:
the processor receiving a search request for a data element in the first database; the processor returning the data element; the processor responding to a first manipulation of the first and second icons, comprising:
detecting a first move of the first icon over the second icon,
identifying the first move as a first search request,
the processor executing a first search operation in response to the first search request, and
providing a first search result; and
the processor responding to a second manipulation of the first and second icons, comprising:
detecting a second move of the second icon over the first icon,
identifying the second move as a second search request,
the processor executing a second search operation in response to the second search request, and
providing a second search result different from the first search result. 2. The method of claim 1, further comprising displaying the first and second search results in a user interface. 3. The method of claim 1, wherein the first search result includes a first online operation and the second search result includes a second online operation, the method further comprising:
the processor executing the first online operation; and the processor executing the second online operation. 4. The method of claim 3, wherein the processor automatically executes the first and second online operations. 5. The method of claim 3, wherein the processor presents a menu of selectable action items for execution. 6. The method of claim 1, further comprising merging the first and the second databases, comprising:
identifying first data fields of the first database, the first data fields comprising first data field descriptors, each of the first data fields including a plurality of first data elements; identifying second data fields of the second database, the second data fields comprising second data field descriptors, each of the second data fields including a plurality of second data elements; identifying overlapping first and second data fields based on the first and second data field descriptors; combining overlapped first and second data fields, comprising:
combining first and second data elements of the overlapped first and second data fields; and
saving the combined first and second data fields as a merged database. 7. The method of claim 6, further comprising
representing the first database as a first faceted virtual object having N facets, each of the N facets identified by a first data field descriptor; representing the second database as a second faceted virtual object having M facets, each of the M facets identified by a second data field descriptor; and representing the merged database as a merged, faceted virtual object having O facets, where O equals the union of N and M. 8. The method of claim 7, wherein the first and second faceted virtual objects are flat displays. 9. The method of claim 7, wherein the first and second faceted virtual objects are virtual solids. 10. The method of claim 7, further comprising displaying the virtual objects in a user interface. 11. The method of claim 10, further comprising:
identifying inconsistent data elements in the first data elements, comprising:
displaying the first data elements in the user interface, comprising:
displaying inconsistent first data elements in a first window of the user interface, and
displaying correct first data elements in the first window;
receiving an identity of an inconsistent first data element and an identity of a correct first data element;
receiving a data cleanse command; and
correcting the inconsistent first data element to match the correct first data element. 12. The method of claim 11, wherein the inconsistent first data element is an erroneous first data element. 13. The method of claim 6, wherein one or more of the first and second data elements comprises parseable data subelements, the method further comprising:
parsing the data subelements; generating new data fields for the parsed data subelements; and storing the new data fields as one of new first and new second data fields. 14. The method of claim 6, wherein the first database is stored on a first media device and the second database is stored remotely from the first media device. 15. The method of claim 6, wherein contents of the first and second databases are displayed in a user interface of a terminal, the method further comprising:
for each of the first data fields, determining, respectively, a first size of a number of first data elements; for each of the second data fields, determining, respectively, a second size of a number of second data elements; determining a capacity of the user interface and the terminal; and adjusting the first and second sizes so that each of the first and second data elements are represented in the user interface as displayed in the terminal. 16. The method of claim 1, wherein the first and the second databases are data dimensions of larger third and fourth databases, respectively. 17. A system for searching and manipulating data, the data in a first database represented by a first icon and a second database represented by a second icon, comprising:
a processor; and a computer-readable storage medium containing search-on-the-fly search and data manipulation instruction, wherein the processor executes the instructions to:
receive a search request for a data element in the first database and return the data element;
respond to a first manipulation of the first and second icons, comprising:
detecting a first move of the first icon over the second icon,
identifying the first move as a first search request,
executing a first search operation in response to the first search request, and
providing a first search result; and
respond to a second manipulation of the first and second icons, comprising:
detecting a second move of the second icon over the first icon,
identifying the second move as a second search request,
executing a second search operation in response to the second search request, and
providing a second search result different from the first search result. 18. The system of claim 17, wherein the first database comprises a data field of a third database and the second database comprises a data field of a fourth database. 19. A data search and manipulation method, comprising:
accessing, by a processor, a first data element of a first data structure, the first data structure represented by a first icon, the first icon displayed in a user interface; accessing, by the processor, a second data element of a second data structure, the second data structure represented by a second icon displayed in the user interface; executing, by the processor, a first data manipulation process in response to the first icon dragged over the second icon; and executing, by the processor, a second data manipulation process in response to the second icon dragged over the first icon. 20. The method of claim 19, wherein the first data manipulation process comprises executing a purchase process for a product represented by the first data element. | 2,100 |
4,475 | 13,718,553 | 2,176 | Managing assets during production of multimedia, comprising: creating at least one scouting image; creating a metadata including information needed to import the at least one scouting image as a shot; and generating a script including commands needed to recreate the shot in its current state, and storing camera and character attributes. Keywords include asset management and scouting images. | 1. A method of managing assets during production of multimedia, comprising:
creating at least one scouting image; creating a metadata including information needed to import the at least one scouting image as a shot; and generating a script including commands needed to recreate the shot in its current state, and storing camera and character attributes. 2. The method of claim 1, wherein the multimedia comprises a motion picture. 3. The method of claim 1, wherein the multimedia comprises a computer game. 4. The method of claim 1, wherein the at least one scouting image comprises at least one animated images. 5. The method of claim 1, wherein the at least one scouting image comprises at least one still images. 6. The method of claim 5, wherein the at least one 3-D still image is used to create an animated shot having a plurality of animated images by interpolating the positions stored with each of the at least one still image. 7. The method of claim 1, further comprising
determining whether an http listener received a call about a new file; and creating the metadata once the call about a new file is received. 8. The method of claim 1, wherein the metadata is a markup language. 9. The method of claim 8, wherein the markup language is an extensible markup language (XML). 10. The method of claim 1, wherein the shot is a computer graphics (CG) shot. 11. The method of claim 10, wherein the metadata includes a path to the CG shot. 12. The method of claim 1, further comprising
recreating the shot in its current state using the script. 13. The method of claim 12, further comprising
maintaining the metadata even when the shot is recreated as a new version of the shot. 14. The method of claim 1, further comprising
enabling a story artist to use the at least one scouting image as a reference for generation of new images. 15. An asset management system, comprising:
a data generator configured to receive at least one scouting image created by a scouting artist, and generate metadata, and a custom script relating to the at least one scouting image, wherein the metadata includes information needed to import the at least one scouting image as a shot, wherein the custom script include commands needed to recreate the shot in its current state; and an integration tool configured to receive and manage the at least one scouting image, the metadata, and the custom script to enable a story artist to manipulate the at least scouting image. 16. A non-transitory storage medium storing a computer program to manage assets during production of multimedia, the computer program comprising executable instructions that cause a computer to:
generate at least one scouting image; generate a metadata including information needed to import the at least one scouting image as a shot; and generate a script including commands needed to recreate the shot in its current state, and store camera and character attributes. 17. The non-transitory storage medium of claim 16, further comprising executable instructions that cause a computer to
determine whether an http listener received a call about a new file; and generate the metadata once the call about a new file is received. 18. The non-transitory storage medium of claim 16, wherein the metadata is a markup language. 19. The non-transitory storage medium of claim 16, further comprising executable instructions that cause a computer to
recreate the shot in its current state using the script. 20. The non-transitory storage medium of claim 19, further comprising executable instructions that cause a computer to
maintain the metadata even when the shot is recreated as a new version of the shot. | Managing assets during production of multimedia, comprising: creating at least one scouting image; creating a metadata including information needed to import the at least one scouting image as a shot; and generating a script including commands needed to recreate the shot in its current state, and storing camera and character attributes. Keywords include asset management and scouting images.1. A method of managing assets during production of multimedia, comprising:
creating at least one scouting image; creating a metadata including information needed to import the at least one scouting image as a shot; and generating a script including commands needed to recreate the shot in its current state, and storing camera and character attributes. 2. The method of claim 1, wherein the multimedia comprises a motion picture. 3. The method of claim 1, wherein the multimedia comprises a computer game. 4. The method of claim 1, wherein the at least one scouting image comprises at least one animated images. 5. The method of claim 1, wherein the at least one scouting image comprises at least one still images. 6. The method of claim 5, wherein the at least one 3-D still image is used to create an animated shot having a plurality of animated images by interpolating the positions stored with each of the at least one still image. 7. The method of claim 1, further comprising
determining whether an http listener received a call about a new file; and creating the metadata once the call about a new file is received. 8. The method of claim 1, wherein the metadata is a markup language. 9. The method of claim 8, wherein the markup language is an extensible markup language (XML). 10. The method of claim 1, wherein the shot is a computer graphics (CG) shot. 11. The method of claim 10, wherein the metadata includes a path to the CG shot. 12. The method of claim 1, further comprising
recreating the shot in its current state using the script. 13. The method of claim 12, further comprising
maintaining the metadata even when the shot is recreated as a new version of the shot. 14. The method of claim 1, further comprising
enabling a story artist to use the at least one scouting image as a reference for generation of new images. 15. An asset management system, comprising:
a data generator configured to receive at least one scouting image created by a scouting artist, and generate metadata, and a custom script relating to the at least one scouting image, wherein the metadata includes information needed to import the at least one scouting image as a shot, wherein the custom script include commands needed to recreate the shot in its current state; and an integration tool configured to receive and manage the at least one scouting image, the metadata, and the custom script to enable a story artist to manipulate the at least scouting image. 16. A non-transitory storage medium storing a computer program to manage assets during production of multimedia, the computer program comprising executable instructions that cause a computer to:
generate at least one scouting image; generate a metadata including information needed to import the at least one scouting image as a shot; and generate a script including commands needed to recreate the shot in its current state, and store camera and character attributes. 17. The non-transitory storage medium of claim 16, further comprising executable instructions that cause a computer to
determine whether an http listener received a call about a new file; and generate the metadata once the call about a new file is received. 18. The non-transitory storage medium of claim 16, wherein the metadata is a markup language. 19. The non-transitory storage medium of claim 16, further comprising executable instructions that cause a computer to
recreate the shot in its current state using the script. 20. The non-transitory storage medium of claim 19, further comprising executable instructions that cause a computer to
maintain the metadata even when the shot is recreated as a new version of the shot. | 2,100 |
4,476 | 13,913,585 | 2,177 | A method, system and computer program product for optimizing the loading of a web page. The server receives indications (e.g., Document Object Model (DOM) elements) of web page elements of interest of a web page from multiple client devices. The server updates a list of web page elements for the requested web page that is sorted in terms of popularity based on these received indications of web page elements of interest. The server may then appropriately respond to a request to retrieve that web page by accessing such a list and transmitting to the browser of the requesting client device the data to populate the content of the web page elements for the requested web page in an order based on the sorted list. In this manner, the browser will be able to optimize the loading of the web page. | 1. A method for optimizing the loading of a web page, the method comprising:
receiving indications of web page elements of interest of a web page from a plurality of client devices; updating a list of web page elements of said web page sorted in terms of popularity based on said received indications of web page elements of interest of said web page; receiving a request to retrieve said web page; accessing said sorted list of web page elements of said web page; and transmitting, by a processor, data to populate content of web page elements of said web page in an order based on said sorted list. 2. The method as recited in claim 1, wherein said indications of web page elements of interest of said web page are expressed as Document Object Model (DOM) elements. 3. The method as recited in claim 2 further comprising:
transmitting data to populate content of a DOM element of said web page to a client device and transmitting data to populate content of children of said DOM element of said web page to said client device in response to receiving said DOM element corresponding to an element of interest of said web page. 4. The method as recited in claim 3 further comprising:
transmitting data to populate content of remaining elements of said web page asynchronously to said client device. 5. The method as recited in claim 1, wherein an indication of a web page element of interest of said web page is identified in response to a user selection of an area on said web page. 6. The method as recited in claim 5, wherein said user selection comprises drawing an outline around said element of interest on said web page. 7. The method as recited in claim 1, wherein a client device of said plurality of client devices utilizes an Asynchronous Module Definition (AMD) Application Programming Interface (API) for defining web page elements of interest and their children that can be asynchronously loaded. | A method, system and computer program product for optimizing the loading of a web page. The server receives indications (e.g., Document Object Model (DOM) elements) of web page elements of interest of a web page from multiple client devices. The server updates a list of web page elements for the requested web page that is sorted in terms of popularity based on these received indications of web page elements of interest. The server may then appropriately respond to a request to retrieve that web page by accessing such a list and transmitting to the browser of the requesting client device the data to populate the content of the web page elements for the requested web page in an order based on the sorted list. In this manner, the browser will be able to optimize the loading of the web page.1. A method for optimizing the loading of a web page, the method comprising:
receiving indications of web page elements of interest of a web page from a plurality of client devices; updating a list of web page elements of said web page sorted in terms of popularity based on said received indications of web page elements of interest of said web page; receiving a request to retrieve said web page; accessing said sorted list of web page elements of said web page; and transmitting, by a processor, data to populate content of web page elements of said web page in an order based on said sorted list. 2. The method as recited in claim 1, wherein said indications of web page elements of interest of said web page are expressed as Document Object Model (DOM) elements. 3. The method as recited in claim 2 further comprising:
transmitting data to populate content of a DOM element of said web page to a client device and transmitting data to populate content of children of said DOM element of said web page to said client device in response to receiving said DOM element corresponding to an element of interest of said web page. 4. The method as recited in claim 3 further comprising:
transmitting data to populate content of remaining elements of said web page asynchronously to said client device. 5. The method as recited in claim 1, wherein an indication of a web page element of interest of said web page is identified in response to a user selection of an area on said web page. 6. The method as recited in claim 5, wherein said user selection comprises drawing an outline around said element of interest on said web page. 7. The method as recited in claim 1, wherein a client device of said plurality of client devices utilizes an Asynchronous Module Definition (AMD) Application Programming Interface (API) for defining web page elements of interest and their children that can be asynchronously loaded. | 2,100 |
4,477 | 13,911,953 | 2,177 | A method, system and computer program product for optimizing the loading of a web page. The server receives indications (e.g., Document Object Model (DOM) elements) of web page elements of interest of a web page from multiple client devices. The server updates a list of web page elements for the requested web page that is sorted in terms of popularity based on these received indications of web page elements of interest. The server may then appropriately respond to a request to retrieve that web page by accessing such a list and transmitting to the browser of the requesting client device the data to populate the content of the web page elements for the requested web page in an order based on the sorted list. In this manner, the browser will be able to optimize the loading of the web page. | 1. A computer program product embodied in a computer readable storage medium for optimizing the loading of a web page, the computer program product comprising the programming instructions for:
receiving indications of web page elements of interest of a web page from a plurality of client devices; updating a list of web page elements of said web page sorted in terms of popularity based on said received indications of web page elements of interest of said web page; receiving a request to retrieve said web page; accessing said sorted list of web page elements of said web page; and transmitting data to populate content of web page elements of said web page in an order based on said sorted list. 2. The computer program product as recited in claim 1, wherein said indications of web page elements of interest of said web page are expressed as Document Object Model (DOM) elements. 3. The computer program product as recited in claim 2 further comprising the programming instructions for:
transmitting data to populate content of a DOM element of said web page to a client device and transmitting data to populate content of children of said DOM element of said web page to said client device in response to receiving said DOM element corresponding to an element of interest of said web page. 4. The computer program product as recited in claim 3 further comprising the programming instructions for:
transmitting data to populate content of remaining elements of said web page asynchronously to said client device. 5. The computer program product as recited in claim 1, wherein an indication of a web page element of interest of said web page is identified in response to a user selection of an area on said web page. 6. The computer program product as recited in claim 5, wherein said user selection comprises drawing an outline around said element of interest on said web page. 7. The computer program product as recited in claim 1, wherein a client device of said plurality of client devices utilizes an Asynchronous Module Definition (AMD) Application Programming Interface (API) for defining web page elements of interest and their children that can be asynchronously loaded. 8. A system, comprising:
a memory unit for storing a computer program for optimizing the loading of a web page; and a processor coupled to said memory unit, wherein said processor, responsive to said computer program, comprises:
circuitry for receiving indications of web page elements of interest of a web page from a plurality of client devices;
circuitry for updating a list of web page elements of said web page sorted in terms of popularity based on said received indications of web page elements of interest of said web page;
circuitry for receiving a request to retrieve said web page;
circuitry for accessing said sorted list of web page elements of said web page; and
circuitry for transmitting data to populate content of web page elements of said web page in an order based on said sorted list. 9. The system as recited in claim 8, wherein said indications of web page elements of interest of said web page are expressed as Document Object Model (DOM) elements. 10. The system as recited in claim 9, wherein said processor further comprises:
circuitry for transmitting data to populate content of a DOM element of said web page to a client device and transmitting data to populate content of children of said DOM element of said web page to said client device in response to receiving said DOM element corresponding to an element of interest of said web page. 11. The system as recited in claim 10, wherein said processor further comprises:
circuitry for transmitting data to populate content of remaining elements of said web page asynchronously to said client device. 12. The system as recited in claim 8, wherein an indication of a web page element of interest of said web page is identified in response to a user selection of an area on said web page. 13. The system as recited in claim 12, wherein said user selection comprises drawing an outline around said element of interest on said web page. 14. The system as recited in claim 8, wherein a client device of said plurality of client devices utilizes an Asynchronous Module Definition (AMD) Application Programming Interface (API) for defining web page elements of interest and their children that can be asynchronously loaded. | A method, system and computer program product for optimizing the loading of a web page. The server receives indications (e.g., Document Object Model (DOM) elements) of web page elements of interest of a web page from multiple client devices. The server updates a list of web page elements for the requested web page that is sorted in terms of popularity based on these received indications of web page elements of interest. The server may then appropriately respond to a request to retrieve that web page by accessing such a list and transmitting to the browser of the requesting client device the data to populate the content of the web page elements for the requested web page in an order based on the sorted list. In this manner, the browser will be able to optimize the loading of the web page.1. A computer program product embodied in a computer readable storage medium for optimizing the loading of a web page, the computer program product comprising the programming instructions for:
receiving indications of web page elements of interest of a web page from a plurality of client devices; updating a list of web page elements of said web page sorted in terms of popularity based on said received indications of web page elements of interest of said web page; receiving a request to retrieve said web page; accessing said sorted list of web page elements of said web page; and transmitting data to populate content of web page elements of said web page in an order based on said sorted list. 2. The computer program product as recited in claim 1, wherein said indications of web page elements of interest of said web page are expressed as Document Object Model (DOM) elements. 3. The computer program product as recited in claim 2 further comprising the programming instructions for:
transmitting data to populate content of a DOM element of said web page to a client device and transmitting data to populate content of children of said DOM element of said web page to said client device in response to receiving said DOM element corresponding to an element of interest of said web page. 4. The computer program product as recited in claim 3 further comprising the programming instructions for:
transmitting data to populate content of remaining elements of said web page asynchronously to said client device. 5. The computer program product as recited in claim 1, wherein an indication of a web page element of interest of said web page is identified in response to a user selection of an area on said web page. 6. The computer program product as recited in claim 5, wherein said user selection comprises drawing an outline around said element of interest on said web page. 7. The computer program product as recited in claim 1, wherein a client device of said plurality of client devices utilizes an Asynchronous Module Definition (AMD) Application Programming Interface (API) for defining web page elements of interest and their children that can be asynchronously loaded. 8. A system, comprising:
a memory unit for storing a computer program for optimizing the loading of a web page; and a processor coupled to said memory unit, wherein said processor, responsive to said computer program, comprises:
circuitry for receiving indications of web page elements of interest of a web page from a plurality of client devices;
circuitry for updating a list of web page elements of said web page sorted in terms of popularity based on said received indications of web page elements of interest of said web page;
circuitry for receiving a request to retrieve said web page;
circuitry for accessing said sorted list of web page elements of said web page; and
circuitry for transmitting data to populate content of web page elements of said web page in an order based on said sorted list. 9. The system as recited in claim 8, wherein said indications of web page elements of interest of said web page are expressed as Document Object Model (DOM) elements. 10. The system as recited in claim 9, wherein said processor further comprises:
circuitry for transmitting data to populate content of a DOM element of said web page to a client device and transmitting data to populate content of children of said DOM element of said web page to said client device in response to receiving said DOM element corresponding to an element of interest of said web page. 11. The system as recited in claim 10, wherein said processor further comprises:
circuitry for transmitting data to populate content of remaining elements of said web page asynchronously to said client device. 12. The system as recited in claim 8, wherein an indication of a web page element of interest of said web page is identified in response to a user selection of an area on said web page. 13. The system as recited in claim 12, wherein said user selection comprises drawing an outline around said element of interest on said web page. 14. The system as recited in claim 8, wherein a client device of said plurality of client devices utilizes an Asynchronous Module Definition (AMD) Application Programming Interface (API) for defining web page elements of interest and their children that can be asynchronously loaded. | 2,100 |
4,478 | 14,078,459 | 2,153 | A social networking system allows users to create collections including objects associated with products, services, games, videos, books or other similar items. An object is associated with a type and one or more actions are associated with the type to identify actions capable of being performed on the object. When an object is presented to a user, the type of the object is compared to types of objects capable of being included in a collection. If the type of the object is capable of being included in a collection, one or more collections associated with actions associated with the type of the object are identified. Information describing the identified collections is generated and presented to the user. By selecting information identifying a collection, the user includes the object in the collection corresponding to the selected information. | 1. A method comprising:
storing one or more objects in a social networking system, each object associated with a type, the type associated with one or more actions capable of being performed on objects associated with the type; selecting an object from the stored one or more objects for presentation to a user of the social networking system; determining that the object is capable of being included in one or more collections based on the type associated with the object; identifying one or more collections associated with the type associated with the object based at least in part on the one or more actions associated with the type, each collection associated with an action associated with the type; generating information describing the one or more collections associated with the type associated with the object; and transmitting the generated information describing the one or more collections to a client device for presentation to the user of the social networking system. 2. The method of claim 1, wherein transmitting the generated information describing the one or more collections to the client device for presentation to the user of the social networking system comprises:
transmitting the object and the generated information describing the one or more collections for presentation in conjunction with the object. 3. The method of claim 1, further comprising:
receiving a selection of a collection described by the generated information; and associating an object identifier associated with the object with a collection identifier associated with the selected collection; and storing the association between the object identifier associated with the object and the collection identifier associated with the selected collection in the social networking system. 4. The method of claim 3, wherein associating the object identifier associated with the object with the collection identifier associated with the selected collection comprises:
generating the collection identifier associated with the selected collection if the collection identifier is not included in the social networking system; and associating an object identifier associated with the object with the collection identifier associated with the selected collection. 5. The method of claim 3, further comprising:
receiving an action associated with the object, the action associated with an additional collection different than the selected collection; and associating the object identifier associated with the object with an additional collection identifier associated with the additional collection; 6. The method of claim 5, further comprising:
removing the association between the object identifier and the collection identifier associated with the selected collection. 7. The method of claim 5, wherein the received action is selected from a group of actions. 8. The method of claim 3, further comprising:
generating a story identifying the user, the object and the selected collection. 9. The method of claim 8, further comprising:
communicating the story to one or more client devices associated with additional users of the social networking system connected to the user. 10. The method of claim 1, wherein the object is associated with one or more properties received from an external system. 11. The method of claim 1, wherein an action capable of being performed on objects associated with the type is based at least in part on one or more properties received from an external system. 12. A computer program product comprising a computer-readable storage medium having instructions encoded thereon that, when executed by the processor, cause the processor to:
store one or more objects in a social networking system, each object associated with a type, the type associated with one or more actions capable of being performed on objects associated with the type; select an object from the stored one or more objects for presentation to a user of the social networking system; determine that the object is capable of being included in one or more collections based on the type associated with the object; identify one or more collections associated with the type associated with the object based at least in part on the one or more actions associated with the type, each collection associated with an action associated with the type; generate information describing the one or more collections associated with the type associated with the object; and transmit the generated information describing the one or more collections to a client device for presentation to the user of the social networking system. 13. The computer program product of claim 12, wherein transmit the generated information describing the one or more collections to the client device for presentation to the user of the social networking system comprises:
transmit the object and the generated information describing the one or more collections for presentation in conjunction with the object. 14. The computer program product of claim 12, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
receive a selection of a collection described by the generated information; and associate an object identifier associated with the object with a collection identifier associated with the selected collection; and store the association between the object identifier associated with the object and the collection identifier associated with the selected collection in the social networking system. 15. The computer program product of claim 14, wherein associate the object identifier associated with the object with the collection identifier associated with the selected collection comprises:
generate the collection identifier associated with the selected collection if the collection identifier is not included in the social networking system; and associate an object identifier associated with the object with the collection identifier associated with the selected collection. 16. The computer program product of claim 14, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
receive an action associated with the object, the action associated with an additional collection different than the selected collection; and associate the object identifier associated with the object with an additional collection identifier associated with the additional collection. 17. The computer program product of claim 16, wherein the received action is selected from a group of actions. 18. The computer program product of claim 14, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
generate a story identifying the user, the object and the selected collection. 19. The computer program product of claim 18, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
communicate the story to one or more client devices associated with additional users of the social networking system connected to the user. 20. The computer program product of claim 12, wherein the object is associated with one or more properties received from an external system. 21. The computer program product of claim 12, wherein an action capable of being performed on objects associated with the type is based at least in part on one or more properties received from an external system. | A social networking system allows users to create collections including objects associated with products, services, games, videos, books or other similar items. An object is associated with a type and one or more actions are associated with the type to identify actions capable of being performed on the object. When an object is presented to a user, the type of the object is compared to types of objects capable of being included in a collection. If the type of the object is capable of being included in a collection, one or more collections associated with actions associated with the type of the object are identified. Information describing the identified collections is generated and presented to the user. By selecting information identifying a collection, the user includes the object in the collection corresponding to the selected information.1. A method comprising:
storing one or more objects in a social networking system, each object associated with a type, the type associated with one or more actions capable of being performed on objects associated with the type; selecting an object from the stored one or more objects for presentation to a user of the social networking system; determining that the object is capable of being included in one or more collections based on the type associated with the object; identifying one or more collections associated with the type associated with the object based at least in part on the one or more actions associated with the type, each collection associated with an action associated with the type; generating information describing the one or more collections associated with the type associated with the object; and transmitting the generated information describing the one or more collections to a client device for presentation to the user of the social networking system. 2. The method of claim 1, wherein transmitting the generated information describing the one or more collections to the client device for presentation to the user of the social networking system comprises:
transmitting the object and the generated information describing the one or more collections for presentation in conjunction with the object. 3. The method of claim 1, further comprising:
receiving a selection of a collection described by the generated information; and associating an object identifier associated with the object with a collection identifier associated with the selected collection; and storing the association between the object identifier associated with the object and the collection identifier associated with the selected collection in the social networking system. 4. The method of claim 3, wherein associating the object identifier associated with the object with the collection identifier associated with the selected collection comprises:
generating the collection identifier associated with the selected collection if the collection identifier is not included in the social networking system; and associating an object identifier associated with the object with the collection identifier associated with the selected collection. 5. The method of claim 3, further comprising:
receiving an action associated with the object, the action associated with an additional collection different than the selected collection; and associating the object identifier associated with the object with an additional collection identifier associated with the additional collection; 6. The method of claim 5, further comprising:
removing the association between the object identifier and the collection identifier associated with the selected collection. 7. The method of claim 5, wherein the received action is selected from a group of actions. 8. The method of claim 3, further comprising:
generating a story identifying the user, the object and the selected collection. 9. The method of claim 8, further comprising:
communicating the story to one or more client devices associated with additional users of the social networking system connected to the user. 10. The method of claim 1, wherein the object is associated with one or more properties received from an external system. 11. The method of claim 1, wherein an action capable of being performed on objects associated with the type is based at least in part on one or more properties received from an external system. 12. A computer program product comprising a computer-readable storage medium having instructions encoded thereon that, when executed by the processor, cause the processor to:
store one or more objects in a social networking system, each object associated with a type, the type associated with one or more actions capable of being performed on objects associated with the type; select an object from the stored one or more objects for presentation to a user of the social networking system; determine that the object is capable of being included in one or more collections based on the type associated with the object; identify one or more collections associated with the type associated with the object based at least in part on the one or more actions associated with the type, each collection associated with an action associated with the type; generate information describing the one or more collections associated with the type associated with the object; and transmit the generated information describing the one or more collections to a client device for presentation to the user of the social networking system. 13. The computer program product of claim 12, wherein transmit the generated information describing the one or more collections to the client device for presentation to the user of the social networking system comprises:
transmit the object and the generated information describing the one or more collections for presentation in conjunction with the object. 14. The computer program product of claim 12, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
receive a selection of a collection described by the generated information; and associate an object identifier associated with the object with a collection identifier associated with the selected collection; and store the association between the object identifier associated with the object and the collection identifier associated with the selected collection in the social networking system. 15. The computer program product of claim 14, wherein associate the object identifier associated with the object with the collection identifier associated with the selected collection comprises:
generate the collection identifier associated with the selected collection if the collection identifier is not included in the social networking system; and associate an object identifier associated with the object with the collection identifier associated with the selected collection. 16. The computer program product of claim 14, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
receive an action associated with the object, the action associated with an additional collection different than the selected collection; and associate the object identifier associated with the object with an additional collection identifier associated with the additional collection. 17. The computer program product of claim 16, wherein the received action is selected from a group of actions. 18. The computer program product of claim 14, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
generate a story identifying the user, the object and the selected collection. 19. The computer program product of claim 18, wherein the computer readable storage medium further has instructions encoded thereon that, when executed by the processor, cause the processor to:
communicate the story to one or more client devices associated with additional users of the social networking system connected to the user. 20. The computer program product of claim 12, wherein the object is associated with one or more properties received from an external system. 21. The computer program product of claim 12, wherein an action capable of being performed on objects associated with the type is based at least in part on one or more properties received from an external system. | 2,100 |
4,479 | 15,147,947 | 2,191 | A vehicle computer system (VCS) configured to communicate with a mobile device, comprising a wireless transceiver configured to communicate with the mobile device. The VCS also includes a VCS software stack configured to interact with a mobile device software stack and a processor configured to receive a message from the mobile device indicating a version of the mobile device software stack. The processor is also configured to determine if the VCS needs an update to the VCS software stack based at least upon the version of the mobile device software stack, download an update to the VCS software stack from an off-board server, update the VCS to include the updated VCS software stack, and communicate with the mobile device utilizing the updated VCS software stack. | 1-20. (canceled) 21. A vehicle computer system (VCS) configured to communicate with a mobile device, comprising:
a processor configured to:
1.) receive a message from a wireless transceiver in communication with a mobile device, wherein the message indicates a version of the mobile device software stack;
2.) determine if the VCS needs an update to a VCS software stack located in memory of the VCS and configured to interact with the mobile device;
3.) download an update to the VCS software stack from an off-board server;
4.) update the VCS to include the updated VCS software stack. 22. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the determination is based upon the version of the mobile device software stack. 23. The vehicle computer system configured to communicate with a mobile device of claim 21, the processor further configured detect an error during a download cycle and output an error message on a display of the VCS. 24. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to download an update to the VCS software stack from an off-board server utilizing the mobile device. 25. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to receive a request from the mobile device download an additional VCS software stack including a unique human machine interface. 26. The vehicle computer system configured to communicate with a mobile device of claim 25, wherein the processor is further configured to output the unique human machine interface upon downloading the additional VCS software stack. 27. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to determine if sufficient memory space is available to download the update to the VCS software stack. 28. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to determine if sufficient memory space is available to install the update to the VCS software stack. 29. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to determine if sufficient memory space is available to download and install the update to the VCS software stack. 30. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the message includes information regarding a manufacturer of the mobile device or information regarding an operating system of the mobile device. 31. A vehicle computer system (VCS) configured to communicate ae mobile device, comprising:
a wireless transceiver configured to communicate with the mobile device located; a VCS software profile configured to interact with a mobile device software profile; a processor configured to:
1.) receive a message from the mobile device located in the vehicle indicating a version of the VCS software profile;
2.) determine if the VCS needs an update to the VCS software profile based at least upon the version of the mobile device software profile;
3.) determine if sufficient memory space is available to download and install the update to the VCS software profile.
4.) download a software update to the VCS software profile from an off-board server, the software update including additional features specific to the mobile device located in the vehicle;
4.) update the VCS to include the software update;
5.) communicate with the mobile device utilizing the updated VCS software profile. 32. The vehicle computer system configured to communicate with a mobile device of claim 31, wherein the processor is further configured detect an error during a download cycle and output an error message on a display of the VCS. 33. The vehicle computer system configured to communicate with a mobile device of claim 31, wherein the processor is further configured to output a notification to insert an external memory device when sufficient memory space is not available to download and install the update to the VCS software profile. 34. The vehicle computer system configured to communicate with a mobile device of claim 31, wherein the message from the wireless transceiver includes information regarding a manufacturer of the mobile device or an operating system of the mobile device. 35. A method of communicating with a mobile device (MD), comprising:
receiving a message from the mobile device (MD) located in a vehicle indicating a version of a MD software stack; determining if a vehicle software stack requires an update in response to the version of the MD software stack; downloading and installing the update from an off-board server; providing an error log of software issues to the server; communicating with the MD utilizing the update. 36. The method of communicating with a mobile device (MD) of claim 35, wherein the method includes outputting an error message on a display of a vehicle computer system (VCS). 37. The method of communicating with a mobile device (MD) of claim 35, wherein the error message indicates software issues of the vehicle software stack. 38. The method of communicating with a mobile device (MD) of claim 35, wherein the error message indicates that memory space is unavailable on the VCS. 39. The method of communicating with a mobile device (MD) of claim 35, the method further including the step of outputting a notification to insert an external memory device when sufficient memory space is not available to download and install the update to the vehicle software stack. 40. The method of communicating with a mobile device (MD) of claim 35, the method further including the step of outputting a notification that a network connection error is present when no connection is available to download the update. | A vehicle computer system (VCS) configured to communicate with a mobile device, comprising a wireless transceiver configured to communicate with the mobile device. The VCS also includes a VCS software stack configured to interact with a mobile device software stack and a processor configured to receive a message from the mobile device indicating a version of the mobile device software stack. The processor is also configured to determine if the VCS needs an update to the VCS software stack based at least upon the version of the mobile device software stack, download an update to the VCS software stack from an off-board server, update the VCS to include the updated VCS software stack, and communicate with the mobile device utilizing the updated VCS software stack.1-20. (canceled) 21. A vehicle computer system (VCS) configured to communicate with a mobile device, comprising:
a processor configured to:
1.) receive a message from a wireless transceiver in communication with a mobile device, wherein the message indicates a version of the mobile device software stack;
2.) determine if the VCS needs an update to a VCS software stack located in memory of the VCS and configured to interact with the mobile device;
3.) download an update to the VCS software stack from an off-board server;
4.) update the VCS to include the updated VCS software stack. 22. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the determination is based upon the version of the mobile device software stack. 23. The vehicle computer system configured to communicate with a mobile device of claim 21, the processor further configured detect an error during a download cycle and output an error message on a display of the VCS. 24. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to download an update to the VCS software stack from an off-board server utilizing the mobile device. 25. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to receive a request from the mobile device download an additional VCS software stack including a unique human machine interface. 26. The vehicle computer system configured to communicate with a mobile device of claim 25, wherein the processor is further configured to output the unique human machine interface upon downloading the additional VCS software stack. 27. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to determine if sufficient memory space is available to download the update to the VCS software stack. 28. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to determine if sufficient memory space is available to install the update to the VCS software stack. 29. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the processor is further configured to determine if sufficient memory space is available to download and install the update to the VCS software stack. 30. The vehicle computer system configured to communicate with a mobile device of claim 21, wherein the message includes information regarding a manufacturer of the mobile device or information regarding an operating system of the mobile device. 31. A vehicle computer system (VCS) configured to communicate ae mobile device, comprising:
a wireless transceiver configured to communicate with the mobile device located; a VCS software profile configured to interact with a mobile device software profile; a processor configured to:
1.) receive a message from the mobile device located in the vehicle indicating a version of the VCS software profile;
2.) determine if the VCS needs an update to the VCS software profile based at least upon the version of the mobile device software profile;
3.) determine if sufficient memory space is available to download and install the update to the VCS software profile.
4.) download a software update to the VCS software profile from an off-board server, the software update including additional features specific to the mobile device located in the vehicle;
4.) update the VCS to include the software update;
5.) communicate with the mobile device utilizing the updated VCS software profile. 32. The vehicle computer system configured to communicate with a mobile device of claim 31, wherein the processor is further configured detect an error during a download cycle and output an error message on a display of the VCS. 33. The vehicle computer system configured to communicate with a mobile device of claim 31, wherein the processor is further configured to output a notification to insert an external memory device when sufficient memory space is not available to download and install the update to the VCS software profile. 34. The vehicle computer system configured to communicate with a mobile device of claim 31, wherein the message from the wireless transceiver includes information regarding a manufacturer of the mobile device or an operating system of the mobile device. 35. A method of communicating with a mobile device (MD), comprising:
receiving a message from the mobile device (MD) located in a vehicle indicating a version of a MD software stack; determining if a vehicle software stack requires an update in response to the version of the MD software stack; downloading and installing the update from an off-board server; providing an error log of software issues to the server; communicating with the MD utilizing the update. 36. The method of communicating with a mobile device (MD) of claim 35, wherein the method includes outputting an error message on a display of a vehicle computer system (VCS). 37. The method of communicating with a mobile device (MD) of claim 35, wherein the error message indicates software issues of the vehicle software stack. 38. The method of communicating with a mobile device (MD) of claim 35, wherein the error message indicates that memory space is unavailable on the VCS. 39. The method of communicating with a mobile device (MD) of claim 35, the method further including the step of outputting a notification to insert an external memory device when sufficient memory space is not available to download and install the update to the vehicle software stack. 40. The method of communicating with a mobile device (MD) of claim 35, the method further including the step of outputting a notification that a network connection error is present when no connection is available to download the update. | 2,100 |
4,480 | 13,339,853 | 2,181 | An information processing apparatus includes a data processing section, the data processing section being configured to transmit device information about a peripheral device of the information processing apparatus to a server, display an app list on a display section, the app list being a list of device-specific application programs received from the server, transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list, and acquire and execute a device-specific application program identified on a basis of the app selection information from the server. | 1. An information processing apparatus comprising a data processing section, the data processing section being configured to:
transmit device information about a peripheral device of the information processing apparatus to a server; display an app list on a display section, the app list being a list of device-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a device-specific application program identified on a basis of the app selection information from the server. 2. The information processing apparatus according to claim 1, wherein as the app list, the data processing section displays, on the display section, a list that associates a device name of the peripheral device with information about an available application corresponding to the peripheral device identified by the device name. 3. The information processing apparatus according to claim 1, further comprising a device discovery section that executes device discovery according to a Universal Plug and Play (UPnP) protocol,
wherein the data processing section transmits the device information about the peripheral device acquired by the device discovery section to the server. 4. The information processing apparatus according to claim 1, further comprising a QR code reader that executes reading of a QR code,
wherein the data processing section transmits the device information about the peripheral device acquired by the QR code reader to the server. 5. The information processing apparatus according to claim 1, wherein the data processing section transmits the device information about the peripheral device based on a user input made via an input section to the server. 6. An information processing apparatus comprising a data processing section, the data processing section being configured to:
transmit content identification information to a server; display an app list on a display section, the app list being a list of content-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a content-specific application program identified on a basis of the app selection information from the server. 7. The information processing apparatus according to claim 6, wherein as the app list, the data processing section displays, on the display section, a list that associates a title of content with application information related to the content. 8. The information processing apparatus according to claim 6, wherein the app list displayed on the display section is a list of available applications linked to content played back by using a television or a recording/playback device as a peripheral device. 9. The information processing apparatus according to claim 6, wherein the data processing section outputs identification information indicating presence or absence of a content-specific application that can be acquired from the server within a content list displayed on the display section during execution of a remote control application corresponding to a television or a recording/playback device as a peripheral device. 10. An information processing method which is executed in an information processing apparatus, comprising a data processing section:
transmitting device information about a peripheral device of the information processing apparatus to a server; displaying an app list on a display section, the app list being a list of device-specific application programs received from the server; transmitting app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquiring and executing a device-specific application program identified on a basis of the app selection information from the server. 11. An information processing method which is executed in an information processing apparatus, comprising a data processing section:
transmitting content identification information to a server; displaying an app list on a display section, the app list being a list of content-specific application programs received from the server; transmitting app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquiring and executing a content-specific application program identified on a basis of the app selection information from the server. 12. A program for causing information processing to be executed in an information processing apparatus, the program comprising causing a data processing section to:
transmit device information about a peripheral device of the information processing apparatus to a server; display an app list on a display section, the app list being a list of device-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a device-specific application program identified on a basis of the app selection information from the server. 13. A program for causing information processing to be executed in an information processing apparatus, the program comprising causing a data processing section to:
transmit content identification information to a server; display an app list on a display section, the app list being a list of content-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a content-specific application program identified on a basis of the app selection information from the server. | An information processing apparatus includes a data processing section, the data processing section being configured to transmit device information about a peripheral device of the information processing apparatus to a server, display an app list on a display section, the app list being a list of device-specific application programs received from the server, transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list, and acquire and execute a device-specific application program identified on a basis of the app selection information from the server.1. An information processing apparatus comprising a data processing section, the data processing section being configured to:
transmit device information about a peripheral device of the information processing apparatus to a server; display an app list on a display section, the app list being a list of device-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a device-specific application program identified on a basis of the app selection information from the server. 2. The information processing apparatus according to claim 1, wherein as the app list, the data processing section displays, on the display section, a list that associates a device name of the peripheral device with information about an available application corresponding to the peripheral device identified by the device name. 3. The information processing apparatus according to claim 1, further comprising a device discovery section that executes device discovery according to a Universal Plug and Play (UPnP) protocol,
wherein the data processing section transmits the device information about the peripheral device acquired by the device discovery section to the server. 4. The information processing apparatus according to claim 1, further comprising a QR code reader that executes reading of a QR code,
wherein the data processing section transmits the device information about the peripheral device acquired by the QR code reader to the server. 5. The information processing apparatus according to claim 1, wherein the data processing section transmits the device information about the peripheral device based on a user input made via an input section to the server. 6. An information processing apparatus comprising a data processing section, the data processing section being configured to:
transmit content identification information to a server; display an app list on a display section, the app list being a list of content-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a content-specific application program identified on a basis of the app selection information from the server. 7. The information processing apparatus according to claim 6, wherein as the app list, the data processing section displays, on the display section, a list that associates a title of content with application information related to the content. 8. The information processing apparatus according to claim 6, wherein the app list displayed on the display section is a list of available applications linked to content played back by using a television or a recording/playback device as a peripheral device. 9. The information processing apparatus according to claim 6, wherein the data processing section outputs identification information indicating presence or absence of a content-specific application that can be acquired from the server within a content list displayed on the display section during execution of a remote control application corresponding to a television or a recording/playback device as a peripheral device. 10. An information processing method which is executed in an information processing apparatus, comprising a data processing section:
transmitting device information about a peripheral device of the information processing apparatus to a server; displaying an app list on a display section, the app list being a list of device-specific application programs received from the server; transmitting app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquiring and executing a device-specific application program identified on a basis of the app selection information from the server. 11. An information processing method which is executed in an information processing apparatus, comprising a data processing section:
transmitting content identification information to a server; displaying an app list on a display section, the app list being a list of content-specific application programs received from the server; transmitting app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquiring and executing a content-specific application program identified on a basis of the app selection information from the server. 12. A program for causing information processing to be executed in an information processing apparatus, the program comprising causing a data processing section to:
transmit device information about a peripheral device of the information processing apparatus to a server; display an app list on a display section, the app list being a list of device-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a device-specific application program identified on a basis of the app selection information from the server. 13. A program for causing information processing to be executed in an information processing apparatus, the program comprising causing a data processing section to:
transmit content identification information to a server; display an app list on a display section, the app list being a list of content-specific application programs received from the server; transmit app selection information to the server in response to an input of the app selection information by a user with respect to the app list; and acquire and execute a content-specific application program identified on a basis of the app selection information from the server. | 2,100 |
4,481 | 13,960,940 | 2,135 | A programmable memory 10 comprises programmable data bit cells. A data word comprises a group of the programmable data bit cells. A method of configuring patch code in the memory 10 comprises identifying a first location (e.g. 0x1234) in the programmable memory 10 where a patch is required; modifying a data word at the first location to a predetermined data value (e.g. 0xFFFF); writing patch code for the patch at a patch code location (e.g. 0xABCD); and storing the patch code location. The predetermined data value can be, or can map to, a value of an exception instruction of the processor 20 which will cause the processor 20 to read from a patch table 14 . The programmable memory 10 can be a One Time Programmable (OTP) memory. | 1. A method of configuring patch code for a programmable memory, the programmable memory comprising programmable data bit cells, wherein a data word comprises a group of the programmable data bit cells, the method comprising:
identifying a first location in the programmable memory where a patch is required; modifying a data word at the first location to a predetermined data value; writing patch code for the patch at a patch code location; and storing the patch code location. 2. The method according to claim 1, wherein the programmable memory is in communication with a processor. 3. A method according to claim 2 wherein the step of storing the patch code location comprises storing the patch code location in a patch table and the predetermined data value is a value of an exception instruction of the processor which will cause the processor to read from the patch table. 4. A method according to claim 2 wherein the step of storing the patch code location comprises storing the patch code location in a patch table and wherein the programmable memory is in communication with logic for mapping the predetermined data value to a value of an exception instruction of the processor which will cause the processor to read the patch table. 5. A method according to claim 3 wherein the step of storing the patch code location in a patch table further comprises storing a correspondence between the patch code location and the first location. 6. A method according to claim 1 wherein the step of storing the patch code location comprises storing the patch code location in a patch table and wherein the step of modifying a data word at the first location to a predetermined data value further comprises modifying subsequent data words at the first location to indicate a position of the patch code location in the patch table. 7. A method according to claim 6 wherein the position of the patch code location in the patch table is represented by a variable number of data words and the modifying subsequent data words comprises modifying the number of data words such that all of the data bit cells of the number of data words are in a programmed state. 8. A method according to claim 6 wherein a group of data words represent an index value which indicates the position of the patch code location in the patch table, wherein each bit of the index value is encoded by a different data word in the group of data words, and wherein one of the binary values of a bit of the index value is encoded by modifying the data word such that all of the data bit cells of the data word are in a programmed state. 9. A method according to claim 1 wherein the step of storing the patch code location comprises modifying subsequent data words at the first location to indicate the patch code location, where each bit of the patch code location is encoded by a different existing data word, and wherein one of the binary values of a bit of the patch code location is encoded by modifying the existing data word such that all of the data bit cells of the existing data word are in a programmed state. 10. A method according to claim 1 wherein the step of modifying a data word at the first location to a predetermined data value comprises modifying all of the data bit cells of the data word to a programmed state. 11. A method according to claim 1 wherein the step of writing patch code for the patch at a patch code location writes the patch code in the programmable memory. 12. A method of operating a system comprising a processor and a programmable memory, the method comprising:
reading a data word at a first location in the programmable memory; determining if a value of the data word corresponds to an exception instruction of the processor; if the value of the data word is determined to correspond to the exception instruction of the processor:
performing a look up in a patch table for a patch code location;
reading data at the patch code location. 13. A method according to claim 12 further comprising:
performing a logical operation on the data word read from the first location in the programmable memory to form a mapped value;
applying the mapped value to the processor
and wherein the step of determining if the value of the data word corresponds to an exception instruction of the processor is performed on the mapped value. 14. A method according to claim 12 wherein the patch table comprises a correspondence between the patch code location and the first location. 15. A method according to claim 12 further comprising reading subsequent data words at the first location to determine a position of the patch code location in the patch table. 16. A method according to claim 15 wherein the position of the patch code location in the patch table is represented by a variable number of data words and the method further comprises determining the number of data words. 17. A method according to claim 15 wherein a group of data words represent an index value which indicates the position of the patch code location in the patch table, wherein each bit of the index value is encoded by a different data word in the group of data words. 18. A system comprising:
a programmable memory comprising programmable data bit cells, wherein a data word comprises a group of the programmable data bit cells; a processor which is arranged to access the programmable memory and which is arranged to:
identify a first location in the programmable memory where a patch is required;
modify a data word at the first location to a predetermined data value;
write patch code for the patch at a patch code location; and
store the patch code location. 19. A system according to claim 18 wherein the processor is arranged to:
read a data word at a first location in the programmable memory;
determine if a value of the data word corresponds to an exception instruction of the processor;
if the value of the data word is determined to correspond to the exception instruction of the processor:
perform a look up in a patch table for a patch code location;
read data at the patch code location. 20. A system according to claim 19 wherein the processor is arranged to:
perform a logical operation on the data word read from the first location in the programmable memory to form a mapped data value;
apply the mapped value to the processor;
and use the mapped value when determining if the value of the data word corresponds to an exception instruction of the processor. | A programmable memory 10 comprises programmable data bit cells. A data word comprises a group of the programmable data bit cells. A method of configuring patch code in the memory 10 comprises identifying a first location (e.g. 0x1234) in the programmable memory 10 where a patch is required; modifying a data word at the first location to a predetermined data value (e.g. 0xFFFF); writing patch code for the patch at a patch code location (e.g. 0xABCD); and storing the patch code location. The predetermined data value can be, or can map to, a value of an exception instruction of the processor 20 which will cause the processor 20 to read from a patch table 14 . The programmable memory 10 can be a One Time Programmable (OTP) memory.1. A method of configuring patch code for a programmable memory, the programmable memory comprising programmable data bit cells, wherein a data word comprises a group of the programmable data bit cells, the method comprising:
identifying a first location in the programmable memory where a patch is required; modifying a data word at the first location to a predetermined data value; writing patch code for the patch at a patch code location; and storing the patch code location. 2. The method according to claim 1, wherein the programmable memory is in communication with a processor. 3. A method according to claim 2 wherein the step of storing the patch code location comprises storing the patch code location in a patch table and the predetermined data value is a value of an exception instruction of the processor which will cause the processor to read from the patch table. 4. A method according to claim 2 wherein the step of storing the patch code location comprises storing the patch code location in a patch table and wherein the programmable memory is in communication with logic for mapping the predetermined data value to a value of an exception instruction of the processor which will cause the processor to read the patch table. 5. A method according to claim 3 wherein the step of storing the patch code location in a patch table further comprises storing a correspondence between the patch code location and the first location. 6. A method according to claim 1 wherein the step of storing the patch code location comprises storing the patch code location in a patch table and wherein the step of modifying a data word at the first location to a predetermined data value further comprises modifying subsequent data words at the first location to indicate a position of the patch code location in the patch table. 7. A method according to claim 6 wherein the position of the patch code location in the patch table is represented by a variable number of data words and the modifying subsequent data words comprises modifying the number of data words such that all of the data bit cells of the number of data words are in a programmed state. 8. A method according to claim 6 wherein a group of data words represent an index value which indicates the position of the patch code location in the patch table, wherein each bit of the index value is encoded by a different data word in the group of data words, and wherein one of the binary values of a bit of the index value is encoded by modifying the data word such that all of the data bit cells of the data word are in a programmed state. 9. A method according to claim 1 wherein the step of storing the patch code location comprises modifying subsequent data words at the first location to indicate the patch code location, where each bit of the patch code location is encoded by a different existing data word, and wherein one of the binary values of a bit of the patch code location is encoded by modifying the existing data word such that all of the data bit cells of the existing data word are in a programmed state. 10. A method according to claim 1 wherein the step of modifying a data word at the first location to a predetermined data value comprises modifying all of the data bit cells of the data word to a programmed state. 11. A method according to claim 1 wherein the step of writing patch code for the patch at a patch code location writes the patch code in the programmable memory. 12. A method of operating a system comprising a processor and a programmable memory, the method comprising:
reading a data word at a first location in the programmable memory; determining if a value of the data word corresponds to an exception instruction of the processor; if the value of the data word is determined to correspond to the exception instruction of the processor:
performing a look up in a patch table for a patch code location;
reading data at the patch code location. 13. A method according to claim 12 further comprising:
performing a logical operation on the data word read from the first location in the programmable memory to form a mapped value;
applying the mapped value to the processor
and wherein the step of determining if the value of the data word corresponds to an exception instruction of the processor is performed on the mapped value. 14. A method according to claim 12 wherein the patch table comprises a correspondence between the patch code location and the first location. 15. A method according to claim 12 further comprising reading subsequent data words at the first location to determine a position of the patch code location in the patch table. 16. A method according to claim 15 wherein the position of the patch code location in the patch table is represented by a variable number of data words and the method further comprises determining the number of data words. 17. A method according to claim 15 wherein a group of data words represent an index value which indicates the position of the patch code location in the patch table, wherein each bit of the index value is encoded by a different data word in the group of data words. 18. A system comprising:
a programmable memory comprising programmable data bit cells, wherein a data word comprises a group of the programmable data bit cells; a processor which is arranged to access the programmable memory and which is arranged to:
identify a first location in the programmable memory where a patch is required;
modify a data word at the first location to a predetermined data value;
write patch code for the patch at a patch code location; and
store the patch code location. 19. A system according to claim 18 wherein the processor is arranged to:
read a data word at a first location in the programmable memory;
determine if a value of the data word corresponds to an exception instruction of the processor;
if the value of the data word is determined to correspond to the exception instruction of the processor:
perform a look up in a patch table for a patch code location;
read data at the patch code location. 20. A system according to claim 19 wherein the processor is arranged to:
perform a logical operation on the data word read from the first location in the programmable memory to form a mapped data value;
apply the mapped value to the processor;
and use the mapped value when determining if the value of the data word corresponds to an exception instruction of the processor. | 2,100 |
4,482 | 13,596,666 | 2,173 | In some embodiments, a computer-implemented method performed at a portable electronic device with a touch screen display includes simultaneously displaying a character input area operable to display text character input and emoji character input selected by a user, a keyboard display area, and a plurality of emoji category icons. In response to detecting a gesture on a respective emoji category icon, the method also includes simultaneously displaying: a first subset of emoji character keys for the respective emoji category in the keyboard display area and a plurality of subset-sequence-indicia icons for the respective emoji category. The method also includes detecting a gesture in the keyboard display area and, in response: replacing display of the first subset of emoji character keys with display of a second subset of emoji character keys for the respective emoji category, and updating the information provided by the subset-sequence-indicia icons. | 1. A method, comprising:
at a portable electronic device with a touch screen display, while the portable electronic device is in a user-interface locked mode:
receiving an incoming message from a party to a user of the portable electronic device while the touch screen display is in a power-conserving state;
in response to receiving the incoming message:
powering up the touch screen display, and
displaying at least part of the incoming message from the party to the user on the touch screen display;
while displaying at least part of the incoming message from the party to the user on the touch screen display, detecting a predefined user action to immediately display a plurality of predefined responses to the incoming message, wherein the predefined responses include a plurality of emoji characters and at least one predefined response simultaneously includes text and an emoji character;
in response to detecting the predefined user action to immediately display the plurality of predefined responses to the incoming message, displaying the plurality of predefined responses;
detecting a predefined user action for selecting a predefined response in the plurality of predefined responses;
detecting a predefined user action to initiate sending the selected predefined response to the incoming message; and
in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, sending the selected predefined response to the incoming message, wherein the selected predefined response comprises an emoji character in the plurality of emoji characters. 2. The method of claim 1, including in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, returning the touch screen display to the power-conserving state. 3. The method of claim 1, including returning the touch screen display to the power-conserving state within a predetermined time period after the selected predefined response to the incoming message is sent. 4. A portable electronic device, comprising:
a touch screen display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for, while the portable electronic device is in a user-interface locked mode: receiving an incoming message from a party to a user of the portable electronic device while the touch screen display is in a power-conserving state; in response to receiving the incoming message:
powering up the touch screen display, and
displaying at least part of the incoming message from the party to the user on the touch screen display;
while displaying at least part of the incoming message from the party to the user on the touch screen display, detecting a predefined user action to immediately display a plurality of predefined responses to the incoming message, wherein the predefined responses include a plurality of emoji characters and at least one predefined response simultaneously includes text and an emoji character; in response to detecting the predefined user action to immediately display the plurality of predefined responses to the incoming message, displaying the plurality of predefined responses; detecting a predefined user action for selecting a predefined response in the plurality of predefined responses; detecting a predefined user action to initiate sending the selected predefined response to the incoming message; and in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, sending the selected predefined response to the incoming message, wherein the selected predefined response comprises an emoji character in the plurality of emoji characters. 5. The portable electronic device of claim 4, including instructions for, in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, returning the touch screen display to the power-conserving state. 6. The portable electronic device of claim 4, including instructions for returning the touch screen display to the power-conserving state within a predetermined time period after the selected predefined response to the incoming message is sent. 7. A non-transitory computer readable storage medium having stored therein instructions, which when executed by a portable electronic device with a touch screen display, cause the device to, while the portable electronic device is in a user-interface locked mode:
receive an incoming message from a party to a user of the portable electronic device while the touch screen display is in a power-conserving state; in response to receiving the incoming message:
power up the touch screen display, and
display at least part of the incoming message from the party to the user on the touch screen display;
while displaying at least part of the incoming message from the party to the user on the touch screen display, detect a predefined user action to immediately display a plurality of predefined responses to the incoming message, wherein the predefined responses include a plurality of emoji characters and at least one predefined response simultaneously includes text and an emoji character; in response to detecting the predefined user action to immediately display the plurality of predefined responses to the incoming message, display the plurality of predefined responses; detect a predefined user action for selecting a predefined response in the plurality of predefined responses; detect a predefined user action to initiate sending the selected predefined response to the incoming message; and in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, send the selected predefined response to the incoming message, wherein the selected predefined response comprises an emoji character in the plurality of emoji characters. 8. The storage medium of claim 7, including instructions which cause the device to, in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, return the touch screen display to the power-conserving state. 9. The storage medium of claim 7, including instructions which cause the device to return the touch screen display to the power-conserving state within a predetermined time period after the selected predefined response to the incoming message is sent. | In some embodiments, a computer-implemented method performed at a portable electronic device with a touch screen display includes simultaneously displaying a character input area operable to display text character input and emoji character input selected by a user, a keyboard display area, and a plurality of emoji category icons. In response to detecting a gesture on a respective emoji category icon, the method also includes simultaneously displaying: a first subset of emoji character keys for the respective emoji category in the keyboard display area and a plurality of subset-sequence-indicia icons for the respective emoji category. The method also includes detecting a gesture in the keyboard display area and, in response: replacing display of the first subset of emoji character keys with display of a second subset of emoji character keys for the respective emoji category, and updating the information provided by the subset-sequence-indicia icons.1. A method, comprising:
at a portable electronic device with a touch screen display, while the portable electronic device is in a user-interface locked mode:
receiving an incoming message from a party to a user of the portable electronic device while the touch screen display is in a power-conserving state;
in response to receiving the incoming message:
powering up the touch screen display, and
displaying at least part of the incoming message from the party to the user on the touch screen display;
while displaying at least part of the incoming message from the party to the user on the touch screen display, detecting a predefined user action to immediately display a plurality of predefined responses to the incoming message, wherein the predefined responses include a plurality of emoji characters and at least one predefined response simultaneously includes text and an emoji character;
in response to detecting the predefined user action to immediately display the plurality of predefined responses to the incoming message, displaying the plurality of predefined responses;
detecting a predefined user action for selecting a predefined response in the plurality of predefined responses;
detecting a predefined user action to initiate sending the selected predefined response to the incoming message; and
in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, sending the selected predefined response to the incoming message, wherein the selected predefined response comprises an emoji character in the plurality of emoji characters. 2. The method of claim 1, including in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, returning the touch screen display to the power-conserving state. 3. The method of claim 1, including returning the touch screen display to the power-conserving state within a predetermined time period after the selected predefined response to the incoming message is sent. 4. A portable electronic device, comprising:
a touch screen display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for, while the portable electronic device is in a user-interface locked mode: receiving an incoming message from a party to a user of the portable electronic device while the touch screen display is in a power-conserving state; in response to receiving the incoming message:
powering up the touch screen display, and
displaying at least part of the incoming message from the party to the user on the touch screen display;
while displaying at least part of the incoming message from the party to the user on the touch screen display, detecting a predefined user action to immediately display a plurality of predefined responses to the incoming message, wherein the predefined responses include a plurality of emoji characters and at least one predefined response simultaneously includes text and an emoji character; in response to detecting the predefined user action to immediately display the plurality of predefined responses to the incoming message, displaying the plurality of predefined responses; detecting a predefined user action for selecting a predefined response in the plurality of predefined responses; detecting a predefined user action to initiate sending the selected predefined response to the incoming message; and in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, sending the selected predefined response to the incoming message, wherein the selected predefined response comprises an emoji character in the plurality of emoji characters. 5. The portable electronic device of claim 4, including instructions for, in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, returning the touch screen display to the power-conserving state. 6. The portable electronic device of claim 4, including instructions for returning the touch screen display to the power-conserving state within a predetermined time period after the selected predefined response to the incoming message is sent. 7. A non-transitory computer readable storage medium having stored therein instructions, which when executed by a portable electronic device with a touch screen display, cause the device to, while the portable electronic device is in a user-interface locked mode:
receive an incoming message from a party to a user of the portable electronic device while the touch screen display is in a power-conserving state; in response to receiving the incoming message:
power up the touch screen display, and
display at least part of the incoming message from the party to the user on the touch screen display;
while displaying at least part of the incoming message from the party to the user on the touch screen display, detect a predefined user action to immediately display a plurality of predefined responses to the incoming message, wherein the predefined responses include a plurality of emoji characters and at least one predefined response simultaneously includes text and an emoji character; in response to detecting the predefined user action to immediately display the plurality of predefined responses to the incoming message, display the plurality of predefined responses; detect a predefined user action for selecting a predefined response in the plurality of predefined responses; detect a predefined user action to initiate sending the selected predefined response to the incoming message; and in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, send the selected predefined response to the incoming message, wherein the selected predefined response comprises an emoji character in the plurality of emoji characters. 8. The storage medium of claim 7, including instructions which cause the device to, in response to detecting the predefined user action to initiate sending the selected predefined response to the incoming message, return the touch screen display to the power-conserving state. 9. The storage medium of claim 7, including instructions which cause the device to return the touch screen display to the power-conserving state within a predetermined time period after the selected predefined response to the incoming message is sent. | 2,100 |
4,483 | 13,957,849 | 2,169 | A write request that includes a data object is processed. A hash function is executed on the data object, thereby generating a hash value that includes a first portion and a second portion. A data location table is queried with the first portion, thereby obtaining a storage node identifier. The data object is sent to a storage node associated with the storage node identifier. A write request that includes a data object and a pending data object identification (DOID) is processed, wherein the pending DOID comprises a hash value of the data object. The pending DOID is finalized, thereby generating a finalized data object identification (DOID). The data object is stored at a storage location. A storage manager catalog is updated by adding an entry mapping the finalized DOID to the storage location. The finalized DOID is output. | 1. A method for processing a write request that includes a data object, the method comprising:
executing a hash function on the data object, thereby generating a hash value that includes a first portion and a second portion; querying a data location table with the first portion, thereby obtaining a storage node identifier; and sending the data object to a storage node associated with the storage node identifier. 2. The method of claim 1, wherein querying the data location table with the first portion results in obtaining both the storage node identifier and a second storage node identifier, the method further comprising:
sending the data object to a storage node associated with the second storage node identifier. 3. The method of claim 1, wherein a length of the first portion is four bytes. 4. The method of claim 1, wherein the storage node identifier comprises an Internet Protocol (IP) address. 5. The method of claim 1, wherein the write request further includes an application data identifier, the method further comprising:
generating a pending data object identification (DOID) based on the data object; sending the pending DOID to the storage node; receiving, from the storage node, a finalized data object identification (DOID); and updating a virtual volume catalog by adding an entry mapping the application data identifier to the finalized DOID. 6. The method of claim 5, wherein generating the pending DOID comprises concatenating the hash value and a conflict value. 7. The method of claim 5, wherein the application data identifier comprises a file name, an object name, or a range of blocks. 8. A method for processing a write request that includes a data object and a pending data object identification (DOID), wherein the pending DOID comprises a hash value of the data object, the method comprising:
finalizing the pending DOID, thereby generating a finalized data object identification (DOID); storing the data object at a storage location; updating a storage manager catalog by adding an entry mapping the finalized DOID to the storage location; and outputting the finalized DOID. 9. The method of claim 8, wherein the pending DOID further comprises a conflict value, and wherein finalizing the pending DOID comprises:
determining whether a hash conflict exists; responsive to determining that the hash conflict exists:
modifying the pending DOID by incrementing the pending DOID's conflict value to a lowest non-conflicting value; and
setting the finalized DOID equal to the modified pending DOID; and
responsive to determining that the hash conflict does not exist:
setting the finalized DOID equal to the pending DOID. 10. The method of claim 9, wherein determining whether the hash conflict exists comprises determining whether the storage manager catalog includes an entry mapping a second data object's data object identification (DOID), wherein the second data object's DOID comprises a hash value identical to the pending DOID's hash value, and wherein the second data object differs from the data object included in the write request. 11. The method of claim 10, wherein determining whether the storage manager catalog includes the entry mapping the second data object's DOID comprises:
determining, based on a first hash function, whether the second data object matches the data object included in the write request; and determining, based on a second hash function, whether the second data object matches the data object included in the write request. 12. A non-transitory computer-readable storage medium storing computer program modules for processing a read request that includes an application data identifier, the computer program modules executable to perform steps comprising:
querying a virtual volume catalog with the application data identifier, thereby obtaining a data object identification (DOID), wherein the DOID comprises a hash value of a data object, and wherein the hash value includes a first portion and a second portion; querying a data location table with the first portion, thereby obtaining a storage node identifier; and sending the DOID to a storage node associated with the storage node identifier. 13. The computer-readable storage medium of claim 12, wherein the steps further comprise receiving the data object. 14. The computer-readable storage medium of claim 12, wherein querying the data location table with the first portion results in obtaining both the storage node identifier and a second storage node identifier, and wherein the steps further comprise:
waiting for a response; and responsive to no response being received within a specified time period, sending the DOID to a storage node associated with the second storage node identifier. 15. A system for processing a read request that includes a data object identification (DOID), wherein the DOID comprises a hash value of a data object, and wherein the hash value includes a first portion and a second portion, the system comprising:
a non-transitory computer-readable storage medium storing computer program modules executable to perform steps comprising:
querying a storage manager catalog with the first portion, thereby obtaining a storage location; and
retrieving the data object from the storage location; and
a computer processor for executing the computer program modules. 16. The system of claim 15, wherein the steps further comprise outputting the data object. | A write request that includes a data object is processed. A hash function is executed on the data object, thereby generating a hash value that includes a first portion and a second portion. A data location table is queried with the first portion, thereby obtaining a storage node identifier. The data object is sent to a storage node associated with the storage node identifier. A write request that includes a data object and a pending data object identification (DOID) is processed, wherein the pending DOID comprises a hash value of the data object. The pending DOID is finalized, thereby generating a finalized data object identification (DOID). The data object is stored at a storage location. A storage manager catalog is updated by adding an entry mapping the finalized DOID to the storage location. The finalized DOID is output.1. A method for processing a write request that includes a data object, the method comprising:
executing a hash function on the data object, thereby generating a hash value that includes a first portion and a second portion; querying a data location table with the first portion, thereby obtaining a storage node identifier; and sending the data object to a storage node associated with the storage node identifier. 2. The method of claim 1, wherein querying the data location table with the first portion results in obtaining both the storage node identifier and a second storage node identifier, the method further comprising:
sending the data object to a storage node associated with the second storage node identifier. 3. The method of claim 1, wherein a length of the first portion is four bytes. 4. The method of claim 1, wherein the storage node identifier comprises an Internet Protocol (IP) address. 5. The method of claim 1, wherein the write request further includes an application data identifier, the method further comprising:
generating a pending data object identification (DOID) based on the data object; sending the pending DOID to the storage node; receiving, from the storage node, a finalized data object identification (DOID); and updating a virtual volume catalog by adding an entry mapping the application data identifier to the finalized DOID. 6. The method of claim 5, wherein generating the pending DOID comprises concatenating the hash value and a conflict value. 7. The method of claim 5, wherein the application data identifier comprises a file name, an object name, or a range of blocks. 8. A method for processing a write request that includes a data object and a pending data object identification (DOID), wherein the pending DOID comprises a hash value of the data object, the method comprising:
finalizing the pending DOID, thereby generating a finalized data object identification (DOID); storing the data object at a storage location; updating a storage manager catalog by adding an entry mapping the finalized DOID to the storage location; and outputting the finalized DOID. 9. The method of claim 8, wherein the pending DOID further comprises a conflict value, and wherein finalizing the pending DOID comprises:
determining whether a hash conflict exists; responsive to determining that the hash conflict exists:
modifying the pending DOID by incrementing the pending DOID's conflict value to a lowest non-conflicting value; and
setting the finalized DOID equal to the modified pending DOID; and
responsive to determining that the hash conflict does not exist:
setting the finalized DOID equal to the pending DOID. 10. The method of claim 9, wherein determining whether the hash conflict exists comprises determining whether the storage manager catalog includes an entry mapping a second data object's data object identification (DOID), wherein the second data object's DOID comprises a hash value identical to the pending DOID's hash value, and wherein the second data object differs from the data object included in the write request. 11. The method of claim 10, wherein determining whether the storage manager catalog includes the entry mapping the second data object's DOID comprises:
determining, based on a first hash function, whether the second data object matches the data object included in the write request; and determining, based on a second hash function, whether the second data object matches the data object included in the write request. 12. A non-transitory computer-readable storage medium storing computer program modules for processing a read request that includes an application data identifier, the computer program modules executable to perform steps comprising:
querying a virtual volume catalog with the application data identifier, thereby obtaining a data object identification (DOID), wherein the DOID comprises a hash value of a data object, and wherein the hash value includes a first portion and a second portion; querying a data location table with the first portion, thereby obtaining a storage node identifier; and sending the DOID to a storage node associated with the storage node identifier. 13. The computer-readable storage medium of claim 12, wherein the steps further comprise receiving the data object. 14. The computer-readable storage medium of claim 12, wherein querying the data location table with the first portion results in obtaining both the storage node identifier and a second storage node identifier, and wherein the steps further comprise:
waiting for a response; and responsive to no response being received within a specified time period, sending the DOID to a storage node associated with the second storage node identifier. 15. A system for processing a read request that includes a data object identification (DOID), wherein the DOID comprises a hash value of a data object, and wherein the hash value includes a first portion and a second portion, the system comprising:
a non-transitory computer-readable storage medium storing computer program modules executable to perform steps comprising:
querying a storage manager catalog with the first portion, thereby obtaining a storage location; and
retrieving the data object from the storage location; and
a computer processor for executing the computer program modules. 16. The system of claim 15, wherein the steps further comprise outputting the data object. | 2,100 |
4,484 | 13,606,880 | 2,179 | Medical information systems and medical data processing methods are described. According to one aspect, a medical information system includes a communications interface which is configured to receive patient treatment data from a plurality of medical providers and which regards medical treatment provided by the medical providers with respect to a plurality of patients; and storage circuitry storing the patient treatment data for the plurality of patients of the plurality of the medical providers in a database. | 1. A medical information system comprising:
a communications interface which is configured to receive patient treatment data from a plurality of medical providers and which regards medical treatment provided by the medical providers with respect to a plurality of patients; and storage circuitry storing the patient treatment data for the plurality of patients of the plurality of the medical providers in a database. 2. The medical information system of claim 1 wherein the patient treatment data includes identification information which identifies the patients. 3. The medical information system of claim 1 further comprising processing circuitry configured to access a request for the patient treatment data for an individual one of the patients from one of the medical providers providing medical care to the individual patient during an encounter with the one medical provider, and to output the patient treatment data for the individual patient to the one medical provider as a result of the accessing of the request. 4. The medical information system of claim 3 wherein the processing circuitry is configured to receive updated patient treatment data from the one medical provider for the individual patient as a result of the encounter, to update a medical record of the individual patient in the database using the updated patient treatment data, and to control communication of the updated patient treatment data to the one medical provider. 5. The medical information system of claim 4 wherein the processing circuitry is configured to control the communication of the updated treatment data as a chart note to the one medical provider. 6. The medical information system of claim 4 wherein the processing circuitry is configured to control the communication of the updated treatment data as an update to a medical record of the individual patient in an electronic medical record system of the one medical provider. 7. The medical information system of claim 1 wherein the patient treatment data comprises anonymous patent treatment data without identification information which identifies the patients. 8. The medical information system of claim 1 wherein the patients have a common medical condition, and further comprising processing circuitry configured to process the patient treatment data to identify useful information with respect to future treatment of the common medical condition. 9. The medical information system of claim 1 wherein the patients have a common medical condition, and further comprising processing circuitry configured to process the patient treatment data to identify new procedures for treating the common medical condition. 10. The medical information system of claim 1 wherein the patients have a common medical condition, and further comprising processing circuitry configured to process the patient treatment data to attempt to identify previously unknown trends with respect to the treatment of the common medical condition. 11. The medical information system of claim 1 further comprising processing circuitry configured to control the communications interface to communicate the patient treatment data to medical supply entities in exchange for compensation for the medical providers. 12. The medical information system of claim 1 wherein the patient treatment data includes outcome measures indicative of the treatment of the patients, and further comprising processing circuitry configured to process the patient treatment data to provide outcome based medical treatment information. 13. The medical information system of claim 1 wherein the patient treatment data includes outcome measures indicative of the treatment of the patients, and further comprising processing circuitry configured to process the patient treatment data to provide efficacy information regarding the treatment of the patients. 14. The medical information system of claim 1 wherein the patient treatment data comprises cost information regarding the medical treatment provided by the medical providers with respect to the plurality of patients. 15. The medical information system of claim 14 further comprising processing circuitry configured to associate the cost information for an individual patient with the patient treatment data provided by one of the medical providers which provided the medical treatment to the individual patient. 16. The medical information system of claim 1 further comprising processing circuitry at one of the medical providers configured to display a graphical representation of human anatomy and at least some of the patient treatment data is inputted by interaction of medical personnel with the graphical representation of human anatomy. 17. The medical information system of claim 16 wherein the processing circuitry is configured to access the graphical representation of human anatomy from an entity which also operates the communications interface and the storage circuitry. 18. A medical data processing method comprising:
receiving patient treatment data regarding medical treatment provided by a plurality of medical providers to a plurality of patients; de-identifying the patient treatment data comprising removing identification information from the patient treatment data which identifies the patients and providing anonymous patient treatment data void of the identification information; and permitting access of medical supply entities of medical products which are used during the medical treatment of the patients to the anonymous patient treatment data. 19. The method of claim 18 wherein the patient treatment data is with respect to the patients who have a common medical condition. 20. A medical data processing method comprising:
using processing circuitry, accessing patient treatment data regarding medical treatment provided by a plurality of medical providers to a plurality of patients having a common medical condition; and using processing circuitry, processing the patient treatment data to identify previously unknown information with respect to treatment of the common medical condition. 21. The method of claim 20 wherein the processing comprises processing to identify new procedures for treating the common medical condition. 22. The method of claim 20 wherein the processing comprises processing to identify previously unknown trends in the patient treatment data useful to future treatment of the common medical condition. 23. The method of claim 20 wherein the processing comprises applying a data processing algorithm to the patient treatment data. 24. The method of claim 20 wherein the accessing comprises accessing information regarding outcomes of the patients and different medications used by the patients, and the processing comprises comparing effectiveness of different ones of the medications with respect to treatment of the patients having a common outcome to identify the previously unknown information. 25. The method of claim 24 wherein the generated information identifies one of the medications as providing increased regression of the disease for the patients having the common outcome compared with another of the medications. 26. The method of claim 20 wherein the accessing comprises accessing information regarding outcomes of the patients and different medications used by the patients, and the processing comprises generating information regarding disease progression or regression over time with respect to different medications used by different ones of the patients having a common outcome to identify the previously unknown information. 27. The method of claim 26 wherein the generated information identifies one of the medications as providing increased regression of the disease for the patients having the common outcome compared with another of the medications. 28. A medical data processing method comprising:
using processing circuitry, accessing patient treatment data regarding medical treatment provided by a plurality of medical providers to a plurality of patients having a common medical condition; and using the patient treatment data to demonstrate efficacy of the medical treatment provided by the medical providers to the patients to treat the common medical condition. 29. The method of claim 28 wherein the accessing comprises accessing outcome measures regarding the medical treatment and the using comprises using the outcome measures to support the efficacy of the medical treatment. 30. The method of claim 28 wherein the accessing comprises accessing cost information regarding the medical treatment and the using comprises using the cost information to support the efficacy of the medical treatment. 31. A medical data processing method comprising:
using processing circuitry, accessing information regarding a patient having a medical condition which is to be treated, wherein the accessed information includes information regarding a plurality of outcomes for the patient which correspond to the medical condition; and using processing circuitry and the information regarding the plurality of outcomes, identifying an appropriate treatment for the patient using information regarding the previous use of the treatment upon a plurality of other patients with the medical condition and whose outcomes correspond to the outcomes of the patient. 32. The method of claim 31 wherein the identifying an appropriate treatment for the patient comprises selecting a medicine for use by the patient having the medical condition which is to be treated. 33. The method of claim 32 wherein the selecting the medicine comprises selecting the medicine as a result of the medicine having the greatest effectiveness to treat the other patients with the medical condition and whose outcomes correspond to the outcomes of the patient. | Medical information systems and medical data processing methods are described. According to one aspect, a medical information system includes a communications interface which is configured to receive patient treatment data from a plurality of medical providers and which regards medical treatment provided by the medical providers with respect to a plurality of patients; and storage circuitry storing the patient treatment data for the plurality of patients of the plurality of the medical providers in a database.1. A medical information system comprising:
a communications interface which is configured to receive patient treatment data from a plurality of medical providers and which regards medical treatment provided by the medical providers with respect to a plurality of patients; and storage circuitry storing the patient treatment data for the plurality of patients of the plurality of the medical providers in a database. 2. The medical information system of claim 1 wherein the patient treatment data includes identification information which identifies the patients. 3. The medical information system of claim 1 further comprising processing circuitry configured to access a request for the patient treatment data for an individual one of the patients from one of the medical providers providing medical care to the individual patient during an encounter with the one medical provider, and to output the patient treatment data for the individual patient to the one medical provider as a result of the accessing of the request. 4. The medical information system of claim 3 wherein the processing circuitry is configured to receive updated patient treatment data from the one medical provider for the individual patient as a result of the encounter, to update a medical record of the individual patient in the database using the updated patient treatment data, and to control communication of the updated patient treatment data to the one medical provider. 5. The medical information system of claim 4 wherein the processing circuitry is configured to control the communication of the updated treatment data as a chart note to the one medical provider. 6. The medical information system of claim 4 wherein the processing circuitry is configured to control the communication of the updated treatment data as an update to a medical record of the individual patient in an electronic medical record system of the one medical provider. 7. The medical information system of claim 1 wherein the patient treatment data comprises anonymous patent treatment data without identification information which identifies the patients. 8. The medical information system of claim 1 wherein the patients have a common medical condition, and further comprising processing circuitry configured to process the patient treatment data to identify useful information with respect to future treatment of the common medical condition. 9. The medical information system of claim 1 wherein the patients have a common medical condition, and further comprising processing circuitry configured to process the patient treatment data to identify new procedures for treating the common medical condition. 10. The medical information system of claim 1 wherein the patients have a common medical condition, and further comprising processing circuitry configured to process the patient treatment data to attempt to identify previously unknown trends with respect to the treatment of the common medical condition. 11. The medical information system of claim 1 further comprising processing circuitry configured to control the communications interface to communicate the patient treatment data to medical supply entities in exchange for compensation for the medical providers. 12. The medical information system of claim 1 wherein the patient treatment data includes outcome measures indicative of the treatment of the patients, and further comprising processing circuitry configured to process the patient treatment data to provide outcome based medical treatment information. 13. The medical information system of claim 1 wherein the patient treatment data includes outcome measures indicative of the treatment of the patients, and further comprising processing circuitry configured to process the patient treatment data to provide efficacy information regarding the treatment of the patients. 14. The medical information system of claim 1 wherein the patient treatment data comprises cost information regarding the medical treatment provided by the medical providers with respect to the plurality of patients. 15. The medical information system of claim 14 further comprising processing circuitry configured to associate the cost information for an individual patient with the patient treatment data provided by one of the medical providers which provided the medical treatment to the individual patient. 16. The medical information system of claim 1 further comprising processing circuitry at one of the medical providers configured to display a graphical representation of human anatomy and at least some of the patient treatment data is inputted by interaction of medical personnel with the graphical representation of human anatomy. 17. The medical information system of claim 16 wherein the processing circuitry is configured to access the graphical representation of human anatomy from an entity which also operates the communications interface and the storage circuitry. 18. A medical data processing method comprising:
receiving patient treatment data regarding medical treatment provided by a plurality of medical providers to a plurality of patients; de-identifying the patient treatment data comprising removing identification information from the patient treatment data which identifies the patients and providing anonymous patient treatment data void of the identification information; and permitting access of medical supply entities of medical products which are used during the medical treatment of the patients to the anonymous patient treatment data. 19. The method of claim 18 wherein the patient treatment data is with respect to the patients who have a common medical condition. 20. A medical data processing method comprising:
using processing circuitry, accessing patient treatment data regarding medical treatment provided by a plurality of medical providers to a plurality of patients having a common medical condition; and using processing circuitry, processing the patient treatment data to identify previously unknown information with respect to treatment of the common medical condition. 21. The method of claim 20 wherein the processing comprises processing to identify new procedures for treating the common medical condition. 22. The method of claim 20 wherein the processing comprises processing to identify previously unknown trends in the patient treatment data useful to future treatment of the common medical condition. 23. The method of claim 20 wherein the processing comprises applying a data processing algorithm to the patient treatment data. 24. The method of claim 20 wherein the accessing comprises accessing information regarding outcomes of the patients and different medications used by the patients, and the processing comprises comparing effectiveness of different ones of the medications with respect to treatment of the patients having a common outcome to identify the previously unknown information. 25. The method of claim 24 wherein the generated information identifies one of the medications as providing increased regression of the disease for the patients having the common outcome compared with another of the medications. 26. The method of claim 20 wherein the accessing comprises accessing information regarding outcomes of the patients and different medications used by the patients, and the processing comprises generating information regarding disease progression or regression over time with respect to different medications used by different ones of the patients having a common outcome to identify the previously unknown information. 27. The method of claim 26 wherein the generated information identifies one of the medications as providing increased regression of the disease for the patients having the common outcome compared with another of the medications. 28. A medical data processing method comprising:
using processing circuitry, accessing patient treatment data regarding medical treatment provided by a plurality of medical providers to a plurality of patients having a common medical condition; and using the patient treatment data to demonstrate efficacy of the medical treatment provided by the medical providers to the patients to treat the common medical condition. 29. The method of claim 28 wherein the accessing comprises accessing outcome measures regarding the medical treatment and the using comprises using the outcome measures to support the efficacy of the medical treatment. 30. The method of claim 28 wherein the accessing comprises accessing cost information regarding the medical treatment and the using comprises using the cost information to support the efficacy of the medical treatment. 31. A medical data processing method comprising:
using processing circuitry, accessing information regarding a patient having a medical condition which is to be treated, wherein the accessed information includes information regarding a plurality of outcomes for the patient which correspond to the medical condition; and using processing circuitry and the information regarding the plurality of outcomes, identifying an appropriate treatment for the patient using information regarding the previous use of the treatment upon a plurality of other patients with the medical condition and whose outcomes correspond to the outcomes of the patient. 32. The method of claim 31 wherein the identifying an appropriate treatment for the patient comprises selecting a medicine for use by the patient having the medical condition which is to be treated. 33. The method of claim 32 wherein the selecting the medicine comprises selecting the medicine as a result of the medicine having the greatest effectiveness to treat the other patients with the medical condition and whose outcomes correspond to the outcomes of the patient. | 2,100 |
4,485 | 13,588,411 | 2,179 | This disclosure describes systems, methods, and computer program products for authoring content for digital books. In some implementations, a single graphical user interface (GUI) is presented that allows an author to design a layout for the digital book, including editing text and inserting various types of interactive elements in the text. The GUI functions as both a digital book layout design tool and a word processor to facilitate the building of a digital book. The relative page location of inserted widgets can be determined by a user-selectable anchor point placed within the text. An outline view of the digital book can be created and presented in the GUI based on a hierarchical structure determined by paragraph styles applied to the text. The GUI can provide a hybrid glossary and index page for allowing the author to create and manage a glossary and index for the digital book. | 1. A method of authoring content for a digital book, the method comprising:
providing a graphical user interface (GUI) including a composition area; receiving and displaying text from a text source within the composition area; receiving first input selecting an interactive element type from one or more interactive element types to be inserted in the composition area; responsive to the first input, inserting an interactive element of the interactive element type within the text according to an anchor position in the text; receiving second input selecting content to be inserted into the interactive element; and responsive to the second input, inserting the content in the interactive element. 2. The method of claim 1, further comprising:
presenting an outline view of the digital book in the GUI according to a hierarchical structure of the digital book, the hierarchical structure being automatically determined based on paragraph styles applied to the text displayed in the GUI. 3. The method of claim 1, where receiving text further comprises:
automatically creating a run of pages for receiving the text, where the number of pages in the run of pages is based on the amount of text received. 4. The method of claim 1, where receiving first user input comprises:
detecting dropping of an icon corresponding to the selected interactive element type in the GUI. 5. The method of claim 1, further comprising:
displaying a user interface element in the GUI for determining the layout of the interactive element and user interaction of the interactive element on a device. 6. The method of claim 1, where the interactive element includes a figure label and enumeration, the method further comprising:
receiving third input causing the interactive element to move to a different location in the digital book; determining that an order of interactive elements of the interactive element type inserted in the digital book are out of sequential order; and automatically updating the enumeration on each of the interactive elements of the interactive element type in the digital book to be in sequential order. 7. The method of claim 1, where the interactive element type is a gallery interactive element having a media display area for displaying the content and the content is a gallery of digital images, the method further comprising:
displaying a series of thumbnail images corresponding to the gallery of digital images; receiving touch gesture input directed to the thumbnail images; and responsive to the touch gesture input, replacing a first digital image of the gallery that is currently displayed in the media display area with another digital image from the gallery. 8. The method of claim 7, further comprising:
displaying a control for resizing the content to fit or fill the media display area. 9. The method of claim 5, further comprising:
displaying an accessibility description area in the user interface element; and receiving text input in the accessibility description area. 10. The method of claim 5, further comprising:
displaying in the user interface element settings for a title and caption for the interactive element; and receiving input specifying one or more of the settings. 11. The method of claim 1, further comprising:
receiving a media object into the GUI; and converting the media object into an interactive element of the interactive element type. 12. The method of claim 1, further comprising:
configuring the interactive element to present a multimedia presentation, video, HyperText Markup Language (HTML) content or three-dimensional animation. 13. A method of authoring content for a digital book, the method comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving input selecting a review interactive element type to be inserted in the text in the GUI; and responsive to the input, inserting a review interactive element in the text, the review interactive element including a question area for receiving a question and an answer area for receiving one or more answers to the question, where the answer area is configured according to a question type. 14. The method of claim 13, where the question type includes specifying one or more digital images as one or more answers to the question. 15. The method of claim 13, where the question type includes associating one or more labels or thumbnail images to one or more locations on a digital image to indicate one or more answers to the question. 16. The method of claim 13, further comprising:
displaying a user interface element in the GUI for determining the layout of the review interactive element and user interaction of the review interactive element on a device. 17. The method of claim 16, where determining a user interaction includes specifying more than one answer for a question. 18. A method of authoring content for a digital book, the method comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving input selecting a visual dictionary interactive element type to be inserted in the text in the GUI; and responsive to the input, inserting a visual dictionary interactive element in the text, the visual dictionary interactive element including a media display area for receiving content and one or more placards configured to be dragged to one or more locations on the content. 19. The method of claim 18, further comprising:
receiving text input for the placards. 20. The method of claim 19, further comprising:
displaying a user interface element in the GUI for determining the layout of the visual dictionary interactive element and user interaction of the visual dictionary interactive element on a device. 21. The method of claim 20, where the user interface element includes a setting for specifying the same location in the interactive element for display of placard text. 22. The method of claim 20, where the user interface element includes a setting for inserting a transport control in the visual dictionary interactive element for navigating content. 23. The method of claim 18, further comprising:
displaying a control for adjusting the zoom level of the content in the media display area; and associating the zoom level with a placard. 24. A method of authoring content for a digital book, the method comprising:
displaying a hybrid glossary and index page for interacting with a glossary and index of a digital book, the glossary and index page including a first area displaying a definition of a first glossary term, a second area displaying a list of glossary terms including the first glossary term and other glossary terms, a third area displaying glossary terms related to the first glossary term and a fourth area displaying references to the first glossary term; and responsive to dragging a second glossary term from the list in the second area to the third area, automatically relating the second glossary term to the first glossary term. 25. The method of claim 24, further comprising:
receiving first input adding a term reference to the fourth area for the term defined in the first area, the term reference including a link to a location in the digital book that contains the term defined in the first area. 26. The method of claim 24, further comprising:
receiving input adding a media object or interactive element to the first area. 27. The method of claim 25, further comprising:
receiving second input initiating an operation on a link of a term reference in the fourth area. 28. The method of claim 25, where the term reference is contained in a label, placard or caption of a figure or content inserted in the digital book. 29. The method of claim 25, where receiving first input adding a term reference to the fourth area, further comprises:
displaying a glossary tool bar; receiving input highlighting a term in the digital book; and adding the term to the glossary as a term reference. 30. A system for authoring content for a digital book, comprising:
one or more processors; memory coupled to the one or more processors and configured for storing instructions, which, when executed by the one or more processors, performs operations comprising: providing a graphical user interface (GUI) including a composition area; receiving and displaying text from a text source within the composition area; receiving first input selecting an interactive element type from one or more interactive element types to be inserted in the composition area; responsive to the first input, inserting an interactive element of the interactive element type within the text according to an anchor position in the text; receiving second input selecting content to be inserted into the interactive element; and responsive to the second input, inserting the content in the interactive element. 31. The system of claim 30, further comprising:
presenting an outline view of the digital book in the GUI according to a hierarchical structure of the digital book, the hierarchical structure being automatically determined based on paragraph styles applied to the text displayed in the GUI. 32. The system of claim 30, where receiving text further comprises:
automatically creating one or more pages for receiving the text, where the number of pages is based on the amount of text received. 33. The system of claim 30, where receiving first user input comprises:
detecting dropping of an icon corresponding to the selected interactive element type in the GUI. 34. The system of claim 30, further comprising:
displaying a user interface element in the GUI for determining the layout of the interactive element and user interaction of the interactive element on a device. 35. The system of claim 30, where the interactive element includes a figure label and enumeration, the system further comprising:
receiving third input causing the interactive element to move to a different location in the digital book; determining that an order of interactive elements of the interactive element type inserted in the digital book are out of sequential order; and automatically updating the enumeration on each of the interactive elements of the interactive element type in the digital book to be in sequential order. 36. The system of claim 30, where the interactive element type is a gallery interactive element having a media display area for displaying the content and the content is a gallery of digital images, the system further comprising:
displaying a series of thumbnail images corresponding to the gallery of digital images; receiving touch gesture input directed to the thumbnail images; and responsive to the touch gesture input, replacing a first digital image of the gallery that is currently displayed in the media display area with another digital image from the gallery. 37. The system of claim 36, further comprising:
displaying a control for resizing the content to fit or fill the media display area. 38. The system of claim 36, further comprising:
displaying an accessibility description area in the user interface element; and receiving text input in the accessibility description area. 39. The system of claim 5, further comprising:
displaying in the user interface element settings for a title and caption for the interactive element; and receiving input specifying one or more of the settings. 40. The system of claim 30, further comprising:
receiving a media object into the GUI; and converting the media object into an interactive element of the interactive element type. 41. The system of claim 30, further comprising:
configuring the interactive element to present a multimedia presentation, video, HyperText Markup Language (HTML) content or three-dimensional animation. 42. A system of authoring content for a digital book, comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving first input selecting a review interactive element type to be inserted in the text in the GUI; and responsive to the first input, inserting a review interactive element in the text, the review interactive element including a question area for receiving a question and an answer area for receiving one or more answers to the question, where the answer area is configured according to a question type. 43. The system of claim 42, where the question type includes specifying one or more digital images as one or more answers to the question. 44. The system of claim 42, where the question type includes associating one or more labels or thumbnail images to one or more locations on a digital image to indicate one or more answers to the question. 45. The system of claim 42, further comprising:
displaying a user interface element in the GUI for determining the layout of the review interactive element and user interaction of the review interactive element on a device. 46. The system of claim 45, where determining a user interaction includes specifying more than one answer for a question. 47. A system of authoring content for a digital book, the system comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving first input selecting a visual dictionary interactive element type to be inserted in the text in the GUI; and responsive to the first input, inserting a visual dictionary interactive element in the text, the visual dictionary interactive element including a media display area for receiving content and a label area for supplying one or more placards configured to be dragged to one or more locations on the content. 48. The system of claim 47, further comprising:
receiving text input for the placards. 49. The system of claim 48, further comprising:
displaying a user interface element in the GUI for determining the layout of the visual dictionary interactive element and user interaction of the visual dictionary interactive element on a device. 50. The system of claim 49, where the user interface element includes a setting for specifying the same location in the interactive element for display of placard text. 51. The system of claim 49, where the user interface element includes a setting for inserting a transport control in the visual dictionary interactive element for navigating content. 52. The system of claim 47, further comprising:
displaying a control for adjusting the zoom level of the content in the media display area; and associating the zoom level with a placard. 53. A system of authoring content for a digital book, the system comprising:
displaying a hybrid glossary and index page for interacting with a glossary and index of a digital book, the glossary and index page including a first area displaying a definition of a first glossary term, a second area displaying a list of glossary terms including the first glossary term and other glossary terms, a third area displaying related glossary terms and a fourth area displaying references to the first glossary term; and responsive to dragging a second glossary term from the list in the second area to the third area, automatically relating the second glossary term to the first glossary term. 54. The system of claim 53, further comprising:
receiving first input adding a term reference to the fourth area for the term defined in the first area, the term reference including a link to a location in the digital book that contains the term defined in the first area. 55. The system of claim 53, further comprising:
receiving input adding a media object or interactive element to the first area. 56. The system of claim 54, further comprising:
receiving second input initiating an operation on a link of a term reference in the fourth area. 57. The system of claim 54, where the term reference is contained in a label, placard or caption of a figure or content inserted in the digital book. 58. The system of claim 54, where receiving first input adding a term reference to the fourth area, further comprises:
displaying a glossary tool bar; receiving input highlighting a term in the digital book; and adding the term to the glossary as a term reference. 59. A method comprising:
displaying a first element of a digital book, the first element having a type; receiving a selection of the first element; receiving input specifying a change to an attribute of the selected element; automatically determining a second element in the digital book that is associated with the type; and automatically applying the change to the automatically determined second element. 60. The method of claim 59, further comprising:
automatically determining a third element in the digital book that is associated with the type; automatically determining that an attribute of the third element has been previously changed; and preventing the change from being applied to the third element. 61. The method of claim 59, further comprising:
automatically generating a new paragraph style based on the change. 62. A method comprising:
displaying a first element of a digital book, the first element having a paragraph style; receiving a selection of the first element; receiving input specifying a change to an attribute of the selected element; automatically determining a second element in the digital book that is associated with the paragraph style; and automatically applying the change to the automatically determined second element. | This disclosure describes systems, methods, and computer program products for authoring content for digital books. In some implementations, a single graphical user interface (GUI) is presented that allows an author to design a layout for the digital book, including editing text and inserting various types of interactive elements in the text. The GUI functions as both a digital book layout design tool and a word processor to facilitate the building of a digital book. The relative page location of inserted widgets can be determined by a user-selectable anchor point placed within the text. An outline view of the digital book can be created and presented in the GUI based on a hierarchical structure determined by paragraph styles applied to the text. The GUI can provide a hybrid glossary and index page for allowing the author to create and manage a glossary and index for the digital book.1. A method of authoring content for a digital book, the method comprising:
providing a graphical user interface (GUI) including a composition area; receiving and displaying text from a text source within the composition area; receiving first input selecting an interactive element type from one or more interactive element types to be inserted in the composition area; responsive to the first input, inserting an interactive element of the interactive element type within the text according to an anchor position in the text; receiving second input selecting content to be inserted into the interactive element; and responsive to the second input, inserting the content in the interactive element. 2. The method of claim 1, further comprising:
presenting an outline view of the digital book in the GUI according to a hierarchical structure of the digital book, the hierarchical structure being automatically determined based on paragraph styles applied to the text displayed in the GUI. 3. The method of claim 1, where receiving text further comprises:
automatically creating a run of pages for receiving the text, where the number of pages in the run of pages is based on the amount of text received. 4. The method of claim 1, where receiving first user input comprises:
detecting dropping of an icon corresponding to the selected interactive element type in the GUI. 5. The method of claim 1, further comprising:
displaying a user interface element in the GUI for determining the layout of the interactive element and user interaction of the interactive element on a device. 6. The method of claim 1, where the interactive element includes a figure label and enumeration, the method further comprising:
receiving third input causing the interactive element to move to a different location in the digital book; determining that an order of interactive elements of the interactive element type inserted in the digital book are out of sequential order; and automatically updating the enumeration on each of the interactive elements of the interactive element type in the digital book to be in sequential order. 7. The method of claim 1, where the interactive element type is a gallery interactive element having a media display area for displaying the content and the content is a gallery of digital images, the method further comprising:
displaying a series of thumbnail images corresponding to the gallery of digital images; receiving touch gesture input directed to the thumbnail images; and responsive to the touch gesture input, replacing a first digital image of the gallery that is currently displayed in the media display area with another digital image from the gallery. 8. The method of claim 7, further comprising:
displaying a control for resizing the content to fit or fill the media display area. 9. The method of claim 5, further comprising:
displaying an accessibility description area in the user interface element; and receiving text input in the accessibility description area. 10. The method of claim 5, further comprising:
displaying in the user interface element settings for a title and caption for the interactive element; and receiving input specifying one or more of the settings. 11. The method of claim 1, further comprising:
receiving a media object into the GUI; and converting the media object into an interactive element of the interactive element type. 12. The method of claim 1, further comprising:
configuring the interactive element to present a multimedia presentation, video, HyperText Markup Language (HTML) content or three-dimensional animation. 13. A method of authoring content for a digital book, the method comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving input selecting a review interactive element type to be inserted in the text in the GUI; and responsive to the input, inserting a review interactive element in the text, the review interactive element including a question area for receiving a question and an answer area for receiving one or more answers to the question, where the answer area is configured according to a question type. 14. The method of claim 13, where the question type includes specifying one or more digital images as one or more answers to the question. 15. The method of claim 13, where the question type includes associating one or more labels or thumbnail images to one or more locations on a digital image to indicate one or more answers to the question. 16. The method of claim 13, further comprising:
displaying a user interface element in the GUI for determining the layout of the review interactive element and user interaction of the review interactive element on a device. 17. The method of claim 16, where determining a user interaction includes specifying more than one answer for a question. 18. A method of authoring content for a digital book, the method comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving input selecting a visual dictionary interactive element type to be inserted in the text in the GUI; and responsive to the input, inserting a visual dictionary interactive element in the text, the visual dictionary interactive element including a media display area for receiving content and one or more placards configured to be dragged to one or more locations on the content. 19. The method of claim 18, further comprising:
receiving text input for the placards. 20. The method of claim 19, further comprising:
displaying a user interface element in the GUI for determining the layout of the visual dictionary interactive element and user interaction of the visual dictionary interactive element on a device. 21. The method of claim 20, where the user interface element includes a setting for specifying the same location in the interactive element for display of placard text. 22. The method of claim 20, where the user interface element includes a setting for inserting a transport control in the visual dictionary interactive element for navigating content. 23. The method of claim 18, further comprising:
displaying a control for adjusting the zoom level of the content in the media display area; and associating the zoom level with a placard. 24. A method of authoring content for a digital book, the method comprising:
displaying a hybrid glossary and index page for interacting with a glossary and index of a digital book, the glossary and index page including a first area displaying a definition of a first glossary term, a second area displaying a list of glossary terms including the first glossary term and other glossary terms, a third area displaying glossary terms related to the first glossary term and a fourth area displaying references to the first glossary term; and responsive to dragging a second glossary term from the list in the second area to the third area, automatically relating the second glossary term to the first glossary term. 25. The method of claim 24, further comprising:
receiving first input adding a term reference to the fourth area for the term defined in the first area, the term reference including a link to a location in the digital book that contains the term defined in the first area. 26. The method of claim 24, further comprising:
receiving input adding a media object or interactive element to the first area. 27. The method of claim 25, further comprising:
receiving second input initiating an operation on a link of a term reference in the fourth area. 28. The method of claim 25, where the term reference is contained in a label, placard or caption of a figure or content inserted in the digital book. 29. The method of claim 25, where receiving first input adding a term reference to the fourth area, further comprises:
displaying a glossary tool bar; receiving input highlighting a term in the digital book; and adding the term to the glossary as a term reference. 30. A system for authoring content for a digital book, comprising:
one or more processors; memory coupled to the one or more processors and configured for storing instructions, which, when executed by the one or more processors, performs operations comprising: providing a graphical user interface (GUI) including a composition area; receiving and displaying text from a text source within the composition area; receiving first input selecting an interactive element type from one or more interactive element types to be inserted in the composition area; responsive to the first input, inserting an interactive element of the interactive element type within the text according to an anchor position in the text; receiving second input selecting content to be inserted into the interactive element; and responsive to the second input, inserting the content in the interactive element. 31. The system of claim 30, further comprising:
presenting an outline view of the digital book in the GUI according to a hierarchical structure of the digital book, the hierarchical structure being automatically determined based on paragraph styles applied to the text displayed in the GUI. 32. The system of claim 30, where receiving text further comprises:
automatically creating one or more pages for receiving the text, where the number of pages is based on the amount of text received. 33. The system of claim 30, where receiving first user input comprises:
detecting dropping of an icon corresponding to the selected interactive element type in the GUI. 34. The system of claim 30, further comprising:
displaying a user interface element in the GUI for determining the layout of the interactive element and user interaction of the interactive element on a device. 35. The system of claim 30, where the interactive element includes a figure label and enumeration, the system further comprising:
receiving third input causing the interactive element to move to a different location in the digital book; determining that an order of interactive elements of the interactive element type inserted in the digital book are out of sequential order; and automatically updating the enumeration on each of the interactive elements of the interactive element type in the digital book to be in sequential order. 36. The system of claim 30, where the interactive element type is a gallery interactive element having a media display area for displaying the content and the content is a gallery of digital images, the system further comprising:
displaying a series of thumbnail images corresponding to the gallery of digital images; receiving touch gesture input directed to the thumbnail images; and responsive to the touch gesture input, replacing a first digital image of the gallery that is currently displayed in the media display area with another digital image from the gallery. 37. The system of claim 36, further comprising:
displaying a control for resizing the content to fit or fill the media display area. 38. The system of claim 36, further comprising:
displaying an accessibility description area in the user interface element; and receiving text input in the accessibility description area. 39. The system of claim 5, further comprising:
displaying in the user interface element settings for a title and caption for the interactive element; and receiving input specifying one or more of the settings. 40. The system of claim 30, further comprising:
receiving a media object into the GUI; and converting the media object into an interactive element of the interactive element type. 41. The system of claim 30, further comprising:
configuring the interactive element to present a multimedia presentation, video, HyperText Markup Language (HTML) content or three-dimensional animation. 42. A system of authoring content for a digital book, comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving first input selecting a review interactive element type to be inserted in the text in the GUI; and responsive to the first input, inserting a review interactive element in the text, the review interactive element including a question area for receiving a question and an answer area for receiving one or more answers to the question, where the answer area is configured according to a question type. 43. The system of claim 42, where the question type includes specifying one or more digital images as one or more answers to the question. 44. The system of claim 42, where the question type includes associating one or more labels or thumbnail images to one or more locations on a digital image to indicate one or more answers to the question. 45. The system of claim 42, further comprising:
displaying a user interface element in the GUI for determining the layout of the review interactive element and user interaction of the review interactive element on a device. 46. The system of claim 45, where determining a user interaction includes specifying more than one answer for a question. 47. A system of authoring content for a digital book, the system comprising:
receiving text from a text source; displaying the text in a graphical user interface (GUI); receiving first input selecting a visual dictionary interactive element type to be inserted in the text in the GUI; and responsive to the first input, inserting a visual dictionary interactive element in the text, the visual dictionary interactive element including a media display area for receiving content and a label area for supplying one or more placards configured to be dragged to one or more locations on the content. 48. The system of claim 47, further comprising:
receiving text input for the placards. 49. The system of claim 48, further comprising:
displaying a user interface element in the GUI for determining the layout of the visual dictionary interactive element and user interaction of the visual dictionary interactive element on a device. 50. The system of claim 49, where the user interface element includes a setting for specifying the same location in the interactive element for display of placard text. 51. The system of claim 49, where the user interface element includes a setting for inserting a transport control in the visual dictionary interactive element for navigating content. 52. The system of claim 47, further comprising:
displaying a control for adjusting the zoom level of the content in the media display area; and associating the zoom level with a placard. 53. A system of authoring content for a digital book, the system comprising:
displaying a hybrid glossary and index page for interacting with a glossary and index of a digital book, the glossary and index page including a first area displaying a definition of a first glossary term, a second area displaying a list of glossary terms including the first glossary term and other glossary terms, a third area displaying related glossary terms and a fourth area displaying references to the first glossary term; and responsive to dragging a second glossary term from the list in the second area to the third area, automatically relating the second glossary term to the first glossary term. 54. The system of claim 53, further comprising:
receiving first input adding a term reference to the fourth area for the term defined in the first area, the term reference including a link to a location in the digital book that contains the term defined in the first area. 55. The system of claim 53, further comprising:
receiving input adding a media object or interactive element to the first area. 56. The system of claim 54, further comprising:
receiving second input initiating an operation on a link of a term reference in the fourth area. 57. The system of claim 54, where the term reference is contained in a label, placard or caption of a figure or content inserted in the digital book. 58. The system of claim 54, where receiving first input adding a term reference to the fourth area, further comprises:
displaying a glossary tool bar; receiving input highlighting a term in the digital book; and adding the term to the glossary as a term reference. 59. A method comprising:
displaying a first element of a digital book, the first element having a type; receiving a selection of the first element; receiving input specifying a change to an attribute of the selected element; automatically determining a second element in the digital book that is associated with the type; and automatically applying the change to the automatically determined second element. 60. The method of claim 59, further comprising:
automatically determining a third element in the digital book that is associated with the type; automatically determining that an attribute of the third element has been previously changed; and preventing the change from being applied to the third element. 61. The method of claim 59, further comprising:
automatically generating a new paragraph style based on the change. 62. A method comprising:
displaying a first element of a digital book, the first element having a paragraph style; receiving a selection of the first element; receiving input specifying a change to an attribute of the selected element; automatically determining a second element in the digital book that is associated with the paragraph style; and automatically applying the change to the automatically determined second element. | 2,100 |
4,486 | 13,879,443 | 2,196 | The present disclosure includes a system and method for scheduling changes. In an example of scheduling changes according to the present disclosure, a usage pattern of a number of services ( 104 - 1, 104 - 2, 104 -N, 236 ) is determined, a window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time is determined ( 116, 216, 352 ); and a change ( 238 ) during the window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time is scheduled ( 116, 216, 354 ). | 1. A method for scheduling changes, the method comprising:
determining a usage pattern of a number of services (104-1, 104-2, 104-N, 236); determining a window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time (116, 216, 352); and scheduling a change (238) during the window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time (116, 216, 354). 2. The method of claim 1, wherein determining the usage pattern of the number of services (104-1, 104-2, 104-N, 236) includes collecting and analyzing real user monitoring (RUM) data (110, 112, 114, 230, 232). 3. The method of claim 1, wherein determining the usage pattern of the number of services (104-1, 104-2, 104-N, 236) includes creating a baseline (114) representing the usage pattern of the number of services (104-1, 104-2, 104-N, 236) for a time period. 4. The method of claim 1, wherein the method further includes detecting a number of services (104-1, 104-2, 104-N, 236) affected by the change (238) using a configuration management database (118). 5. The method of claim 1, wherein the method further includes causing an implementation of the change (238) during the window of time. 6. The method of claim 1, wherein the window of time in which the usage pattern includes fewer transactions than the usage pattern during the number of other windows of time is before a change implementation deadline (116, 216, 352). 7. The method of claim 1, wherein the change (238) is an update to a computing network (102). 8. A non-transitory computer readable medium (122) having instructions stored thereon executable by a processor (121) to:
enter a change request to a change management system (116, 216); detect a number of services (104-1, 104-2, 104-N, 236) affected by the change request using a configuration management database (118); extract a usage pattern for the number of services (104-1, 104-2, 104-N, 236) from a baseline of service usage (114); determine a window of time for implementing a change (238) indicated by the change request based on the number of services (104-1, 104-2, 104-N, 236) affected by the change request and the usage pattern for the number of services (104-1, 104-2, 104-N, 236); and schedule the change (238) within the window of time for implementing the change (238). 9. The non-transitory computer readable medium (122) of claim 8, wherein the instructions stored thereon are executable by a processor (121) to cause an implementation of the change (238) within the window of time for implementing the change. 10. The non-transitory computer readable medium (122) of claim 8, wherein the window of time for implementing a change (238) includes a window of time where the usage pattern for the number of services (104-1, 104-2, 104-N, 236) indicates fewer users on the network (102) than other windows of time. 11. The non-transitory computer readable medium (122) of claim 8, wherein the usage pattern is based on real user monitoring (RUM) data (110, 112, 114, 230, 232). 12. A change scheduling system (116, 216), comprising:
at least one computing device having: at least one processor (121); and non-transitory computer readable memory (122) in communication with the at least one processor (121), the non-transitory computer readable memory (122) being programmed with instructions executable on the at least one processor (121) to: determine a window of time in which to implement a change (238) based on a usage pattern for a number of services (104-1, 104-2, 104-N, 236) and a number of services (104-1, 104-2, 104-N, 236) affected by the change (238); and schedule the change (238) during the window of time determined in which to implement the change (238). 13. The change scheduling system (116, 216) of claim 12, wherein the window of time in which to implement the change (238) meets the requirements of a number of change policies for the change scheduling system (116, 216). 14. The change scheduling system (116, 216) of claim 12, wherein the window of time in which to implement the change (238) minimizes the number of services (104-1, 104-2, 104-N, 236) affected by the implementation of the change (104-1, 104-2, 104-N, 236). 15. The change scheduling system (116, 216) of claim 12, wherein the usage pattern for the number of services includes creating a baseline (114) representing the usage pattern for the number of services (104-1, 104-2, 104-N, 236) for a time period. | The present disclosure includes a system and method for scheduling changes. In an example of scheduling changes according to the present disclosure, a usage pattern of a number of services ( 104 - 1, 104 - 2, 104 -N, 236 ) is determined, a window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time is determined ( 116, 216, 352 ); and a change ( 238 ) during the window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time is scheduled ( 116, 216, 354 ).1. A method for scheduling changes, the method comprising:
determining a usage pattern of a number of services (104-1, 104-2, 104-N, 236); determining a window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time (116, 216, 352); and scheduling a change (238) during the window of time in which the usage pattern includes fewer transactions than the usage pattern during a number of other windows of time (116, 216, 354). 2. The method of claim 1, wherein determining the usage pattern of the number of services (104-1, 104-2, 104-N, 236) includes collecting and analyzing real user monitoring (RUM) data (110, 112, 114, 230, 232). 3. The method of claim 1, wherein determining the usage pattern of the number of services (104-1, 104-2, 104-N, 236) includes creating a baseline (114) representing the usage pattern of the number of services (104-1, 104-2, 104-N, 236) for a time period. 4. The method of claim 1, wherein the method further includes detecting a number of services (104-1, 104-2, 104-N, 236) affected by the change (238) using a configuration management database (118). 5. The method of claim 1, wherein the method further includes causing an implementation of the change (238) during the window of time. 6. The method of claim 1, wherein the window of time in which the usage pattern includes fewer transactions than the usage pattern during the number of other windows of time is before a change implementation deadline (116, 216, 352). 7. The method of claim 1, wherein the change (238) is an update to a computing network (102). 8. A non-transitory computer readable medium (122) having instructions stored thereon executable by a processor (121) to:
enter a change request to a change management system (116, 216); detect a number of services (104-1, 104-2, 104-N, 236) affected by the change request using a configuration management database (118); extract a usage pattern for the number of services (104-1, 104-2, 104-N, 236) from a baseline of service usage (114); determine a window of time for implementing a change (238) indicated by the change request based on the number of services (104-1, 104-2, 104-N, 236) affected by the change request and the usage pattern for the number of services (104-1, 104-2, 104-N, 236); and schedule the change (238) within the window of time for implementing the change (238). 9. The non-transitory computer readable medium (122) of claim 8, wherein the instructions stored thereon are executable by a processor (121) to cause an implementation of the change (238) within the window of time for implementing the change. 10. The non-transitory computer readable medium (122) of claim 8, wherein the window of time for implementing a change (238) includes a window of time where the usage pattern for the number of services (104-1, 104-2, 104-N, 236) indicates fewer users on the network (102) than other windows of time. 11. The non-transitory computer readable medium (122) of claim 8, wherein the usage pattern is based on real user monitoring (RUM) data (110, 112, 114, 230, 232). 12. A change scheduling system (116, 216), comprising:
at least one computing device having: at least one processor (121); and non-transitory computer readable memory (122) in communication with the at least one processor (121), the non-transitory computer readable memory (122) being programmed with instructions executable on the at least one processor (121) to: determine a window of time in which to implement a change (238) based on a usage pattern for a number of services (104-1, 104-2, 104-N, 236) and a number of services (104-1, 104-2, 104-N, 236) affected by the change (238); and schedule the change (238) during the window of time determined in which to implement the change (238). 13. The change scheduling system (116, 216) of claim 12, wherein the window of time in which to implement the change (238) meets the requirements of a number of change policies for the change scheduling system (116, 216). 14. The change scheduling system (116, 216) of claim 12, wherein the window of time in which to implement the change (238) minimizes the number of services (104-1, 104-2, 104-N, 236) affected by the implementation of the change (104-1, 104-2, 104-N, 236). 15. The change scheduling system (116, 216) of claim 12, wherein the usage pattern for the number of services includes creating a baseline (114) representing the usage pattern for the number of services (104-1, 104-2, 104-N, 236) for a time period. | 2,100 |
4,487 | 14,819,458 | 2,185 | A method for controlling bus-networked devices is useable in a system comprising a gateway, an open field bus electrically connected to the gateway, and a pluggable connection cable electrically connecting the gateway to a plurality of bus subscribers. The gateway starts a configuration mode to control a bus subscriber and to generate a new target configuration including the bus subscriber. According to an initial target configuration, the bus subscriber is not expected by the gateway. | 1. A method for controlling bus-networked devices in a system comprising a gateway, an open field bus electrically connected to the gateway, and a pluggable connection cable electrically connecting the gateway to a plurality of bus subscribers, the method comprising:
starting, by the gateway, a configuration mode to control a bus subscriber and to generate a new target configuration including the bus subscriber, wherein, according to an initial target configuration, the bus subscriber is not expected by the gateway. 2. The method according to claim 1, further comprising determining, by the gateway in the configuration mode, an identification number for each of the plurality of bus subscribers connected to an application bus included in the pluggable connection cable. 3. The method according to claim 2, wherein the plurality of bus subscribers have consecutive identification numbers. 4. The method according to claim 1, further comprising storing, by each of the plurality of bus subscribers, a specific identification number associated with the respective bus subscriber in a non-volatile manner. 5. The method according to claim 1, further comprising:
storing the new target configuration in the gateway after the configuration mode is complete and each of the plurality of bus subscribers connected to the application bus has been identified; and exchanging at least one of control data and status data between the gateway and the plurality of bus subscribers using the new target configuration. 6. The method according to claim 5, wherein the exchanging is entirely performed by the pluggable connection cable, of which there is only one. 7. The method according to claim 1, wherein the new target configuration includes at least one additional bus subscriber relative to the initial target configuration. 8. The method according to claim 1, further comprising checking, by the gateway in the configuration mode, how many bus subscribers are connected to an application bus included in the pluggable connection cable. 9. The method according to claim 8, further comprising reporting, by at least one report device of the at least one of the plurality of bus subscribers, at least one of an actuator action and an actuator position on the application bus. 10. The method according to claim 1, further comprising replacing or overwriting the initial target configuration in a memory device with the new target configuration. 11. A gateway configured to be electrically connected to an open field bus, to be supplied with primary power by a power supply unit and to be electrically connected by a pluggable connection cable including an application bus to a plurality of bus subscribers, wherein the gateway includes at least one memory device and is configured to start a configuration mode to control a bus subscriber and to generate a new target configuration including the bus subscriber, wherein, according to an initial target configuration, the bus subscriber is not expected by the gateway. 12. The gateway according to claim 11, wherein the gateway, in the configuration mode, is configured to determine an identification number for each of the plurality of bus subscribers connected to the application bus. 13. The gateway according to claim 12, wherein the gateway is configured to store the identification numbers in the at least one memory device in a non-volatile manner. 14. The gateway according to claim 11, wherein the gateway is configured to store the new target configuration in the at least one memory device after the configuration mode is complete and each of the plurality of bus subscribers connected to the application bus has been identified such that at least one of control data and status data is exchangeable between the gateway and the plurality of bus subscribers using the new target configuration. 15. The gateway according to claim 11, wherein the new target configuration includes at least one additional bus subscriber relative to the initial target configuration. 16. The gateway according to claim 11, wherein the gateway, in the configuration mode, is configured to check how many bus subscribers are connected to the application bus. 17. The gateway according to claim 16, wherein the gateway is configured to receive reports from at least one report device of the at least one of the plurality of bus subscribers reporting at least one of an actuator action and an actuator position on the application bus. 18. The gateway according to claim 11, wherein the gateway is configured to be connected between the open field bus and the pluggable connection cable and includes a plurality of connection devices configured to electrically connect to the open field bus, a mains voltage and the pluggable connection cable. 19. The gateway according to claim 11, wherein the gateway includes at least a first feed bushing configured to electrically connect to the power supply unit and at least a second feed bushing configured to electrically connect to an auxiliary power supply unit. 20. The gateway according to claim 11, wherein the gateway includes at least one status display configured to show operating states of the plurality of bus subscribers and of bus communication. | A method for controlling bus-networked devices is useable in a system comprising a gateway, an open field bus electrically connected to the gateway, and a pluggable connection cable electrically connecting the gateway to a plurality of bus subscribers. The gateway starts a configuration mode to control a bus subscriber and to generate a new target configuration including the bus subscriber. According to an initial target configuration, the bus subscriber is not expected by the gateway.1. A method for controlling bus-networked devices in a system comprising a gateway, an open field bus electrically connected to the gateway, and a pluggable connection cable electrically connecting the gateway to a plurality of bus subscribers, the method comprising:
starting, by the gateway, a configuration mode to control a bus subscriber and to generate a new target configuration including the bus subscriber, wherein, according to an initial target configuration, the bus subscriber is not expected by the gateway. 2. The method according to claim 1, further comprising determining, by the gateway in the configuration mode, an identification number for each of the plurality of bus subscribers connected to an application bus included in the pluggable connection cable. 3. The method according to claim 2, wherein the plurality of bus subscribers have consecutive identification numbers. 4. The method according to claim 1, further comprising storing, by each of the plurality of bus subscribers, a specific identification number associated with the respective bus subscriber in a non-volatile manner. 5. The method according to claim 1, further comprising:
storing the new target configuration in the gateway after the configuration mode is complete and each of the plurality of bus subscribers connected to the application bus has been identified; and exchanging at least one of control data and status data between the gateway and the plurality of bus subscribers using the new target configuration. 6. The method according to claim 5, wherein the exchanging is entirely performed by the pluggable connection cable, of which there is only one. 7. The method according to claim 1, wherein the new target configuration includes at least one additional bus subscriber relative to the initial target configuration. 8. The method according to claim 1, further comprising checking, by the gateway in the configuration mode, how many bus subscribers are connected to an application bus included in the pluggable connection cable. 9. The method according to claim 8, further comprising reporting, by at least one report device of the at least one of the plurality of bus subscribers, at least one of an actuator action and an actuator position on the application bus. 10. The method according to claim 1, further comprising replacing or overwriting the initial target configuration in a memory device with the new target configuration. 11. A gateway configured to be electrically connected to an open field bus, to be supplied with primary power by a power supply unit and to be electrically connected by a pluggable connection cable including an application bus to a plurality of bus subscribers, wherein the gateway includes at least one memory device and is configured to start a configuration mode to control a bus subscriber and to generate a new target configuration including the bus subscriber, wherein, according to an initial target configuration, the bus subscriber is not expected by the gateway. 12. The gateway according to claim 11, wherein the gateway, in the configuration mode, is configured to determine an identification number for each of the plurality of bus subscribers connected to the application bus. 13. The gateway according to claim 12, wherein the gateway is configured to store the identification numbers in the at least one memory device in a non-volatile manner. 14. The gateway according to claim 11, wherein the gateway is configured to store the new target configuration in the at least one memory device after the configuration mode is complete and each of the plurality of bus subscribers connected to the application bus has been identified such that at least one of control data and status data is exchangeable between the gateway and the plurality of bus subscribers using the new target configuration. 15. The gateway according to claim 11, wherein the new target configuration includes at least one additional bus subscriber relative to the initial target configuration. 16. The gateway according to claim 11, wherein the gateway, in the configuration mode, is configured to check how many bus subscribers are connected to the application bus. 17. The gateway according to claim 16, wherein the gateway is configured to receive reports from at least one report device of the at least one of the plurality of bus subscribers reporting at least one of an actuator action and an actuator position on the application bus. 18. The gateway according to claim 11, wherein the gateway is configured to be connected between the open field bus and the pluggable connection cable and includes a plurality of connection devices configured to electrically connect to the open field bus, a mains voltage and the pluggable connection cable. 19. The gateway according to claim 11, wherein the gateway includes at least a first feed bushing configured to electrically connect to the power supply unit and at least a second feed bushing configured to electrically connect to an auxiliary power supply unit. 20. The gateway according to claim 11, wherein the gateway includes at least one status display configured to show operating states of the plurality of bus subscribers and of bus communication. | 2,100 |
4,488 | 14,045,656 | 2,154 | The method includes selecting a target record from a dataset, the target record including a missing value, partitioning records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record, predicting the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records, and setting the missing value of the target record to the predicted value. | 1. A method, comprising:
selecting a target record from a dataset, the target record including a missing value; partitioning records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record; predicting the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records; and setting the missing value of the target record to the predicted value. 2. The method of claim 1, wherein selecting the target record from the dataset includes selecting the target record as a record with a fewest number of missing values. 3. The method of claim 1, further comprising:
selecting a target field from the target record, the target field including the missing value. 4. The method of claim 1, wherein partitioning the records of the dataset into at least two groups includes:
filtering the dataset to exclude from the dataset those records missing values for at least one target field, the at least one target field including the missing value. 5. The method of claim 1, wherein partitioning the records of the dataset into at least two groups includes:
determining a mean or average value for a target field, and inserting the mean or average value as a temporary value for each record missing a corresponding value for the target field. 6. The method of claim 1, wherein partitioning the records of the dataset into at least two groups includes:
selecting k-nearest neighbor (KNN) records of the target record. 7. The method of claim 1, wherein predicting the missing value includes:
generating a first linear function based on a first type of co-related data; generating a second linear function based on a second type of co-related data; generate a bi-local linear local model based on the first linear function and the second linear function; and predicting the missing value using the bi-local linear local model. 8. The method of claim 7, wherein
the first type of co-related data is based on quantitative data; and the second type of co-related data is based on qualitative data. 9. The method of claim 1, wherein the dataset is selected from a personal health record (PHR) database. 10. A non-transitory computer-readable storage medium having stored thereon computer executable program code which, when executed on a computer system, causes the computer system to perform steps comprising:
select a target record from a dataset, the target record including a missing value; partition records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record; predict the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records; and set the missing value of the target record to the predicted value. 11. The non-transitory computer-readable storage medium of claim 10, wherein selecting the target record from the dataset includes selecting the target record as a record with a fewest number of missing values. 12. The non-transitory computer-readable storage medium of claim 10, wherein the step further comprising:
select a target field from the target record, the target field including the missing value. 13. The non-transitory computer-readable storage medium of claim 10, wherein partitioning the records of the dataset into at least two groups includes:
filtering the dataset to exclude from the dataset those records missing values for at least one target field, the at least one target field including the missing value. 14. The non-transitory computer-readable storage medium of claim 10, wherein partitioning the records of the dataset into at least two groups includes:
determining a mean or average value for a target field, and inserting the mean or average value as a temporary value for each record missing a corresponding value for the target field. 15. The non-transitory computer-readable storage medium of claim 10, wherein partitioning the records of the dataset into at least two groups includes:
selecting k-nearest neighbor (KNN) records of the target record. 16. The non-transitory computer-readable storage medium of claim 10, wherein predicting the missing value includes:
generating a first linear function based on a first type of co-related data; generating a second linear function based on a second type of co-related data; generating a bi-local linear local model based on the first linear function and the second linear function; and predicting the missing value using the bi-local linear local model. 17. The non-transitory computer-readable storage medium of claim 10, wherein
the first type of co-related data is based on quantitative data; and the second type of co-related data is based on qualitative data. 18. The non-transitory computer-readable storage medium of claim 10, wherein the dataset is selected from a personal health record (PHR) database. 19. An apparatus including a processor and a non-transitory computer readable medium, the apparatus comprising:
a value prediction module configured to:
select a target record from a dataset, the target record including a missing value; and
set the missing value of the target record to a predicted value; and
a model generation module configured to:
partition records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record; and
predict the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records. 20. The apparatus of claim 19, wherein the model generation module is further configured to:
generate a first linear function based on a first type of co-related data; generate a second linear function based on a second type of co-related data; generate a bi-local linear local model based on the first linear function and the second linear function; and predict the missing value using the bi-local linear local model. | The method includes selecting a target record from a dataset, the target record including a missing value, partitioning records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record, predicting the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records, and setting the missing value of the target record to the predicted value.1. A method, comprising:
selecting a target record from a dataset, the target record including a missing value; partitioning records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record; predicting the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records; and setting the missing value of the target record to the predicted value. 2. The method of claim 1, wherein selecting the target record from the dataset includes selecting the target record as a record with a fewest number of missing values. 3. The method of claim 1, further comprising:
selecting a target field from the target record, the target field including the missing value. 4. The method of claim 1, wherein partitioning the records of the dataset into at least two groups includes:
filtering the dataset to exclude from the dataset those records missing values for at least one target field, the at least one target field including the missing value. 5. The method of claim 1, wherein partitioning the records of the dataset into at least two groups includes:
determining a mean or average value for a target field, and inserting the mean or average value as a temporary value for each record missing a corresponding value for the target field. 6. The method of claim 1, wherein partitioning the records of the dataset into at least two groups includes:
selecting k-nearest neighbor (KNN) records of the target record. 7. The method of claim 1, wherein predicting the missing value includes:
generating a first linear function based on a first type of co-related data; generating a second linear function based on a second type of co-related data; generate a bi-local linear local model based on the first linear function and the second linear function; and predicting the missing value using the bi-local linear local model. 8. The method of claim 7, wherein
the first type of co-related data is based on quantitative data; and the second type of co-related data is based on qualitative data. 9. The method of claim 1, wherein the dataset is selected from a personal health record (PHR) database. 10. A non-transitory computer-readable storage medium having stored thereon computer executable program code which, when executed on a computer system, causes the computer system to perform steps comprising:
select a target record from a dataset, the target record including a missing value; partition records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record; predict the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records; and set the missing value of the target record to the predicted value. 11. The non-transitory computer-readable storage medium of claim 10, wherein selecting the target record from the dataset includes selecting the target record as a record with a fewest number of missing values. 12. The non-transitory computer-readable storage medium of claim 10, wherein the step further comprising:
select a target field from the target record, the target field including the missing value. 13. The non-transitory computer-readable storage medium of claim 10, wherein partitioning the records of the dataset into at least two groups includes:
filtering the dataset to exclude from the dataset those records missing values for at least one target field, the at least one target field including the missing value. 14. The non-transitory computer-readable storage medium of claim 10, wherein partitioning the records of the dataset into at least two groups includes:
determining a mean or average value for a target field, and inserting the mean or average value as a temporary value for each record missing a corresponding value for the target field. 15. The non-transitory computer-readable storage medium of claim 10, wherein partitioning the records of the dataset into at least two groups includes:
selecting k-nearest neighbor (KNN) records of the target record. 16. The non-transitory computer-readable storage medium of claim 10, wherein predicting the missing value includes:
generating a first linear function based on a first type of co-related data; generating a second linear function based on a second type of co-related data; generating a bi-local linear local model based on the first linear function and the second linear function; and predicting the missing value using the bi-local linear local model. 17. The non-transitory computer-readable storage medium of claim 10, wherein
the first type of co-related data is based on quantitative data; and the second type of co-related data is based on qualitative data. 18. The non-transitory computer-readable storage medium of claim 10, wherein the dataset is selected from a personal health record (PHR) database. 19. An apparatus including a processor and a non-transitory computer readable medium, the apparatus comprising:
a value prediction module configured to:
select a target record from a dataset, the target record including a missing value; and
set the missing value of the target record to a predicted value; and
a model generation module configured to:
partition records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record; and
predict the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records. 20. The apparatus of claim 19, wherein the model generation module is further configured to:
generate a first linear function based on a first type of co-related data; generate a second linear function based on a second type of co-related data; generate a bi-local linear local model based on the first linear function and the second linear function; and predict the missing value using the bi-local linear local model. | 2,100 |
4,489 | 13,875,128 | 2,174 | Systems and methods for displaying a moveable interactive element that can display information about control elements are provided. A system and method can include displaying one or more control elements of a user interface, and receiving initial touch input. In response to the initial touch input, the interactive element can displayed in the user interface. Further touch input corresponding to dragging the interactive element onto a control element can be received. The interactive element can be associated with the control element, and content related to the functionality of the control element can be determined. The content can then be displayed within the interactive element. | 1. A computer-implemented method, comprising:
displaying, by a computing device, one or more control elements of a user interface; receiving initial touch input; in response to the initial touch input, displaying an interactive element in the user interface; receiving further touch input corresponding to dragging the interactive element onto a control element; associating the interactive element with the control element; determining content related to the functionality of the control element; and displaying the content within the interactive element. 2. The method of claim 1, further comprising:
receiving further touch input corresponding to dragging the interactive element associated with the control element to a region of the user interface associated with no control elements; disassociating the interactive element from the control element; and removing the interactive element from the user interface. 3. The method of claim 1, wherein the control element is a first control element, and wherein the method further comprises:
receiving touch input corresponding to dragging the interactive element associated with the first control element onto a second control element; dissociating the interactive element from the first control element; associating the interactive element with the second control element; determining content related to the functionality of the second control element; and displaying the content related to the functionality of the second control element within the interactive element. 4. The method of claim 1, wherein the initial touch input corresponds to a selection of a help element displayed in the user interface. 5. The method of claim 1, wherein the initial touch input corresponds to an initiation of an application. 6. The method of claim 1, wherein the method further comprises determining that the touch input corresponding to dragging the interactive element onto the control element has stopped, and wherein associating the interactive element with the control element comprises fixing the interactive element adjacent to the control element in the user interface. 7. The method of claim 1, wherein determining the content related to the functionality of the control element comprises retrieving the content from a data table. 8. The method of claim 7, wherein the data table is stored in a memory of the computing device. 9. The method of claim 7, wherein the data table is stored in a remote database. 10. The method of claim 1, further comprising:
displaying an affordance element within the interactive element while the content related to the functionality of the control element is displayed; receiving touch input corresponding to a selection of the affordance element; determining reference information related to the functionality of the control element; and displaying the reference information in the user interface. 11. A computer-implemented system, comprising:
one or more data processors; and one or more non-transitory computer-readable storage media containing instructions configured to cause the one or more processors to perform operations including:
displaying one or more control elements of a user interface;
receiving initial touch input;
in response to the initial touch input, displaying an interactive element in the user interface;
receiving further touch input corresponding to dragging the interactive element onto a control element;
associating the interactive element with the control element;
determining content related to the functionality of the control element; and
displaying the content within the interactive element. 12. The system of claim 11, further comprising instructions configured to cause the one or more processors to perform operations including:
receiving further touch input corresponding to dragging the interactive element associated with the control element to a region of the user interface associated with no control elements; disassociating the interactive element from the control element; and removing the interactive element from the user interface. 13. The system of claim 11, wherein the control element is a first control element, and wherein the system further comprises instructions configured to cause the one or more processors to perform operations including:
receiving touch input corresponding to dragging the interactive element associated with the first control element onto a second control element; dissociating the interactive element from the first control element; associating the interactive element with the second control element; determining content related to the functionality of the second control element; and displaying the content related to the functionality of the second control element within the interactive element. 14. The system of claim 11, wherein the initial touch input corresponds to a selection of a help element displayed in the user interface. 15. The system of claim 11, wherein the initial touch input corresponds to an initiation of an application. 16. The system of claim 11, further comprising instructions configured to cause the one or more processors to determine that the touch input corresponding to dragging the interactive element onto the control element has stopped, wherein associating the interactive element with the control element comprises fixing the interactive element adjacent to the control element in the user interface. 17. The system of claim 11, wherein determining the content related to the functionality of the control element comprises retrieving the content from a data table. 18. The system of claim 17, wherein the data table is stored in a memory of the computing device. 19. The system of claim 17, wherein the data table is stored in a remote database. 20. The system of claim 11, further comprising instructions configured to cause the one or more processors to perform operations including:
displaying an affordance element within the interactive element while the content related to the functionality of the control element is displayed; receiving touch input corresponding to a selection of the affordance element; determining reference information related to the functionality of the control element; and displaying the reference information in the user interface. 21. A computer-program product, tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause a data processing apparatus to:
display one or more control elements of a user interface; receive initial touch input; in response to the initial touch input, display an interactive element in the user interface; receive further touch input corresponding to dragging the interactive element onto a control element; associate the interactive element with the control element; determine content related to the functionality of the control element; and display the content within the interactive element. 22. The computer-program product of claim 21, further comprising instructions configured to cause the data processing apparatus to:
receive further touch input corresponding to dragging the interactive element associated with the control element to a region of the user interface associated with no control elements; disassociate the interactive element from the control element; and remove the interactive element from the user interface. 23. The computer-program product of claim 21, wherein the control element is a first control element, and wherein the computer-program product further comprises instructions configured to cause the data processing apparatus to:
receive touch input corresponding to dragging the interactive element associated with the first control element onto a second control element; dissociate the interactive element from the first control element; associate the interactive element with the second control element; determine content related to the functionality of the second control element; and display the content related to the functionality of the second control element within the interactive element. 24. The computer-program product of claim 21, wherein the initial touch input corresponds to a selection of a help element displayed in the user interface. 25. The computer-program product of claim 21, wherein the initial touch input corresponds to an initiation of an application. 26. The computer-program product of claim 21, further comprising instructions configured to cause the data processing apparatus to determine that the touch input corresponding to dragging the interactive element onto the control element has stopped, and wherein associating the interactive element with the control element comprises fixing the interactive element adjacent to the control element in the user interface. 27. The computer-program product of claim 21, wherein determining the content related to the functionality of the control element comprises retrieving the content from a data table. 28. The computer-program product of claim 27, wherein the data table is stored in a memory of the computing device. 29. The computer-program product of claim 27, wherein the data table is stored in a remote database. 30. The computer-program product of claim 21, further comprising instructions configured to cause the data processing apparatus to:
display an affordance element within the interactive element while the content related to the functionality of the control element is displayed; receive touch input corresponding to a selection of the affordance element; determine reference information related to the functionality of the control element; and display the reference information in the user interface. | Systems and methods for displaying a moveable interactive element that can display information about control elements are provided. A system and method can include displaying one or more control elements of a user interface, and receiving initial touch input. In response to the initial touch input, the interactive element can displayed in the user interface. Further touch input corresponding to dragging the interactive element onto a control element can be received. The interactive element can be associated with the control element, and content related to the functionality of the control element can be determined. The content can then be displayed within the interactive element.1. A computer-implemented method, comprising:
displaying, by a computing device, one or more control elements of a user interface; receiving initial touch input; in response to the initial touch input, displaying an interactive element in the user interface; receiving further touch input corresponding to dragging the interactive element onto a control element; associating the interactive element with the control element; determining content related to the functionality of the control element; and displaying the content within the interactive element. 2. The method of claim 1, further comprising:
receiving further touch input corresponding to dragging the interactive element associated with the control element to a region of the user interface associated with no control elements; disassociating the interactive element from the control element; and removing the interactive element from the user interface. 3. The method of claim 1, wherein the control element is a first control element, and wherein the method further comprises:
receiving touch input corresponding to dragging the interactive element associated with the first control element onto a second control element; dissociating the interactive element from the first control element; associating the interactive element with the second control element; determining content related to the functionality of the second control element; and displaying the content related to the functionality of the second control element within the interactive element. 4. The method of claim 1, wherein the initial touch input corresponds to a selection of a help element displayed in the user interface. 5. The method of claim 1, wherein the initial touch input corresponds to an initiation of an application. 6. The method of claim 1, wherein the method further comprises determining that the touch input corresponding to dragging the interactive element onto the control element has stopped, and wherein associating the interactive element with the control element comprises fixing the interactive element adjacent to the control element in the user interface. 7. The method of claim 1, wherein determining the content related to the functionality of the control element comprises retrieving the content from a data table. 8. The method of claim 7, wherein the data table is stored in a memory of the computing device. 9. The method of claim 7, wherein the data table is stored in a remote database. 10. The method of claim 1, further comprising:
displaying an affordance element within the interactive element while the content related to the functionality of the control element is displayed; receiving touch input corresponding to a selection of the affordance element; determining reference information related to the functionality of the control element; and displaying the reference information in the user interface. 11. A computer-implemented system, comprising:
one or more data processors; and one or more non-transitory computer-readable storage media containing instructions configured to cause the one or more processors to perform operations including:
displaying one or more control elements of a user interface;
receiving initial touch input;
in response to the initial touch input, displaying an interactive element in the user interface;
receiving further touch input corresponding to dragging the interactive element onto a control element;
associating the interactive element with the control element;
determining content related to the functionality of the control element; and
displaying the content within the interactive element. 12. The system of claim 11, further comprising instructions configured to cause the one or more processors to perform operations including:
receiving further touch input corresponding to dragging the interactive element associated with the control element to a region of the user interface associated with no control elements; disassociating the interactive element from the control element; and removing the interactive element from the user interface. 13. The system of claim 11, wherein the control element is a first control element, and wherein the system further comprises instructions configured to cause the one or more processors to perform operations including:
receiving touch input corresponding to dragging the interactive element associated with the first control element onto a second control element; dissociating the interactive element from the first control element; associating the interactive element with the second control element; determining content related to the functionality of the second control element; and displaying the content related to the functionality of the second control element within the interactive element. 14. The system of claim 11, wherein the initial touch input corresponds to a selection of a help element displayed in the user interface. 15. The system of claim 11, wherein the initial touch input corresponds to an initiation of an application. 16. The system of claim 11, further comprising instructions configured to cause the one or more processors to determine that the touch input corresponding to dragging the interactive element onto the control element has stopped, wherein associating the interactive element with the control element comprises fixing the interactive element adjacent to the control element in the user interface. 17. The system of claim 11, wherein determining the content related to the functionality of the control element comprises retrieving the content from a data table. 18. The system of claim 17, wherein the data table is stored in a memory of the computing device. 19. The system of claim 17, wherein the data table is stored in a remote database. 20. The system of claim 11, further comprising instructions configured to cause the one or more processors to perform operations including:
displaying an affordance element within the interactive element while the content related to the functionality of the control element is displayed; receiving touch input corresponding to a selection of the affordance element; determining reference information related to the functionality of the control element; and displaying the reference information in the user interface. 21. A computer-program product, tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause a data processing apparatus to:
display one or more control elements of a user interface; receive initial touch input; in response to the initial touch input, display an interactive element in the user interface; receive further touch input corresponding to dragging the interactive element onto a control element; associate the interactive element with the control element; determine content related to the functionality of the control element; and display the content within the interactive element. 22. The computer-program product of claim 21, further comprising instructions configured to cause the data processing apparatus to:
receive further touch input corresponding to dragging the interactive element associated with the control element to a region of the user interface associated with no control elements; disassociate the interactive element from the control element; and remove the interactive element from the user interface. 23. The computer-program product of claim 21, wherein the control element is a first control element, and wherein the computer-program product further comprises instructions configured to cause the data processing apparatus to:
receive touch input corresponding to dragging the interactive element associated with the first control element onto a second control element; dissociate the interactive element from the first control element; associate the interactive element with the second control element; determine content related to the functionality of the second control element; and display the content related to the functionality of the second control element within the interactive element. 24. The computer-program product of claim 21, wherein the initial touch input corresponds to a selection of a help element displayed in the user interface. 25. The computer-program product of claim 21, wherein the initial touch input corresponds to an initiation of an application. 26. The computer-program product of claim 21, further comprising instructions configured to cause the data processing apparatus to determine that the touch input corresponding to dragging the interactive element onto the control element has stopped, and wherein associating the interactive element with the control element comprises fixing the interactive element adjacent to the control element in the user interface. 27. The computer-program product of claim 21, wherein determining the content related to the functionality of the control element comprises retrieving the content from a data table. 28. The computer-program product of claim 27, wherein the data table is stored in a memory of the computing device. 29. The computer-program product of claim 27, wherein the data table is stored in a remote database. 30. The computer-program product of claim 21, further comprising instructions configured to cause the data processing apparatus to:
display an affordance element within the interactive element while the content related to the functionality of the control element is displayed; receive touch input corresponding to a selection of the affordance element; determine reference information related to the functionality of the control element; and display the reference information in the user interface. | 2,100 |
4,490 | 14,041,751 | 2,131 | A method for specifying packet address range cacheability is provided. The method includes passing a memory allocation request from an application running on a network element configured to implement packet forwarding operations to an operating system of a network element, the memory allocation request including a table ID associated with an application table to be stored using the memory allocation. The method also includes allocating a memory address range by the operating system to the application in response to the memory allocation request, and inserting an entry in a cacheability register, the entry including the table ID included in the memory allocation request and the memory address range allocated in response to the memory allocation request. | 1. A method for specifying packet address range cacheability, the method comprising the steps of:
passing a memory allocation request from an application, running on a network element configured to implement packet forwarding operations, to an operating system of the network element, the memory allocation request including a table ID associated with an application table to be stored using the memory allocation; allocating a memory address range by the operating system to the application in response to the memory allocation request; and inserting an entry in a cacheability register, the entry including the table ID included in the memory allocation request and the memory address range allocated in response to the memory allocation request. 2. The method of claim 1, wherein the memory allocation request further includes a memory allocation size and an application ID. 3. The method of claim 1, further comprising setting a cacheability indicator for the entry in the cacheability register, the cacheability indicator specifying whether a cache miss associated with a memory address within the allocated memory address range will trigger a cache update operation. 4. The method of claim 3, wherein the step of setting the cacheability indicator is derived from information contained in the memory allocation request. 5. The method of claim 3, further comprising receiving first cacheability information associated with the table ID from a management application, and wherein the step of setting the cacheability indicator is derived from the first cacheability information. 6. The method of claim 5, further comprising the steps of:
receiving second cacheability information associated with the table ID from the management application; and changing the cacheability indicator for the entry in the cacheability register, based on the second information. 7. The method of claim 6, wherein the first information comprises an indication that the memory allocation associated with the table ID is cacheable such that a cache miss associated with a memory address within the allocated memory address range will trigger a cache update operation. 8. The method of claim 7, wherein the second information comprises an indication that the memory allocation associated with the table ID is not cacheable such that a cache miss associated with a memory address within the allocated memory address range will not trigger a cache update operation. 9. The method of claim 3, wherein the cache update operation comprises execution of a cache replacement algorithm to selectively update the cache. 10. A memory allocation request operating system call, comprising:
an application ID; a table ID; and a memory allocation size. 11. The memory allocation request operating system call of claim 10, wherein the memory allocation request operating system call further comprises a cacheability indication associated with the table ID. 12. A network element, comprising:
a network processing unit; packet forwarding hardware under the control of the network processing unit; a cache associated with the network processing unit; a physical memory connected to the network processing unit and not implemented as part of the cache; a plurality of packet address tables stored in the memory, at least part of the plurality of packet address tables also being duplicated in the cache; and a cacheability register containing entries specifying cacheability of address ranges in the physical memory on a per packet address table ID basis. 13. The network element of claim 12, wherein the cacheability register entries are associated with memory allocations of physical memory, the cacheability register entries being created in response to memory allocation requests. 14. The network element of claim 12, further comprising a cache controller configured to use the entries in the cacheability register to implement a cacheability screening operation. 15. The network element of claim 14, wherein the cache controller is further configured to implement a cache replacement algorithm when a cache miss passes the cacheability screening operation. 16. The network element of claim 14, wherein the cacheability screening operation comprises comparing an address in physical memory with the entries in the cacheability register and determining, from one of the entries encompassing the address, whether the address is within a cacheable range of memory addresses. | A method for specifying packet address range cacheability is provided. The method includes passing a memory allocation request from an application running on a network element configured to implement packet forwarding operations to an operating system of a network element, the memory allocation request including a table ID associated with an application table to be stored using the memory allocation. The method also includes allocating a memory address range by the operating system to the application in response to the memory allocation request, and inserting an entry in a cacheability register, the entry including the table ID included in the memory allocation request and the memory address range allocated in response to the memory allocation request.1. A method for specifying packet address range cacheability, the method comprising the steps of:
passing a memory allocation request from an application, running on a network element configured to implement packet forwarding operations, to an operating system of the network element, the memory allocation request including a table ID associated with an application table to be stored using the memory allocation; allocating a memory address range by the operating system to the application in response to the memory allocation request; and inserting an entry in a cacheability register, the entry including the table ID included in the memory allocation request and the memory address range allocated in response to the memory allocation request. 2. The method of claim 1, wherein the memory allocation request further includes a memory allocation size and an application ID. 3. The method of claim 1, further comprising setting a cacheability indicator for the entry in the cacheability register, the cacheability indicator specifying whether a cache miss associated with a memory address within the allocated memory address range will trigger a cache update operation. 4. The method of claim 3, wherein the step of setting the cacheability indicator is derived from information contained in the memory allocation request. 5. The method of claim 3, further comprising receiving first cacheability information associated with the table ID from a management application, and wherein the step of setting the cacheability indicator is derived from the first cacheability information. 6. The method of claim 5, further comprising the steps of:
receiving second cacheability information associated with the table ID from the management application; and changing the cacheability indicator for the entry in the cacheability register, based on the second information. 7. The method of claim 6, wherein the first information comprises an indication that the memory allocation associated with the table ID is cacheable such that a cache miss associated with a memory address within the allocated memory address range will trigger a cache update operation. 8. The method of claim 7, wherein the second information comprises an indication that the memory allocation associated with the table ID is not cacheable such that a cache miss associated with a memory address within the allocated memory address range will not trigger a cache update operation. 9. The method of claim 3, wherein the cache update operation comprises execution of a cache replacement algorithm to selectively update the cache. 10. A memory allocation request operating system call, comprising:
an application ID; a table ID; and a memory allocation size. 11. The memory allocation request operating system call of claim 10, wherein the memory allocation request operating system call further comprises a cacheability indication associated with the table ID. 12. A network element, comprising:
a network processing unit; packet forwarding hardware under the control of the network processing unit; a cache associated with the network processing unit; a physical memory connected to the network processing unit and not implemented as part of the cache; a plurality of packet address tables stored in the memory, at least part of the plurality of packet address tables also being duplicated in the cache; and a cacheability register containing entries specifying cacheability of address ranges in the physical memory on a per packet address table ID basis. 13. The network element of claim 12, wherein the cacheability register entries are associated with memory allocations of physical memory, the cacheability register entries being created in response to memory allocation requests. 14. The network element of claim 12, further comprising a cache controller configured to use the entries in the cacheability register to implement a cacheability screening operation. 15. The network element of claim 14, wherein the cache controller is further configured to implement a cache replacement algorithm when a cache miss passes the cacheability screening operation. 16. The network element of claim 14, wherein the cacheability screening operation comprises comparing an address in physical memory with the entries in the cacheability register and determining, from one of the entries encompassing the address, whether the address is within a cacheable range of memory addresses. | 2,100 |
4,491 | 13,328,682 | 2,136 | A method of managing a database system using a swarm database system that communicates a request to read data to at least a subset of nodes. Checking the identifier by each respective node in the subset of nodes to determine if the requested read data is stored in the node. Providing the read data to the first node if the respective node in the subset includes read data. | 1. A method of managing a database system comprising:
at a swarm database system having one or more nodes comprising one or more processors and memory, the memory of the one or more nodes storing one or more programs to be executed by the one or more processors; communicating a request to read data by a first node to at least a subset of nodes in the one or more nodes; checking the identifier by each respective node in the at least the subset of nodes, to determine if the requested read data is stored in the respective node; and providing the read data to the first node if the respective node in the at least a subset of nodes includes the read data. 2. The method of claim 1, further comprising checking a cache storage associated with each respective node in the at least the subset of nodes before checking other storage allocations of the respective node. 3. The method of claim 2, further comprising managing one or more read operations by a reader daemon associated with each respective node in the at least subset of nodes. 4. The method of claim 2, wherein the cache storage is one of a group consisting of RAM, a server storage, Flash storage on a solid-state drive and Flash on a peripheral component interconnect express card. 5. The method of claim 2, wherein the cache is managed by a cache daemon. 6. The method of claim 1, wherein communicating a request to read data includes a request to get data from a row of hashed keys in a table stored on a bucket of a respective node in at least the subset of nodes, and checking the identifier by each respective node includes hashing a row key as the identifier to determine which one or more buckets in one of the nodes of the subset of nodes contains the requested data. 7. The method of claim 1, wherein the read data is stored in the subset of nodes as a plurality of replications of the read data and at least one of the replications is stored in a cache of one of the subset of nodes. 8. The method of claim 1, wherein the subset of nodes communicates with each other to determine the location of the read data. 9. The method of claim 1, wherein the read data is stored in a plurality of hierarchical levels ranging from most recent to oldest stored data, and wherein communicating the request to read data includes indicating a hierarchical level to seek the read data up to the indicated hierarchical level at each node of the subset of nodes. | A method of managing a database system using a swarm database system that communicates a request to read data to at least a subset of nodes. Checking the identifier by each respective node in the subset of nodes to determine if the requested read data is stored in the node. Providing the read data to the first node if the respective node in the subset includes read data.1. A method of managing a database system comprising:
at a swarm database system having one or more nodes comprising one or more processors and memory, the memory of the one or more nodes storing one or more programs to be executed by the one or more processors; communicating a request to read data by a first node to at least a subset of nodes in the one or more nodes; checking the identifier by each respective node in the at least the subset of nodes, to determine if the requested read data is stored in the respective node; and providing the read data to the first node if the respective node in the at least a subset of nodes includes the read data. 2. The method of claim 1, further comprising checking a cache storage associated with each respective node in the at least the subset of nodes before checking other storage allocations of the respective node. 3. The method of claim 2, further comprising managing one or more read operations by a reader daemon associated with each respective node in the at least subset of nodes. 4. The method of claim 2, wherein the cache storage is one of a group consisting of RAM, a server storage, Flash storage on a solid-state drive and Flash on a peripheral component interconnect express card. 5. The method of claim 2, wherein the cache is managed by a cache daemon. 6. The method of claim 1, wherein communicating a request to read data includes a request to get data from a row of hashed keys in a table stored on a bucket of a respective node in at least the subset of nodes, and checking the identifier by each respective node includes hashing a row key as the identifier to determine which one or more buckets in one of the nodes of the subset of nodes contains the requested data. 7. The method of claim 1, wherein the read data is stored in the subset of nodes as a plurality of replications of the read data and at least one of the replications is stored in a cache of one of the subset of nodes. 8. The method of claim 1, wherein the subset of nodes communicates with each other to determine the location of the read data. 9. The method of claim 1, wherein the read data is stored in a plurality of hierarchical levels ranging from most recent to oldest stored data, and wherein communicating the request to read data includes indicating a hierarchical level to seek the read data up to the indicated hierarchical level at each node of the subset of nodes. | 2,100 |
4,492 | 14,220,601 | 2,176 | An apparatus and a method for editing a table in a terminal which can edit a table intuitively and easily are provided. The apparatus includes a display unit that simultaneously displays a row number adjusting UI and a column number adjusting UI in a table editing mode, and a controller that performs a control so that a plurality of handlers are displayed on the table when the table displayed in a specific application is selected, a conversion to the table editing mode is performed when a specific handler among the plurality of handlers is selected, and respective UIs that can adjust the number of rows and the number of columns of the table in the table editing mode are simultaneously displayed. | 1. An apparatus for editing a table in a terminal, the apparatus comprising:
a display unit configured to simultaneously display a row number adjusting User Interface (UI) and a column number adjusting UI in a table editing mode; and a controller configured to control so that a plurality of handlers are displayed on the table when the table displayed in a specific application is selected, a conversion to the table editing mode is performed when a specific handler among the plurality of handlers is selected, and respective UIs that can adjust the number of rows and the number of columns of the table in the table editing mode are simultaneously displayed. 2. The apparatus according to claim 1, wherein the controller is further configured to control in the table editing mode so that the row number adjusting UI is displayed on one of a left side and a right side of the table and column number adjusting UI is displayed on one of an upper side and a lower side of the table. 3. The apparatus according to claim 1,
wherein the row number adjusting UI comprises a row inserting UI, a row deleting UI, and the number of rows existing in the table, and the column number adjusting UI comprises a column inserting UI, a column deleting UI, and the number of columns existing in the table. 4. The apparatus according to claim 1, wherein the controller is further configured to control so that the row number adjusting UI is displayed on a left side of the table in the table editing mode when the specific handler is a handler positioned on the left side among the plurality of handlers displayed on the table, and the column number adjusting UI is displayed on a right side of the table in the table editing mode when the specific handler is a handler positioned on the right side among the plurality of handlers displayed on the table. 5. The apparatus according to claim 1, wherein the controller is further configured to adjust the number of rows in the table based on a standard when the row number adjusting UI is selected in the table editing mode, and to adjust the number of columns in the table based on the standard when the column number adjusting UI is selected in the table editing mode. 6. The apparatus according to claim 1, wherein the controller is further configured to determine whether a specific portion of the table is selected to include the specific row or the specific column of the table when the specific portion of the table is selected in the table editing mode, to adjust the number of rows based on the specific row, if the row number adjusting UI is selected, when the specific row is selected, and to adjust the number of columns based on the specific column, if the column number adjusting UI is selected, when the specific column is selected. 7. The apparatus according to claim 6, wherein the controller is further configured to control so that the column number adjusting UI is deactivated when the specific row is selected, and the row number adjusting UI is deactivated when the specific column is selected. 8. The apparatus according to claim 1, wherein the controller is further configured to adjust the number of rows based on a specific row in which data exists, if data exists in the table, when the row number adjusting UI is selected in the table editing mode, and to adjust the number of columns based on a specific column in which data exists, if data exists in the table, when the column number adjusting UI is selected. 9. A method for editing a table in a terminal, the method comprising:
displaying a plurality of handlers on a table when the table displayed in a specific application is selected; performing a conversion to a table editing mode, when a specific handler selected among the plurality of handlers; and simultaneously displaying a row number adjusting User Interface (UI) and a column number adjusting UI that can respectively adjust the number of rows and the number of columns on the table in the table editing mode. 10. The method according to claim 9, wherein the row number adjusting UI is displayed on one of a left side or a right side of the table in the table editing mode, and the column number adjusting UI is displayed on one of an upper side or a lower side of the table. 11. The method according to claim 9, wherein the row number adjusting UI comprises a row inserting UI, a row deleting UI, and the number of rows existing in the table, and the column number adjusting UI comprises a column inserting UI, a column deleting UI, and the number of columns existing in the table. 12. The method according to claim 9, wherein the displaying of the plurality of handlers comprises:
determining a position of the specific handler on the table, when the specific handler is selected among the plurality of handlers; displaying the row number adjusting UI on a left side of the table in the table editing mode when the specific handler is positioned on a left side of the table; and displaying the column number adjusting UI on a right side of the table in the table editing mode when the specific handler is positioned on a right side of the table. 13. The method according to claim 9, further comprising:
adjusting the number of rows in the table based on a standard when the row number adjusting UI is selected in the table editing mode; and adjusting the number of columns in the table based on a standard when the column number adjusting UI is selected in the table editing mode. 14. The method according to claim 9, further comprising:
determining whether a specific portion of the table is selected to include the specific row or the specific column of the table when the specific portion is selected in the table editing mode; adjusting the number of rows based on the specific row, if the row number adjusting UI is selected, when the specific row is selected, and adjusting the number of columns based on the specific column, if the column number adjusting UI is selected, when the specific column is selected. 15. The method according to claim 14, wherein the column number adjusting UI is deactivated when the specific row is selected, and the row number adjusting UI is deactivated when the specific column is selected. 16. The method according to claim 9, further comprising:
adjusting the number of rows based on a specific row in which data exists, if data exists in the table, when the row number adjusting UI is selected in the table editing mode; and adjusting the number of columns based on a specific column in which data exists, if data exists in the table, when the column number adjusting UI is selected. 17. A non-transitory computer-readable storage medium storing instructions that, when executed, cause at least one processor to perform the method of claim 9. | An apparatus and a method for editing a table in a terminal which can edit a table intuitively and easily are provided. The apparatus includes a display unit that simultaneously displays a row number adjusting UI and a column number adjusting UI in a table editing mode, and a controller that performs a control so that a plurality of handlers are displayed on the table when the table displayed in a specific application is selected, a conversion to the table editing mode is performed when a specific handler among the plurality of handlers is selected, and respective UIs that can adjust the number of rows and the number of columns of the table in the table editing mode are simultaneously displayed.1. An apparatus for editing a table in a terminal, the apparatus comprising:
a display unit configured to simultaneously display a row number adjusting User Interface (UI) and a column number adjusting UI in a table editing mode; and a controller configured to control so that a plurality of handlers are displayed on the table when the table displayed in a specific application is selected, a conversion to the table editing mode is performed when a specific handler among the plurality of handlers is selected, and respective UIs that can adjust the number of rows and the number of columns of the table in the table editing mode are simultaneously displayed. 2. The apparatus according to claim 1, wherein the controller is further configured to control in the table editing mode so that the row number adjusting UI is displayed on one of a left side and a right side of the table and column number adjusting UI is displayed on one of an upper side and a lower side of the table. 3. The apparatus according to claim 1,
wherein the row number adjusting UI comprises a row inserting UI, a row deleting UI, and the number of rows existing in the table, and the column number adjusting UI comprises a column inserting UI, a column deleting UI, and the number of columns existing in the table. 4. The apparatus according to claim 1, wherein the controller is further configured to control so that the row number adjusting UI is displayed on a left side of the table in the table editing mode when the specific handler is a handler positioned on the left side among the plurality of handlers displayed on the table, and the column number adjusting UI is displayed on a right side of the table in the table editing mode when the specific handler is a handler positioned on the right side among the plurality of handlers displayed on the table. 5. The apparatus according to claim 1, wherein the controller is further configured to adjust the number of rows in the table based on a standard when the row number adjusting UI is selected in the table editing mode, and to adjust the number of columns in the table based on the standard when the column number adjusting UI is selected in the table editing mode. 6. The apparatus according to claim 1, wherein the controller is further configured to determine whether a specific portion of the table is selected to include the specific row or the specific column of the table when the specific portion of the table is selected in the table editing mode, to adjust the number of rows based on the specific row, if the row number adjusting UI is selected, when the specific row is selected, and to adjust the number of columns based on the specific column, if the column number adjusting UI is selected, when the specific column is selected. 7. The apparatus according to claim 6, wherein the controller is further configured to control so that the column number adjusting UI is deactivated when the specific row is selected, and the row number adjusting UI is deactivated when the specific column is selected. 8. The apparatus according to claim 1, wherein the controller is further configured to adjust the number of rows based on a specific row in which data exists, if data exists in the table, when the row number adjusting UI is selected in the table editing mode, and to adjust the number of columns based on a specific column in which data exists, if data exists in the table, when the column number adjusting UI is selected. 9. A method for editing a table in a terminal, the method comprising:
displaying a plurality of handlers on a table when the table displayed in a specific application is selected; performing a conversion to a table editing mode, when a specific handler selected among the plurality of handlers; and simultaneously displaying a row number adjusting User Interface (UI) and a column number adjusting UI that can respectively adjust the number of rows and the number of columns on the table in the table editing mode. 10. The method according to claim 9, wherein the row number adjusting UI is displayed on one of a left side or a right side of the table in the table editing mode, and the column number adjusting UI is displayed on one of an upper side or a lower side of the table. 11. The method according to claim 9, wherein the row number adjusting UI comprises a row inserting UI, a row deleting UI, and the number of rows existing in the table, and the column number adjusting UI comprises a column inserting UI, a column deleting UI, and the number of columns existing in the table. 12. The method according to claim 9, wherein the displaying of the plurality of handlers comprises:
determining a position of the specific handler on the table, when the specific handler is selected among the plurality of handlers; displaying the row number adjusting UI on a left side of the table in the table editing mode when the specific handler is positioned on a left side of the table; and displaying the column number adjusting UI on a right side of the table in the table editing mode when the specific handler is positioned on a right side of the table. 13. The method according to claim 9, further comprising:
adjusting the number of rows in the table based on a standard when the row number adjusting UI is selected in the table editing mode; and adjusting the number of columns in the table based on a standard when the column number adjusting UI is selected in the table editing mode. 14. The method according to claim 9, further comprising:
determining whether a specific portion of the table is selected to include the specific row or the specific column of the table when the specific portion is selected in the table editing mode; adjusting the number of rows based on the specific row, if the row number adjusting UI is selected, when the specific row is selected, and adjusting the number of columns based on the specific column, if the column number adjusting UI is selected, when the specific column is selected. 15. The method according to claim 14, wherein the column number adjusting UI is deactivated when the specific row is selected, and the row number adjusting UI is deactivated when the specific column is selected. 16. The method according to claim 9, further comprising:
adjusting the number of rows based on a specific row in which data exists, if data exists in the table, when the row number adjusting UI is selected in the table editing mode; and adjusting the number of columns based on a specific column in which data exists, if data exists in the table, when the column number adjusting UI is selected. 17. A non-transitory computer-readable storage medium storing instructions that, when executed, cause at least one processor to perform the method of claim 9. | 2,100 |
4,493 | 15,273,426 | 2,132 | A system comprising a memory controller coupled to a memory device is described. The memory device is coupled to, and is external to, the memory controller. The memory device includes a storage array having dual configurability to support both synchronous and asynchronous modes of operation. | 1. A system comprising:
a memory controller; and a memory device coupled to and external to the memory controller, the memory device comprising a storage array having dual configurability to support both synchronous and asynchronous modes of operation. 2. The system of claim 1, wherein the memory controller controls access to the storage array in a first mode of operation during a first time period and in a second mode of operation during a second time period. 3. The system of claim 2, wherein the first mode of operation is a synchronous mode and the second mode of operation is an asynchronous mode. 4. The system of claim 1, wherein the storage array is one of a Static Random Access Memory (SRAM) array, an array of registers, and an array of latches. 5. The system of claim 1, wherein the memory controller is one of a microprocessor, a microcontroller, and an application specific integrated circuit (ASIC). | A system comprising a memory controller coupled to a memory device is described. The memory device is coupled to, and is external to, the memory controller. The memory device includes a storage array having dual configurability to support both synchronous and asynchronous modes of operation.1. A system comprising:
a memory controller; and a memory device coupled to and external to the memory controller, the memory device comprising a storage array having dual configurability to support both synchronous and asynchronous modes of operation. 2. The system of claim 1, wherein the memory controller controls access to the storage array in a first mode of operation during a first time period and in a second mode of operation during a second time period. 3. The system of claim 2, wherein the first mode of operation is a synchronous mode and the second mode of operation is an asynchronous mode. 4. The system of claim 1, wherein the storage array is one of a Static Random Access Memory (SRAM) array, an array of registers, and an array of latches. 5. The system of claim 1, wherein the memory controller is one of a microprocessor, a microcontroller, and an application specific integrated circuit (ASIC). | 2,100 |
4,494 | 13,284,901 | 2,173 | The present invention relates to systems and methods for anonymously personalizing web content to a particular user. The methods and systems may include listening for requests including code and tags that stand for personalized information. Once a request is identified, the personal information for the user corresponding to the tags of the request may be masked by generating anonymized personalization elements. These anonymized personalization elements are elements in a web browser which are enabled to display the personal information from a different domain without allowing front-end scripting on the containing document to get access to the personal information. The anonymized personalization elements may be an iframe, in some embodiments. Lastly, an output, including the anonymized personalization elements, is returned. | 1) A method for anonymously personalizing web content to a particular user, useful in association with a personalization system, the method comprising:
listening for requests including code and tags that stand for personalized information; masking personal information for a user corresponding to the tags of the request, wherein the masking generates anonymized personalization elements, wherein the anonymized personalization elements are at least one element in a web browser which is enabled to display the personal information from a different domain without allowing front-end scripting on the containing document to get access to the personal information; and returning an output, wherein the output includes the tags replaced by the anonymized personalization elements. 2) The method as recited in claim 1, further comprising:
caching the anonymized personalization elements; showing the anonymized personalization elements; and executing a client side script to populate the anonymized personalization elements with information appropriate to the anonymized personalization elements. 3) The method as recited in claim 1, further comprising obtaining an identity for the user. 4) The method as recited in claim 2, further comprising obtaining an identity for the user. 5) The method as recited in claim 3, wherein the user has unique identities for each publisher. 6) The method as recited in claim 4, wherein the user has unique identities for each publisher. 7) The method as recited in claim 1, wherein the anonymized personalization elements include at least one iframe. 8) The method as recited in claim 2, wherein the caching includes storing the anonymized personalization elements on client side local storage. 9) The method as recited in claim 1, further comprising embedding a widget into at least one of the anonymized personalization elements. 10) The method as recited in claim 1, further comprising receiving post back information from the publishing server, wherein the post back information is aggregated with other information, and the aggregated information is displayed to friends of the user based upon the user's privacy settings. 11) A method for personalizing web content while preserving a user's privacy, useful in association with a publishing server, the method comprising:
loading a static script from a constant URL, wherein the static script is configured to look for information on a local computer and discover compatible services that a user has authenticated with it; receiving a request for a webpage from a user agent; providing the static script to the user agent; receiving feedback from the static script; authenticating with the compatible service identified in the feedback; returning a document with personalization tags to the user agent; and receiving an output with anonymized personalization elements, wherein the anonymized personalization elements are at least one element in a web browser which is enabled to display information from a different domain without allowing front-end scripting on the containing document to get access to the information. 12) A method for logging a user into a system comprising:
displaying a login screen to a user from a centralized login server; receiving a username from the user; matching the username to a corresponding personal server different from the centralized login server; and redirecting the user to the personal server. 13) The method as recited in claim 12, wherein the personal server is an authentication system. 14) The method as recited in claim 12, wherein the personal server is a personalization system. 15) A personalization system configured to anonymously personalize web content to a particular user, the system comprising:
a monitor configured to listen for requests including code and tags that stand for personalized information; an anonymizer configured to mask personal information for a user corresponding to the tags of the request, wherein the masking generates anonymized personalization elements, wherein the anonymized personalization elements are at least one element in a web browser which is enabled to display the personal information from a different domain without allowing front-end scripting on the containing document to get access to the personal information; and a deliverer configured to return an output, wherein the output includes the tags replaced by the anonymized personalization elements. 16) The system as recited in claim 15, further comprising:
storage configured to cache the anonymized personalization elements; an examiner configured to show the anonymized personalization elements; and a processor configured to executing a client side script to populate the anonymized personalization elements with information appropriate to the anonymized personalization elements. 17) The system as recited in claim 15, further comprising an authentication system configured to obtain an identity for the user. 18) The system as recited in claim 16, further comprising an authentication system configured to obtain an identity for the user. 19) The system as recited in claim 17, wherein the user has unique identities for each publisher. 20) The system as recited in claim 18, wherein the user has unique identities for each publisher. 21) The system as recited in claim 15, wherein the anonymized personalization elements include at least one iframe. 22) The system as recited in claim 16, wherein the caching includes storing the anonymized personalization elements on client side local storage. 23) The system as recited in claim 15, further comprising a post back system configured to receive post back information from the publishing server, wherein the post back information is aggregated with other information, and the aggregated information is displayed to friends of the user based upon the user's privacy settings. | The present invention relates to systems and methods for anonymously personalizing web content to a particular user. The methods and systems may include listening for requests including code and tags that stand for personalized information. Once a request is identified, the personal information for the user corresponding to the tags of the request may be masked by generating anonymized personalization elements. These anonymized personalization elements are elements in a web browser which are enabled to display the personal information from a different domain without allowing front-end scripting on the containing document to get access to the personal information. The anonymized personalization elements may be an iframe, in some embodiments. Lastly, an output, including the anonymized personalization elements, is returned.1) A method for anonymously personalizing web content to a particular user, useful in association with a personalization system, the method comprising:
listening for requests including code and tags that stand for personalized information; masking personal information for a user corresponding to the tags of the request, wherein the masking generates anonymized personalization elements, wherein the anonymized personalization elements are at least one element in a web browser which is enabled to display the personal information from a different domain without allowing front-end scripting on the containing document to get access to the personal information; and returning an output, wherein the output includes the tags replaced by the anonymized personalization elements. 2) The method as recited in claim 1, further comprising:
caching the anonymized personalization elements; showing the anonymized personalization elements; and executing a client side script to populate the anonymized personalization elements with information appropriate to the anonymized personalization elements. 3) The method as recited in claim 1, further comprising obtaining an identity for the user. 4) The method as recited in claim 2, further comprising obtaining an identity for the user. 5) The method as recited in claim 3, wherein the user has unique identities for each publisher. 6) The method as recited in claim 4, wherein the user has unique identities for each publisher. 7) The method as recited in claim 1, wherein the anonymized personalization elements include at least one iframe. 8) The method as recited in claim 2, wherein the caching includes storing the anonymized personalization elements on client side local storage. 9) The method as recited in claim 1, further comprising embedding a widget into at least one of the anonymized personalization elements. 10) The method as recited in claim 1, further comprising receiving post back information from the publishing server, wherein the post back information is aggregated with other information, and the aggregated information is displayed to friends of the user based upon the user's privacy settings. 11) A method for personalizing web content while preserving a user's privacy, useful in association with a publishing server, the method comprising:
loading a static script from a constant URL, wherein the static script is configured to look for information on a local computer and discover compatible services that a user has authenticated with it; receiving a request for a webpage from a user agent; providing the static script to the user agent; receiving feedback from the static script; authenticating with the compatible service identified in the feedback; returning a document with personalization tags to the user agent; and receiving an output with anonymized personalization elements, wherein the anonymized personalization elements are at least one element in a web browser which is enabled to display information from a different domain without allowing front-end scripting on the containing document to get access to the information. 12) A method for logging a user into a system comprising:
displaying a login screen to a user from a centralized login server; receiving a username from the user; matching the username to a corresponding personal server different from the centralized login server; and redirecting the user to the personal server. 13) The method as recited in claim 12, wherein the personal server is an authentication system. 14) The method as recited in claim 12, wherein the personal server is a personalization system. 15) A personalization system configured to anonymously personalize web content to a particular user, the system comprising:
a monitor configured to listen for requests including code and tags that stand for personalized information; an anonymizer configured to mask personal information for a user corresponding to the tags of the request, wherein the masking generates anonymized personalization elements, wherein the anonymized personalization elements are at least one element in a web browser which is enabled to display the personal information from a different domain without allowing front-end scripting on the containing document to get access to the personal information; and a deliverer configured to return an output, wherein the output includes the tags replaced by the anonymized personalization elements. 16) The system as recited in claim 15, further comprising:
storage configured to cache the anonymized personalization elements; an examiner configured to show the anonymized personalization elements; and a processor configured to executing a client side script to populate the anonymized personalization elements with information appropriate to the anonymized personalization elements. 17) The system as recited in claim 15, further comprising an authentication system configured to obtain an identity for the user. 18) The system as recited in claim 16, further comprising an authentication system configured to obtain an identity for the user. 19) The system as recited in claim 17, wherein the user has unique identities for each publisher. 20) The system as recited in claim 18, wherein the user has unique identities for each publisher. 21) The system as recited in claim 15, wherein the anonymized personalization elements include at least one iframe. 22) The system as recited in claim 16, wherein the caching includes storing the anonymized personalization elements on client side local storage. 23) The system as recited in claim 15, further comprising a post back system configured to receive post back information from the publishing server, wherein the post back information is aggregated with other information, and the aggregated information is displayed to friends of the user based upon the user's privacy settings. | 2,100 |
4,495 | 13,340,605 | 2,173 | An electronic device with a display and a touch-sensitive surface displays a plurality of windows on the display. The plurality of windows includes a first window for a first application displayed in a frontmost position on the display and a second window displayed in a lower position than the frontmost position. The device detects a first gesture moving in a first direction on the touch sensitive surface, the first direction on the touch sensitive surface corresponding to a first direction on the display; and, in response to detecting the first gesture moving in the first direction on the touch sensitive surface: moves the first window across the display in the first direction on the display until the first window is moved partially or fully off the display; and displays the second window in the frontmost position on the display. | 1. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a plurality of windows on the display, the plurality of windows including a first window for a first application displayed in a frontmost position on the display and a second window displayed in a lower position than the frontmost position;
detecting a first gesture moving in a first direction on the touch sensitive surface, the first direction on the touch sensitive surface corresponding to a first direction on the display; and,
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the first window across the display in the first direction on the display until the first window is moved partially or fully off the display; and
displaying the second window in the frontmost position on the display. 2. The device of claim 1, wherein the first gesture is a multifinger swipe gesture. 3. The device of claim 1, wherein the first direction on the touch sensitive surface corresponds to a horizontal direction on the display. 4. The device of claim 1, wherein the first direction on the touch sensitive surface corresponds to a vertical direction on the display. 5. The device of claim 1, wherein the first direction on the touch sensitive surface corresponds to a diagonal direction on the display. 6. The device of claim 1, wherein the first window is moved partially off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface. 7. The device of claim 1, wherein the first window is moved fully off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface. 8. The device of claim 1, wherein the second window is for a second application, distinct from the first application. 9. The device of claim 1, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the first direction on the display until the multiple windows for the first application are moved partially or fully off the display. 10. The device of claim 1, wherein the plurality of windows has a layer order, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
maintaining the layer order of the plurality of windows. 11. The device of claim 1, including instructions for:
after responding to the first gesture, while displaying the second window in the frontmost position on the display, detecting a second gesture moving in a direction opposite the first direction on the touch sensitive surface; and, in response to detecting the second gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the first window across the display in a direction opposite the first direction on the display; and
redisplaying the first window in the frontmost position on the display. 12. The device of claim 11, including instructions for:
in response to detecting the second gesture moving in the direction opposite the first direction on the touch sensitive surface: maintaining a layer order of the plurality of windows. 13. The device of claim 11, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the second gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the direction opposite the first direction on the display. 14. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a plurality of windows on the display, the plurality of windows including:
a first window for a first application displayed in a frontmost position on the display;
a second window for a second application, distinct from the first application, displayed in a second position lower than the frontmost position; and
a third window for a third application, distinct from the first application and the second application, displayed in a third position lower than the second position;
detecting a first gesture moving in a first direction on the touch sensitive surface, the first direction on the touch sensitive surface corresponding to a first direction on the display;
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the first window across the display in the first direction on the display until the first window is moved partially or fully off the display; and
displaying the second window in the frontmost position on the display;
after responding to the first gesture, while displaying the second window in the frontmost position on the display, detecting a second gesture moving in the first direction on the touch sensitive surface;
in response to detecting the second gesture moving in the first direction on the touch sensitive surface:
moving the second window across the display in the first direction on the display until the second window is moved partially or fully off the display; and
displaying the third window in the frontmost position on the display;
after responding to the second gesture, while displaying the third window in the frontmost position on the display, detecting a third gesture moving in a direction opposite the first direction on the touch sensitive surface;
in response to detecting the third gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the second window across the display in a direction opposite the first direction on the display; and
redisplaying the second window in the frontmost position on the display;
after responding to the third gesture, while displaying the second window in the frontmost position on the display, detecting a fourth gesture moving in the direction opposite the first direction on the touch sensitive surface; and,
in response to detecting the fourth gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the first window across the display in a direction opposite the first direction on the display; and
redisplaying the first window in the frontmost position on the display. 15. The device of claim 14, wherein the first gesture, the second gesture, the third gesture, and the fourth gesture are multifinger swipe gestures. 16. The device of claim 14, wherein the first direction on the touch sensitive surface corresponds to a horizontal direction on the display. 17. The device of claim 14, wherein the first direction on the touch sensitive surface corresponds to a vertical direction on the display. 18. The device of claim 14, wherein the first direction on the touch sensitive surface corresponds to a diagonal direction on the display. 19. The device of claim 14, wherein the first window is moved partially off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface and the second window is moved partially off the display in response to detecting the second gesture moving in the first direction on the touch sensitive surface. 20. The device of claim 14, wherein the first window is moved fully off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface and the second window is moved fully off the display in response to detecting the second gesture moving in the first direction on the touch sensitive surface. 21. The device of claim 14, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the first direction on the display until the multiple windows for the first application are moved partially or fully off the display. 22. The device of claim 14, wherein the second window is one of multiple windows for the second application, the device including instructions for:
in response to detecting the second gesture moving in the first direction on the touch sensitive surface:
moving the multiple windows for the second application across the display in the first direction on the display until the multiple windows for the second application are moved partially or fully off the display. 23. The device of claim 14, wherein the plurality of windows has a layer order, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
maintaining the layer order of the plurality of windows. 24. The device of claim 14, wherein the second window is one of multiple windows for the second application, the device including instructions for:
in response to detecting the third gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the multiple windows for the second application across the display in the direction opposite the first direction on the display. 25. The device of claim 14, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the fourth gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the direction opposite the first direction on the display. | An electronic device with a display and a touch-sensitive surface displays a plurality of windows on the display. The plurality of windows includes a first window for a first application displayed in a frontmost position on the display and a second window displayed in a lower position than the frontmost position. The device detects a first gesture moving in a first direction on the touch sensitive surface, the first direction on the touch sensitive surface corresponding to a first direction on the display; and, in response to detecting the first gesture moving in the first direction on the touch sensitive surface: moves the first window across the display in the first direction on the display until the first window is moved partially or fully off the display; and displays the second window in the frontmost position on the display.1. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a plurality of windows on the display, the plurality of windows including a first window for a first application displayed in a frontmost position on the display and a second window displayed in a lower position than the frontmost position;
detecting a first gesture moving in a first direction on the touch sensitive surface, the first direction on the touch sensitive surface corresponding to a first direction on the display; and,
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the first window across the display in the first direction on the display until the first window is moved partially or fully off the display; and
displaying the second window in the frontmost position on the display. 2. The device of claim 1, wherein the first gesture is a multifinger swipe gesture. 3. The device of claim 1, wherein the first direction on the touch sensitive surface corresponds to a horizontal direction on the display. 4. The device of claim 1, wherein the first direction on the touch sensitive surface corresponds to a vertical direction on the display. 5. The device of claim 1, wherein the first direction on the touch sensitive surface corresponds to a diagonal direction on the display. 6. The device of claim 1, wherein the first window is moved partially off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface. 7. The device of claim 1, wherein the first window is moved fully off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface. 8. The device of claim 1, wherein the second window is for a second application, distinct from the first application. 9. The device of claim 1, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the first direction on the display until the multiple windows for the first application are moved partially or fully off the display. 10. The device of claim 1, wherein the plurality of windows has a layer order, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
maintaining the layer order of the plurality of windows. 11. The device of claim 1, including instructions for:
after responding to the first gesture, while displaying the second window in the frontmost position on the display, detecting a second gesture moving in a direction opposite the first direction on the touch sensitive surface; and, in response to detecting the second gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the first window across the display in a direction opposite the first direction on the display; and
redisplaying the first window in the frontmost position on the display. 12. The device of claim 11, including instructions for:
in response to detecting the second gesture moving in the direction opposite the first direction on the touch sensitive surface: maintaining a layer order of the plurality of windows. 13. The device of claim 11, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the second gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the direction opposite the first direction on the display. 14. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a plurality of windows on the display, the plurality of windows including:
a first window for a first application displayed in a frontmost position on the display;
a second window for a second application, distinct from the first application, displayed in a second position lower than the frontmost position; and
a third window for a third application, distinct from the first application and the second application, displayed in a third position lower than the second position;
detecting a first gesture moving in a first direction on the touch sensitive surface, the first direction on the touch sensitive surface corresponding to a first direction on the display;
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the first window across the display in the first direction on the display until the first window is moved partially or fully off the display; and
displaying the second window in the frontmost position on the display;
after responding to the first gesture, while displaying the second window in the frontmost position on the display, detecting a second gesture moving in the first direction on the touch sensitive surface;
in response to detecting the second gesture moving in the first direction on the touch sensitive surface:
moving the second window across the display in the first direction on the display until the second window is moved partially or fully off the display; and
displaying the third window in the frontmost position on the display;
after responding to the second gesture, while displaying the third window in the frontmost position on the display, detecting a third gesture moving in a direction opposite the first direction on the touch sensitive surface;
in response to detecting the third gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the second window across the display in a direction opposite the first direction on the display; and
redisplaying the second window in the frontmost position on the display;
after responding to the third gesture, while displaying the second window in the frontmost position on the display, detecting a fourth gesture moving in the direction opposite the first direction on the touch sensitive surface; and,
in response to detecting the fourth gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the first window across the display in a direction opposite the first direction on the display; and
redisplaying the first window in the frontmost position on the display. 15. The device of claim 14, wherein the first gesture, the second gesture, the third gesture, and the fourth gesture are multifinger swipe gestures. 16. The device of claim 14, wherein the first direction on the touch sensitive surface corresponds to a horizontal direction on the display. 17. The device of claim 14, wherein the first direction on the touch sensitive surface corresponds to a vertical direction on the display. 18. The device of claim 14, wherein the first direction on the touch sensitive surface corresponds to a diagonal direction on the display. 19. The device of claim 14, wherein the first window is moved partially off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface and the second window is moved partially off the display in response to detecting the second gesture moving in the first direction on the touch sensitive surface. 20. The device of claim 14, wherein the first window is moved fully off the display in response to detecting the first gesture moving in the first direction on the touch sensitive surface and the second window is moved fully off the display in response to detecting the second gesture moving in the first direction on the touch sensitive surface. 21. The device of claim 14, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the first direction on the display until the multiple windows for the first application are moved partially or fully off the display. 22. The device of claim 14, wherein the second window is one of multiple windows for the second application, the device including instructions for:
in response to detecting the second gesture moving in the first direction on the touch sensitive surface:
moving the multiple windows for the second application across the display in the first direction on the display until the multiple windows for the second application are moved partially or fully off the display. 23. The device of claim 14, wherein the plurality of windows has a layer order, the device including instructions for:
in response to detecting the first gesture moving in the first direction on the touch sensitive surface:
maintaining the layer order of the plurality of windows. 24. The device of claim 14, wherein the second window is one of multiple windows for the second application, the device including instructions for:
in response to detecting the third gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the multiple windows for the second application across the display in the direction opposite the first direction on the display. 25. The device of claim 14, wherein the first window is one of multiple windows for the first application, the device including instructions for:
in response to detecting the fourth gesture moving in the direction opposite the first direction on the touch sensitive surface:
moving the multiple windows for the first application across the display in the direction opposite the first direction on the display. | 2,100 |
4,496 | 14,081,952 | 2,165 | An exemplary information-processing device includes: a first accessing unit configured to access a first database storing data sets, each of the data sets relating to values of attribute items; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. | 1. An information-processing device comprising:
a first accessing unit configured to access a first database storing data sets, each of the data sets relating to values of attribute items; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 2. The information-processing device according to claim 1, wherein one or more of the values of the attribute items included in the data sets stored in the first database are selected from among predetermined options. 3. The information-processing device according to claim 1, wherein
at least one of the values of attribute items included in each data set stored in the first database includes text, and the extracting unit is further configured to extract from the first database data sets relating to the value indicated by text including the input keyword as a part of the result of the search. 4. The information-processing device according to claim 1, wherein one or more of the values of the attribute items included in the data sets stored in the first database are selected from among predetermined options by a user. 5. The information-processing device according to claim 1, wherein
the second database includes sub-databases corresponds to a plurality of language sets, the language of one of the sub-databases being different from the language of another of the sub-databases, and one sub-database selected from the sub-databases of a language used by a user is accessed by the second accessing unit. 6. The information-processing device according to claim 1, further comprising:
a third accessing unit configured to access a third database storing a keyword, a first attribute item corresponding to the keyword, a value of the first attribute item, a second attribute item corresponding to the keyword and a value of the second attribute item, wherein the extracting unit is further configured, when the keyword input for the search is included in the third database, to extract from the first database, as a part of the result of the search, at least one data set relating to the value of the first attribute item corresponding to the input keyword and the value of the second attribute item corresponding to the input keyword. 7. The information-processing device according to claim 1, further comprising:
a user interface providing unit configured to provide a user interface that allows a user to select one or more attribute items from among predetermined attribute items as a searched object, wherein the extracting unit is further configured to extract from the first database, as the result of the search, at least one data set relating to the value corresponding to the input keyword of any one of the one or more attribute items selected as the search object indicated by text including the input keyword. 8. A computer-readable non-transitory storage device storing a program causing a computer device to execute a process, the process comprising:
accessing a first database storing data sets, each of the data sets relating to values of attribute items; accessing a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and extracting, when a keyword input for a search is included in the second database, from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 9. An information-processing system comprising:
a first accessing unit configured to access a first database storing data sets, each of the data sets relating to values of attribute items; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 10. An information-processing method comprising:
accessing a first database storing data sets, each of the data sets relating to values of attribute items; accessing a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and extracting, when a keyword input for a search is included in the second database, from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 11. An information-processing device comprising:
a first accessing unit configured to access a first database storing data sets, each of the data sets including values of attribute items, each of the values being selected from predetermined options; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. | An exemplary information-processing device includes: a first accessing unit configured to access a first database storing data sets, each of the data sets relating to values of attribute items; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword.1. An information-processing device comprising:
a first accessing unit configured to access a first database storing data sets, each of the data sets relating to values of attribute items; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 2. The information-processing device according to claim 1, wherein one or more of the values of the attribute items included in the data sets stored in the first database are selected from among predetermined options. 3. The information-processing device according to claim 1, wherein
at least one of the values of attribute items included in each data set stored in the first database includes text, and the extracting unit is further configured to extract from the first database data sets relating to the value indicated by text including the input keyword as a part of the result of the search. 4. The information-processing device according to claim 1, wherein one or more of the values of the attribute items included in the data sets stored in the first database are selected from among predetermined options by a user. 5. The information-processing device according to claim 1, wherein
the second database includes sub-databases corresponds to a plurality of language sets, the language of one of the sub-databases being different from the language of another of the sub-databases, and one sub-database selected from the sub-databases of a language used by a user is accessed by the second accessing unit. 6. The information-processing device according to claim 1, further comprising:
a third accessing unit configured to access a third database storing a keyword, a first attribute item corresponding to the keyword, a value of the first attribute item, a second attribute item corresponding to the keyword and a value of the second attribute item, wherein the extracting unit is further configured, when the keyword input for the search is included in the third database, to extract from the first database, as a part of the result of the search, at least one data set relating to the value of the first attribute item corresponding to the input keyword and the value of the second attribute item corresponding to the input keyword. 7. The information-processing device according to claim 1, further comprising:
a user interface providing unit configured to provide a user interface that allows a user to select one or more attribute items from among predetermined attribute items as a searched object, wherein the extracting unit is further configured to extract from the first database, as the result of the search, at least one data set relating to the value corresponding to the input keyword of any one of the one or more attribute items selected as the search object indicated by text including the input keyword. 8. A computer-readable non-transitory storage device storing a program causing a computer device to execute a process, the process comprising:
accessing a first database storing data sets, each of the data sets relating to values of attribute items; accessing a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and extracting, when a keyword input for a search is included in the second database, from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 9. An information-processing system comprising:
a first accessing unit configured to access a first database storing data sets, each of the data sets relating to values of attribute items; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 10. An information-processing method comprising:
accessing a first database storing data sets, each of the data sets relating to values of attribute items; accessing a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and extracting, when a keyword input for a search is included in the second database, from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. 11. An information-processing device comprising:
a first accessing unit configured to access a first database storing data sets, each of the data sets including values of attribute items, each of the values being selected from predetermined options; a second accessing unit configured to access a second database storing a group of keywords including at least one keyword, an attribute item corresponding to the group of keywords, and a value of the attribute item corresponding to the group of keywords; and an extracting unit configured, when a keyword input for a search is included in the second database, to extract from the first database, as a result of the search, at least one data set relating to the value corresponding to the input keyword of the attribute item corresponding to the input keyword. | 2,100 |
4,497 | 14,074,584 | 2,169 | A write request that includes a data object is processed. A hash function is executed on the data object, thereby generating a hash value that includes a first portion and a second portion. A hypervisor table is queried with the first portion, thereby obtaining a master storage node identifier. The data object and the hash value are sent to a master storage node associated with the master storage node identifier. At the master storage node, a master table is queried with the second portion, thereby obtaining a storage node identifier. The data object and the hash value are sent from the master storage node to a storage node associated with the storage node identifier. | 1. A method for processing a write request that includes a data object, the method comprising:
executing a hash function on the data object, thereby generating a hash value that includes a first portion and a second portion; querying a hypervisor table with the first portion, thereby obtaining a master storage node identifier; sending the data object and the hash value to a master storage node associated with the master storage node identifier; at the master storage node, querying a master table with the second portion, thereby obtaining a storage node identifier; and sending the data object and the hash value from the master storage node to a storage node associated with the storage node identifier. 2. The method of claim 1, wherein querying the hypervisor table with the first portion results in obtaining both the master storage node identifier and a second master storage node identifier, the method further comprising:
sending the data object and the hash value to a master storage node associated with the second master storage node identifier. 3. The method of claim 1, wherein querying the master table with the second portion results in obtaining both the storage node identifier and a second storage node identifier, the method further comprising:
sending the data object and the hash value from the master storage node to a storage node associated with the second storage node identifier. 4. The method of claim 1, wherein the write request further includes an application data identifier, the method further comprising:
updating a virtual volume catalog by adding an entry mapping the application data identifier to the hash value. 5. The method of claim 4, wherein the application data identifier comprises a file name, an object name, or a range of blocks. 6. The method of claim 1, wherein a length of the hash value is sixteen bytes. 7. The method of claim 1, wherein a length of the first portion is four bytes. 8. The method of claim 1, wherein a length of the second portion is two bytes. 9. The method of claim 1, wherein the master storage node identifier comprises an Internet Protocol (IP) address. 10. The method of claim 1, wherein the storage node identifier comprises an Internet Protocol (IP) address. 11. A method for processing a write request that includes a data object and a hash value of the data object, the method comprising:
storing the data object at a storage location; updating a storage node table by adding an entry mapping the hash value to the storage location; and outputting a write acknowledgment that includes the hash value. 12. A non-transitory computer-readable storage medium storing computer program modules for processing a read request that includes an application data identifier, the computer program modules executable to perform steps comprising:
querying a virtual volume catalog with the application data identifier, thereby obtaining a hash value of a data object, wherein the hash value includes a first portion and a second portion; querying a hypervisor table with the first portion, thereby obtaining a master storage node identifier; sending the hash value to a master storage node associated with the master storage node identifier; at the master storage node, querying a master table with the second portion, thereby obtaining a storage node identifier; and sending the hash value from the master storage node to a storage node associated with the storage node identifier. 13. The computer-readable storage medium of claim 12, wherein the steps further comprise receiving the data object. 14. The computer-readable storage medium of claim 12, wherein querying the hypervisor table with the first portion results in obtaining both the master storage node identifier and a second master storage node identifier, and wherein the steps further comprise:
waiting for a response from the master storage node associated with the master storage node identifier; and responsive to no response being received within a specified time period, sending the hash value to a master storage node associated with the second master storage node identifier. 15. The computer-readable storage medium of claim 12, wherein querying the master table with the second portion results in obtaining both the storage node identifier and a second storage node identifier, and wherein the steps further comprise:
at the master storage node, waiting for a response from the storage node associated with the storage node identifier; and responsive to no response being received within a specified time period, sending the hash value from the master storage node to a storage node associated with the second storage node identifier. 16. A computer system for processing a read request that includes a hash value of a data object, the system comprising:
a non-transitory computer-readable storage medium storing computer program modules executable to perform steps comprising:
querying a storage node table with the hash value, thereby obtaining a storage location; and
retrieving the data object from the storage location; and
a computer processor for executing the computer program modules. 17. The system of claim 16, wherein the steps further comprise outputting the data object. | A write request that includes a data object is processed. A hash function is executed on the data object, thereby generating a hash value that includes a first portion and a second portion. A hypervisor table is queried with the first portion, thereby obtaining a master storage node identifier. The data object and the hash value are sent to a master storage node associated with the master storage node identifier. At the master storage node, a master table is queried with the second portion, thereby obtaining a storage node identifier. The data object and the hash value are sent from the master storage node to a storage node associated with the storage node identifier.1. A method for processing a write request that includes a data object, the method comprising:
executing a hash function on the data object, thereby generating a hash value that includes a first portion and a second portion; querying a hypervisor table with the first portion, thereby obtaining a master storage node identifier; sending the data object and the hash value to a master storage node associated with the master storage node identifier; at the master storage node, querying a master table with the second portion, thereby obtaining a storage node identifier; and sending the data object and the hash value from the master storage node to a storage node associated with the storage node identifier. 2. The method of claim 1, wherein querying the hypervisor table with the first portion results in obtaining both the master storage node identifier and a second master storage node identifier, the method further comprising:
sending the data object and the hash value to a master storage node associated with the second master storage node identifier. 3. The method of claim 1, wherein querying the master table with the second portion results in obtaining both the storage node identifier and a second storage node identifier, the method further comprising:
sending the data object and the hash value from the master storage node to a storage node associated with the second storage node identifier. 4. The method of claim 1, wherein the write request further includes an application data identifier, the method further comprising:
updating a virtual volume catalog by adding an entry mapping the application data identifier to the hash value. 5. The method of claim 4, wherein the application data identifier comprises a file name, an object name, or a range of blocks. 6. The method of claim 1, wherein a length of the hash value is sixteen bytes. 7. The method of claim 1, wherein a length of the first portion is four bytes. 8. The method of claim 1, wherein a length of the second portion is two bytes. 9. The method of claim 1, wherein the master storage node identifier comprises an Internet Protocol (IP) address. 10. The method of claim 1, wherein the storage node identifier comprises an Internet Protocol (IP) address. 11. A method for processing a write request that includes a data object and a hash value of the data object, the method comprising:
storing the data object at a storage location; updating a storage node table by adding an entry mapping the hash value to the storage location; and outputting a write acknowledgment that includes the hash value. 12. A non-transitory computer-readable storage medium storing computer program modules for processing a read request that includes an application data identifier, the computer program modules executable to perform steps comprising:
querying a virtual volume catalog with the application data identifier, thereby obtaining a hash value of a data object, wherein the hash value includes a first portion and a second portion; querying a hypervisor table with the first portion, thereby obtaining a master storage node identifier; sending the hash value to a master storage node associated with the master storage node identifier; at the master storage node, querying a master table with the second portion, thereby obtaining a storage node identifier; and sending the hash value from the master storage node to a storage node associated with the storage node identifier. 13. The computer-readable storage medium of claim 12, wherein the steps further comprise receiving the data object. 14. The computer-readable storage medium of claim 12, wherein querying the hypervisor table with the first portion results in obtaining both the master storage node identifier and a second master storage node identifier, and wherein the steps further comprise:
waiting for a response from the master storage node associated with the master storage node identifier; and responsive to no response being received within a specified time period, sending the hash value to a master storage node associated with the second master storage node identifier. 15. The computer-readable storage medium of claim 12, wherein querying the master table with the second portion results in obtaining both the storage node identifier and a second storage node identifier, and wherein the steps further comprise:
at the master storage node, waiting for a response from the storage node associated with the storage node identifier; and responsive to no response being received within a specified time period, sending the hash value from the master storage node to a storage node associated with the second storage node identifier. 16. A computer system for processing a read request that includes a hash value of a data object, the system comprising:
a non-transitory computer-readable storage medium storing computer program modules executable to perform steps comprising:
querying a storage node table with the hash value, thereby obtaining a storage location; and
retrieving the data object from the storage location; and
a computer processor for executing the computer program modules. 17. The system of claim 16, wherein the steps further comprise outputting the data object. | 2,100 |
4,498 | 13,773,499 | 2,165 | In general, the subject matter described in this specification can be embodied in methods, systems, and programs for providing location-based information. A geographical location of a mobile computing device is received at a server system. A request for content is received at the server system and from the mobile computing device. A search area that corresponds to the geographical location is selected by the sever system. The search area is selected from among a collection of search areas that correspond to the geographical location. At least one of the search areas in the collection is geographically nested within at least one other of the search areas. A search result that is most-relevantly ranked for the selected search area is determined by the server system. Content that represents the determined search result is provided by the server system and for receipt by the mobile computing device. | 1. A computer-implemented method, comprising:
receiving, by a computing system, an indication of a geographical location of a computing device; selecting, by the computing system, a search area that corresponds to the geographical location, from among a collection of search areas that correspond to the geographical location, based on a score that is assigned to each of the search areas in the collection of search areas; determining, by the computing system, a search result that is most-highly ranked for the selected search area; causing, by the computing system, content that represents the determined search result to be provided for receipt by the computing device; and modifying, by the computing system, the score that is assigned to the selected search area as a result of receiving an indication that a user of the computing device provided input to select a representation of the content that represents the determined search result. 2. The computer-implemented method of claim 1, further comprising:
receiving, by the computing system and as having been initiated by the computing device, a request for a web page; and providing, by the computing system and in response to receiving the request for the web page, the web page for receipt by the computing device, wherein the web page is configured to present the representation of the content that represents the determined search result. 3. The computer-implemented method of claim 1, wherein the computing system selects the search area and determines the search result without using a query that was authored by a user of the computing device. 4. The computer-implemented method of claim 1, wherein:
each of the search areas in the collection of search areas is assigned a different descriptive phrase of one or more human-understandable words; and determining the search result that is most-highly ranked for the selected search area includes providing, to a search engine system, the descriptive phrase of one or more human-understandable words that is assigned to the selected search area, and receiving, in response from the search engine system, the determined search result. 5. The computer-implemented method of claim 4, wherein at least two of the search areas in the collection of search areas are assigned a descriptive phrase of two or more human-understandable words. 6. The computer-implemented method of claim 1, wherein at least one of the search areas in the collection of search areas is completely geographically nested within at least one other of the search areas within the collection of search areas. 7. The computer-implemented method of claim 1, wherein determining the search result includes submitting a query to a search engine system and receiving the determined search result from the search engine system. 8. The computer-implemented method of claim 1, wherein:
the indication of the geographical location includes geographical coordinates; determining the search result includes providing a query to a search engine system; and the query does not include the geographical coordinates. 9. The computer-implemented method of claim 1, wherein:
the representation of the content that represents the determined search result is displayed by the computing device as part of a first web page; and as a result of the user of the computing device providing the input to select the representation of the content that represents the determined search result, the computing device navigates to a display of a second web page that is identified by the determined search result. 10. The computer-implemented method of claim 1, wherein modifying the score that is assigned to the selected search area includes increasing a relevance of the score that is assigned to the selected search area with respect to scores that are assigned to other of the search areas in the collection of search areas. 11. One or more computer-readable devices including instructions that, when executed by one or more programmable processors, cause the performance of actions that include:
receiving, by a computing system, an indication of a geographical location of a computing device; selecting, by the computing system, a search area that corresponds to the geographical location, from among a collection of search areas that correspond to the geographical location, based on a score that is assigned to each of the search areas in the collection of search areas; determining, by the computing system, a search result that is most-highly ranked for the selected search area; causing, by the computing system, content that represents the determined search result to be provided for receipt by the computing device; and modifying, by the computing system, the score that is assigned to the selected search area as a result of receiving an indication that a user of the computing device provided input to select a representation of the content that represents the determined search result. 12. The one or more computer-readable devices of claim 11, wherein the operations further comprise:
receiving, by the computing system and as having been initiated by the computing device, a request for a web page; and providing, by the computing system and in response to receiving the request for the web page, the web page for receipt by the computing device, wherein the web page is configured to present the representation of the content that represents the determined search result. 13. The one or more computer-readable devices of claim 11, wherein the computing system selects the search area and determines the search result without using a query that was authored by a user of the computing device. 14. The one or more computer-readable devices of claim 11, wherein:
each of the search areas in the collection of search areas is assigned a different descriptive phrase of one or more human-understandable words; and determining the search result that is most-highly ranked for the selected search area includes providing, to a search engine system, the descriptive phrase of one or more human-understandable words that is assigned to the selected search area, and receiving, in response from the search engine system, the determined search result. 15. The one or more computer-readable devices of claim 14, wherein at least two of the search areas in the collection of search areas are assigned a descriptive phrase of two or more human-understandable words. 16. The one or more computer-readable devices of claim 11, wherein at least one of the search areas in the collection of search areas is completely geographically nested within at least one other of the search areas within the collection of search areas. 17. The one or more computer-readable devices of claim 11, wherein determining the search result includes submitting a query to a search engine system and receiving the determined search result from the search engine system. 18. The one or more computer-readable devices of claim 11, wherein:
the indication of the geographical location includes geographical coordinates; determining the search result includes providing a query to a search engine system; and the query does not include the geographical coordinates. 19. The one or more computer-readable devices of claim 11, wherein:
the representation of the content that represents the determined search result is displayed by the computing device as part of a first web page; and as a result of the user of the computing device providing the input to select the representation of the content that represents the determined search result, the computing device navigates to a display of a second web page that is identified by the determined search result. 20. The one or more computer-readable devices of claim 11, wherein modifying the score that is assigned to the selected search area includes increasing a relevance of the score that is assigned to the selected search area with respect to scores that are assigned to other of the search areas in the collection of search areas. | In general, the subject matter described in this specification can be embodied in methods, systems, and programs for providing location-based information. A geographical location of a mobile computing device is received at a server system. A request for content is received at the server system and from the mobile computing device. A search area that corresponds to the geographical location is selected by the sever system. The search area is selected from among a collection of search areas that correspond to the geographical location. At least one of the search areas in the collection is geographically nested within at least one other of the search areas. A search result that is most-relevantly ranked for the selected search area is determined by the server system. Content that represents the determined search result is provided by the server system and for receipt by the mobile computing device.1. A computer-implemented method, comprising:
receiving, by a computing system, an indication of a geographical location of a computing device; selecting, by the computing system, a search area that corresponds to the geographical location, from among a collection of search areas that correspond to the geographical location, based on a score that is assigned to each of the search areas in the collection of search areas; determining, by the computing system, a search result that is most-highly ranked for the selected search area; causing, by the computing system, content that represents the determined search result to be provided for receipt by the computing device; and modifying, by the computing system, the score that is assigned to the selected search area as a result of receiving an indication that a user of the computing device provided input to select a representation of the content that represents the determined search result. 2. The computer-implemented method of claim 1, further comprising:
receiving, by the computing system and as having been initiated by the computing device, a request for a web page; and providing, by the computing system and in response to receiving the request for the web page, the web page for receipt by the computing device, wherein the web page is configured to present the representation of the content that represents the determined search result. 3. The computer-implemented method of claim 1, wherein the computing system selects the search area and determines the search result without using a query that was authored by a user of the computing device. 4. The computer-implemented method of claim 1, wherein:
each of the search areas in the collection of search areas is assigned a different descriptive phrase of one or more human-understandable words; and determining the search result that is most-highly ranked for the selected search area includes providing, to a search engine system, the descriptive phrase of one or more human-understandable words that is assigned to the selected search area, and receiving, in response from the search engine system, the determined search result. 5. The computer-implemented method of claim 4, wherein at least two of the search areas in the collection of search areas are assigned a descriptive phrase of two or more human-understandable words. 6. The computer-implemented method of claim 1, wherein at least one of the search areas in the collection of search areas is completely geographically nested within at least one other of the search areas within the collection of search areas. 7. The computer-implemented method of claim 1, wherein determining the search result includes submitting a query to a search engine system and receiving the determined search result from the search engine system. 8. The computer-implemented method of claim 1, wherein:
the indication of the geographical location includes geographical coordinates; determining the search result includes providing a query to a search engine system; and the query does not include the geographical coordinates. 9. The computer-implemented method of claim 1, wherein:
the representation of the content that represents the determined search result is displayed by the computing device as part of a first web page; and as a result of the user of the computing device providing the input to select the representation of the content that represents the determined search result, the computing device navigates to a display of a second web page that is identified by the determined search result. 10. The computer-implemented method of claim 1, wherein modifying the score that is assigned to the selected search area includes increasing a relevance of the score that is assigned to the selected search area with respect to scores that are assigned to other of the search areas in the collection of search areas. 11. One or more computer-readable devices including instructions that, when executed by one or more programmable processors, cause the performance of actions that include:
receiving, by a computing system, an indication of a geographical location of a computing device; selecting, by the computing system, a search area that corresponds to the geographical location, from among a collection of search areas that correspond to the geographical location, based on a score that is assigned to each of the search areas in the collection of search areas; determining, by the computing system, a search result that is most-highly ranked for the selected search area; causing, by the computing system, content that represents the determined search result to be provided for receipt by the computing device; and modifying, by the computing system, the score that is assigned to the selected search area as a result of receiving an indication that a user of the computing device provided input to select a representation of the content that represents the determined search result. 12. The one or more computer-readable devices of claim 11, wherein the operations further comprise:
receiving, by the computing system and as having been initiated by the computing device, a request for a web page; and providing, by the computing system and in response to receiving the request for the web page, the web page for receipt by the computing device, wherein the web page is configured to present the representation of the content that represents the determined search result. 13. The one or more computer-readable devices of claim 11, wherein the computing system selects the search area and determines the search result without using a query that was authored by a user of the computing device. 14. The one or more computer-readable devices of claim 11, wherein:
each of the search areas in the collection of search areas is assigned a different descriptive phrase of one or more human-understandable words; and determining the search result that is most-highly ranked for the selected search area includes providing, to a search engine system, the descriptive phrase of one or more human-understandable words that is assigned to the selected search area, and receiving, in response from the search engine system, the determined search result. 15. The one or more computer-readable devices of claim 14, wherein at least two of the search areas in the collection of search areas are assigned a descriptive phrase of two or more human-understandable words. 16. The one or more computer-readable devices of claim 11, wherein at least one of the search areas in the collection of search areas is completely geographically nested within at least one other of the search areas within the collection of search areas. 17. The one or more computer-readable devices of claim 11, wherein determining the search result includes submitting a query to a search engine system and receiving the determined search result from the search engine system. 18. The one or more computer-readable devices of claim 11, wherein:
the indication of the geographical location includes geographical coordinates; determining the search result includes providing a query to a search engine system; and the query does not include the geographical coordinates. 19. The one or more computer-readable devices of claim 11, wherein:
the representation of the content that represents the determined search result is displayed by the computing device as part of a first web page; and as a result of the user of the computing device providing the input to select the representation of the content that represents the determined search result, the computing device navigates to a display of a second web page that is identified by the determined search result. 20. The one or more computer-readable devices of claim 11, wherein modifying the score that is assigned to the selected search area includes increasing a relevance of the score that is assigned to the selected search area with respect to scores that are assigned to other of the search areas in the collection of search areas. | 2,100 |
4,499 | 12,607,551 | 2,164 | When a storage device initiates a change in its file system, it locally stores it for future update of the file system. When the host device sends a command to the storage device, the storage device responds to it by commencing a synchronization process during which the two parties coordinate the update of the file system with the stored change. If there are no file system changes pending in the host device, the storage device gets permission from the host device to update the file system with the change and, then, the host device reads the updated file system from the storage device. If there are file system changes pending in the host device, the host device updates a representation of the file system residing in the host device, causes the storage device to make the same changes, and then the storage device initiated change, in the file system. Lastly, the host device receives information from the storage device regarding the changes initiated by the storage device. | 1. A method for updating a file system of a storage device, the method comprising:
in a host device having a host driver for managing connection between the host device and a storage device and for managing a storage device file system of the storage device, performing by the host driver,
receiving a notification from a storage device regarding a change in the storage device file system that the storage device initiates; and
sending a command to the storage device to make the change in the storage device file system in response to receiving the notification. 2. The method as in claim 1, wherein, consequent to receiving a notification from the storage device that the storage device file system has changed in the storage device,
updating a representation of the storage device file system in the host device with the change. 3. The method as in claim 2, wherein updating the representation of the storage device file system with the change is facilitated by requesting, and consequently receiving, information from the storage device, which pertains to the change made by the storage device in the storage device file system. 4. The method as in claim 1, wherein, if the host driver initiates a change in the storage device file system, sending the command to the storage device is performed after updating a representation of the storage device file system in the host device with the change initiated by the host driver. 5. A host device connectable to a storage device, comprising:
a host driver for managing connection with a storage device and changes in a storage device file system of the storage device and in a representation of the storage device file system in the host device, wherein the host driver is configured,
to receive a notification from the storage device regarding a change in the storage device file system that the storage device initiates; and
to send a command to the storage device to make the change in the storage device file system in response to receiving the notification. 6. The host device as in claim 5, wherein the host driver is configured to update the representation of the storage device file system with the change consequent to receiving a notification from the storage device that the storage device file system has changed in the storage device. 7. The host device as in claim 6, wherein the host driver is configured to request, and consequently to receive, information from the storage device, which pertains to the change made by the storage device in the storage device file system. 8. The host device as in claim 5, wherein, if the host driver initiates a change in the storage device file system, the host driver is configured to make the change in the storage device file system before the host driver sends the command to the storage device. | When a storage device initiates a change in its file system, it locally stores it for future update of the file system. When the host device sends a command to the storage device, the storage device responds to it by commencing a synchronization process during which the two parties coordinate the update of the file system with the stored change. If there are no file system changes pending in the host device, the storage device gets permission from the host device to update the file system with the change and, then, the host device reads the updated file system from the storage device. If there are file system changes pending in the host device, the host device updates a representation of the file system residing in the host device, causes the storage device to make the same changes, and then the storage device initiated change, in the file system. Lastly, the host device receives information from the storage device regarding the changes initiated by the storage device.1. A method for updating a file system of a storage device, the method comprising:
in a host device having a host driver for managing connection between the host device and a storage device and for managing a storage device file system of the storage device, performing by the host driver,
receiving a notification from a storage device regarding a change in the storage device file system that the storage device initiates; and
sending a command to the storage device to make the change in the storage device file system in response to receiving the notification. 2. The method as in claim 1, wherein, consequent to receiving a notification from the storage device that the storage device file system has changed in the storage device,
updating a representation of the storage device file system in the host device with the change. 3. The method as in claim 2, wherein updating the representation of the storage device file system with the change is facilitated by requesting, and consequently receiving, information from the storage device, which pertains to the change made by the storage device in the storage device file system. 4. The method as in claim 1, wherein, if the host driver initiates a change in the storage device file system, sending the command to the storage device is performed after updating a representation of the storage device file system in the host device with the change initiated by the host driver. 5. A host device connectable to a storage device, comprising:
a host driver for managing connection with a storage device and changes in a storage device file system of the storage device and in a representation of the storage device file system in the host device, wherein the host driver is configured,
to receive a notification from the storage device regarding a change in the storage device file system that the storage device initiates; and
to send a command to the storage device to make the change in the storage device file system in response to receiving the notification. 6. The host device as in claim 5, wherein the host driver is configured to update the representation of the storage device file system with the change consequent to receiving a notification from the storage device that the storage device file system has changed in the storage device. 7. The host device as in claim 6, wherein the host driver is configured to request, and consequently to receive, information from the storage device, which pertains to the change made by the storage device in the storage device file system. 8. The host device as in claim 5, wherein, if the host driver initiates a change in the storage device file system, the host driver is configured to make the change in the storage device file system before the host driver sends the command to the storage device. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.