Abstract: The present invention relates to a method for classifying food items. The method includes the steps of: capturing one or more sensor data relating to a food item event; and classifying the food item, at least in part, automatically using a model trained on sensor data. A system and software are also disclosed.

Abstract: A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform.

Abstract: Compression of relational table data is enhanced with a pre-compression step of mapping the values of each field. Illustratively, the data in each cell of the relational table is replaced with a number a smaller number of characters. Additionally side information that is necessary for reversing the mapping is also compressed.

Abstract: A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform.

Abstract: The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.

Abstract: A preload library partitions certain files into segments and transforms the data of the files on a segment by segment basis, each independently of the other. The transformed segments are then stored as part of a transformed file, with each segment corresponding to a bag containing a chunk (of transformed data) and a gap which permits the chunks to grow when data of the segment is modified during a write operation. The bags are followed by a chunk map which contains metadata defining the compressed version of each segment. The preload library intercepts system calls from applications to the OC specifying access to specific segments of a transformed file. The preload library identifies the chunks corresponding to the specified segments, retrieves and reverses the transform on those chunks and passes the data to the application requesting it. For a system call to write data to certain segments, the data is modified and re-transformed by the library before being written back to disk.

Abstract: A method that accepts a data file, iteratively tests different information units as record delimiters and field delimiters, and chooses as the data files record delimiter, R, and field delimiter, F, the information units that result in the lowest generalized entropy that is computed on fields created by use of the chosen delimiter pair R,F.

Abstract: The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.

Abstract: A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform.

Abstract: The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.

Abstract: A method for computing matching windows for delta compression. The method computes pairs of matching source and target data segments irrespective of target data segment size or file offset. The method includes (1) representing a large source data file by a sequence of fixed-size segments; (2) computing a signature for each data segment using its contents such that, with a strong likelihood, two segments are the same if their signatures match; (3) parsing target data using a prefix matching method on such a sequence of signatures of source data to compute matching sequences of segments; and (4) merging closely matched segments as necessary to form matching windows.

Abstract: A preload library partitions certain files into segments and transforms the data of the files on a segment by segment basis, each independently of the other. The transformed segments are then stored as part of a transformed file, with each segment corresponding to a bag containing a chunk (of transformed data) and a gap which permits the chunks to grow when data of the segment is modified during a write operation. The bags are followed by a chunk map which contains metadata defining the compressed version of each segment. The preload library intercepts system calls from applications to the OC specifying access to specific segments of a transformed file. The preload library identifies the chunks corresponding to the specified segments, retrieves and reverses the transform on those chunks and passes the data to the application requesting it. For a system call to write data to certain segments, the data is modified and re-transformed by the library before being written back to disk.

Abstract: The present invention significantly improves the performance of matching target file window partitions to source file window partitions in delta compression. In particular, the present invention enhances delta compression performance of delta compressors based on the idea of modeling a dataset with the frequencies of its n-grams and employs a method to compute good source and target window matching in linear time.

Abstract: The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.

Abstract: The present invention provides efficient window partitioning algorithms for entropy-encoding. The present invention enhances compression performance of entropy encoding based on the approach of modeling a dataset with the frequencies of its n-grams. The present invention may then employ approximation algorithms to compute good partitions in time O(s*log s) and O(s) respectively, for any data segment S with length s.

Abstract: The present invention increases the efficiency of performing longest prefix matching operations by selecting a radix-encoded trie structure optimized with respect to memory cost. The structure is optimized by determining memory costs for retrie structures indexed on different numbers of high-order characters, and then selecting the structure corresponding to the lowest memory cost. The optimization improves performance in IP look-up operations as well as longest-prefix matching operations performed on general alphabets.

Abstract: A method and system for transferring licenses between electronic devices supporting licensable features. Specifically, in a method a request is generated for transferring a license between first and second electronic devices. The request includes first information unique to the first electronic device, second information unique to the second electronic device. The request is sent to a license distributor to generates a master key. The master key includes a removal key including the first information and an add key including the second information. The removal key is used to remove the license from the first electronic device when the first information matches official versions of the first information. The add key is revealed from the master key when the license is successfully removed. The add key is used to add the license to the second electronic device when the second information matches official versions of the second information.

Abstract: A preload library partitions certain files into segments and transforms the data of the files on a segment by segment basis, each independently of the other. The transformed segments are then stored as part of a transformed file, with each segment corresponding to a bag containing a chunk (of transformed data) and a gap which permits the chunks to grow when data of the segment is modified during a write operation. The bags are followed by a chunk map which contains metadata defining the compressed version of each segment. The preload library intercepts system calls from applications to the OC specifying access to specific segments of a transformed file. The preload library identifies the chunks corresponding to the specified segments, retrieves and reverses the transform on those chunks and passes the data to the application requesting it. For a system call to write data to certain segments, the data is modified and re-transformed by the library before being written back to disk.

Abstract: The present invention is a method and system for buffering and replaying a segment of a voice or data transmission. A connection is established between two end nodes in the network. At an intermediate node in the network between the end nodes, a predetermined segment of the data is maintained in a memory as a buffer. Upon receiving a request from one of the end nodes to replay the segment, that segment is replayed and transmitted to the requesting node. The request may be made by a user at one of the end nodes, or may be made automatically after detecting corrupt data. Because the buffering module is in the network, it need not be incorporated in premises or mobile equipment. Because the buffering module is remote from the requesting end node, the replayed data does not contain errors introduced in the original data between the buffering module and the requesting end node.

Abstract: The present invention is a method and system for buffering and replaying a segment of a voice or data transmission. A connection is established between two end nodes in the network. At an intermediate node in the network between the end nodes, a predetermined segment of the data is maintained in a memory as a buffer. Upon receiving a request from one of the end nodes to replay the segment, that segment is replayed and transmitted to the requesting node. The request may be made by a user at one of the end nodes, or may be made automatically after detecting corrupt data. Because the buffering module is in the network, it need not be incorporated in premises or mobile equipment. Because the buffering module is remote from the requesting end node, the replayed data does not contain errors introduced in the original data between the buffering module and the requesting end node.