Abstract: Managing a string translation table, where a compressor includes information in the table entries to distinguish strings as more or less important. More particularly, the compressor can identify a string in an input stream, determine an age indicator for the string, and record the age indicator in the table. When the string is encountered or identified, a use indicator or counter may be adjusted to indicate use of the entry and timing information related to encountering the entry. Instead of discarding all entries in the string translation table, a portion of the table can be discarded that has less important entries. The determination of whether to discard an entry as being less important can be based on the age indicator and the use indicator.

Abstract: An input stream of characters is received. A new string entry is added to a data structure based on a current portion of the input stream if the current portion fails to match any of a plurality of existing string entries in the data structure. An additional string entry is added to the data structure based on a combination of the current portion and a previous portion of the input stream, wherein the additional string entry corresponds to a subset of the combination that fails to match any of the plurality of existing string entries in the data structure. An output stream is generated that includes literal values of the characters and index values corresponding to string entries in the data structure that match portions of the input stream.

Abstract: Plain text, a secret key and a primitive polynomial that defines a finite field of even characteristic are received. The plain text is divided into a plurality of plain text blocks. For each plain text block of the plurality of plain text blocks other than a first plain text block, the plain text block is multiplied by a preceding cipher text block over the finite field of even characteristic, modulo the primitive polynomial, to generate an intermediate block, wherein the preceding cipher text block was generated from a preceding plain text block. Each intermediate block is processed by a block cipher using the secret key to generate a subsequent cipher text block. The block cipher operates in a nonlinear feedback mode of operation.

Abstract: Implementing aspects via callback in a virtual machine, where an aspect weaver weaves the aspect with a module to provide primary and crosscutting functionality in the runtime execution of the module. The virtual machine has multiple modules that are part of an application implementing separation of concerns. Each of the multiple modules has a distinct functionality portion and a common functionality portion, common to all modules. The common functionality is referenced by the virtual machine via callback for the multiple modules. Aspect code is loaded as a callback that is applied to the multiple modules by the virtual machine. Loading the aspect code as a callback can implement the aspect at any point in the modules, including conditional statements, calls to methods of objects or classes, loops, any point in an exception handler, or to monitor changes in variables.

Abstract: An input stream of characters is received. A new string entry is added to a data structure based on a current portion of the input stream if the current portion fails to match any of a plurality of existing string entries in the data structure. An additional string entry is added to the data structure based on a combination of the current portion and a previous portion of the input stream, wherein the additional string entry corresponds to a subset of the combination that fails to match any of the plurality of existing string entries in the data structure. An output stream is generated that includes literal values of the characters and index values corresponding to string entries in the data structure that match portions of the input stream.

Abstract: Managing a string translation table, where a compressor includes information in the table entries to distinguish strings as more or less important. More particularly, the compressor can identify a string in an input stream, determine an age indicator for the string, and record the age indicator in the table. When the string is encountered or identified, a use indicator or counter may be adjusted to indicate use of the entry and timing information related to encountering the entry. Instead of discarding all entries in the string translation table, a portion of the table can be discarded that has less important entries. The determination of whether to discard an entry as being less important can be based on the age indicator and the use indicator.

Abstract: An input stream of characters is received. The input stream is parsed into a plurality of strings each of which include one or more of the characters, wherein each parsed string is a longest match to a string entry in a data structure. An output stream is generated that includes a first portion having literal values of the characters and a separate and distinct second portion having index values corresponding to string entries in the data structure that match parsed strings from the input stream.

Abstract: Some embodiments of automating application deployment have been presented. In one embodiment, a production repository is created in a federated source code management system to accept software from only a single committer. The production repository is coupled to a set of repositories. Platform management infrastructure monitors the production repository for changes to the software. Further, the platform management infrastructure may automatically push the changes to one or more repositories affected.

Abstract: Some embodiments of a method and apparatus for encrypting and decrypting data have been presented. In one embodiment, a stream cipher is run in parallel with a block cipher to output a stream of bits with a length equal to a number of ciphertext blocks in an output stream of the block cipher. The method may further include pre-processing a current plaintext block based on the stream of bits and the number of ciphertext blocks in the output stream of the block cipher. Then the block cipher may encipher the pre-processed block to generate a current ciphertext block.

Abstract: In one embodiment, a mechanism for coding a non-increasing sequence of values is disclosed. In one embodiment, a method includes receiving a sequence of values to encode, the sequence of values being non-increasing, encoding a first value of the sequence using a number of bits that are required for fully representing the first value in an encoded format, and for each subsequent value in the sequence, encoding the subsequent value using a number of bits required for a minimal bit encoding of a previous value in the sequence.

Abstract: A method and apparatus for managing memory allocation using memory pages. An arena is designated within one or more memory pages. The arena is divided into one or more memory blocks of the same size. Metadata is generated for the memory blocks at a location other than between the memory blocks, which is used when allocating memory to satisfy an allocation request of approximately the size of the memory blocks.

Abstract: A method and apparatus for managing data. A request to perform a data operation is received from an application, the request identifying data on which to perform the data operation. The request is delegated to one or more of a plurality of plugins based on the requested data operation, each of the plurality of plugins being associated with at least one distinct data operation. The one or more plugins perform the requested data operation.

Abstract: A method and apparatus for managing memory allocation using memory pages. One or more arenas are designated within a memory page. Each of the arenas are divided into one or more memory blocks of the same size. Metadata is generated for the memory blocks at a location other than between the memory blocks, which is used when allocating memory to satisfy an allocation request of the size of the memory blocks.

Abstract: A method and system distributes N shares of a secret among cooperating entities using hyperplanes over GF(q), such that the secret can be reconstructed from K of the N shares (where K?N). In one embodiment, the method constructs a K-tuple that contains the secret and elements of GF(q), where q is a power m of an odd prime p. The method further multiplies the K-tuple by a matrix of size (N×K) to produce an N-tuple using arithmetic defined on GF(q). Thus, N shares of the secret are generated, with each of the N shares including a component of the N-tuple.

Abstract: Techniques for managing inodes of a file system are described herein. According to one embodiment, in response to a request received at the file system for committing a file to a storage, an inode data structure from a first inode pool of the file system is assigned to be associated with the file, where the first inode pool includes multiple inode data structures. A block pointer as a data member of the inode data structure is configured to link with a first block map, where the first block map includes multiple entries having one or more pointers linked with one or more data blocks for storing content of the file.

Abstract: A method and system distributes shares of a secret among cooperating entities using linear interpolation. In one embodiment, a linear equation is formed using the secret and random elements. The linear equation represents a K-dimensional secret hyperplane, where K is the number of shares to reconstruct the secret. Shares of the secrets are created, with each share containing a point on the secret hyperplane. The shares are then distributed to cooperating entities for secret sharing.

Abstract: Techniques for resource management of a PPM context model are described herein. According to one embodiment, in response to a sequence of symbols to be coded, contexts are allocated, each having multiple entries and each entry representing a symbol that the current context is able to encode, including a counter value representing a frequency of each entry being used. For each symbol coded by a context, a local counter value and a global counter value are maintained. The global counter value represents a total number of symbols that have been coded by the context model and the local counter value represents a number symbols that have been coded by the respective context. Thereafter, a resource management operation is performed for system resources associated with the plurality of contexts based on a global counter value and a local counter value associated with each of the plurality of contexts.

Abstract: A method and system calculates shares and sub-shares of a secret for distribution among cooperating entities. In one embodiment, the method creates shares of the secret, with each share containing a point on a K-dimensional secret hyperplane that embeds the secret, where K is the number of shares to reconstruct the secret. The method further constructs sub-shares for the shares. The sub-shares of a share define a set of secondary K-dimensional hyperplanes that intersect at the point contained in the share. The sub-shares are distributed to a plurality of cooperating entities for secret sharing.

Abstract: A method and system distributes N shares of a secret among cooperating entities by representing the secret as a secret polynomial, and forming a splitting polynomial with the secret polynomial as one or more of the coefficients. In one embodiment, the method represents the secret as a secret polynomial over GF(q), where q is a prime number or a power of a prime number. A splitting polynomial of degree (K?1) over GF(qm) is constructed, where K is the number of shares to reconstruct the secret and m is a positive integer. The coefficients of the splitting polynomial are formed with the secret polynomial and random information. The method further evaluates the splitting polynomial at N points with arithmetic defined on GF(qm) to generate the N shares of the secret.

Abstract: The use of callback functions when executing intermediate instructions in a virtual machine is described. The virtual machine receives and evaluates intermediate instructions. The virtual machine evaluates the instructions based a function table referencing definitions of the functions. A callback is loaded into the virtual machine platform, and a callback loader modifies the function table to cause a function in the table to point to the callback instead of the standard definition. Thus, when the intermediate code is evaluated, it is evaluated based on the modified functionality of the callback rather than the standard definition.