Abstract: This invention pertains generally to a method for resolving and managing eventual consistency conflicts when using a Prefix Hash Tree (“PHT”) in which the underlying storage system is a Distributed Hash Table (“DHT”). An embodiment according to the within invention comprises a computer implemented method for resolving eventual consistency conflicts when using a PHT and DHT.

Abstract: A method for managing third party application program access to user information via a particular native application program interface (API) is provided. The method includes providing a wrapped native API including a wrapper library and inspecting a third party application program for the presence of the wrapper library in an unmodified form. The application program is inspected to identify API calls. An identified API call to a circumventing API is instrumented by wrapping the circumventing API to generate a wrapped non-circumventing API and modifying the third party application program to redirect the identified API call from the circumventing API to the wrapped non-circumventing API. A request for a permission to access user information is received from the third party application program via the wrapper library executed on a user device.

Abstract: A computer implemented method is provided for resolving eventual consistency conflicts when using a Prefix Hash Tree (“PHT”) and Distributed Hash Table (“DHT”). A prefix hash tree having multiple nodes is created that relates to a distributed hash table. The nodes comprise leaf nodes and internal nodes. All distinct records are aggregated across all conflicting nodes, wherein conflicting nodes are nodes that have identical data records. Records returned are counted. If the count of aggregated records exceeds a max record count, nodes are split such that the aggregated records are divided by a prefix into each new node resulting in the consolidation of duplicate data that were in conflicting nodes into a single data record in a single node. If one or more of the returned conflicting nodes is an internal node, the internal node is split regardless of the number of aggregated records.

Abstract: A method for managing third party application program access to user information via a particular native application program interface (API) is provided. The method includes providing a wrapped native API including a wrapper library and inspecting a third party application program for the presence of the wrapper library in an unmodified form. The application program is inspected to identify API calls. An identified API call to a circumventing API is instrumented by wrapping the circumventing API to generate a wrapped non-circumventing API and modifying the third party application program to redirect the identified API call from the circumventing API to the wrapped non-circumventing API. A request for a permission to access user information is received from the third party application program via the wrapper library executed on a user device.

Abstract: A method of performing additive synthesis of digital audio signals using a novel recursive digital oscillator includes the step of receiving digital audio signal frames wherein each digital audio signal frame includes a set of frequency, amplitude, and phase components represented as coefficients of variables in a mathematical expression. Each digital audio signal frame thereby includes a frequency coefficient representation. Converted frequency coefficients are formed by linearly re-mapping the bits of the frequency coefficient representation and adding range extension via a shift amount in order to bias audio reproduction accuracy toward low frequency signals. Additive synthesis is then performed with the converted frequency coefficients.

Abstract: A method of managing user inputs and displaying outputs in a multi-player game that is played on a plurality of terminals on a network in a manner that compensates for differences in network latency among different terminals. The method includes: (a) transmitting a representation of a game challenge such as a trivia question to the terminals via the network; (b) receiving a game response signal such as a "buzz-in" from two or more of the terminals; (c) assigning each responding terminal a priority rank according to a characteristic of their respective game response signal, e.g., elapsed time since receipt of the game challenge; (d) determining which responding terminal has the highest rank; and (e) sending signals to the responding terminals assigning them respective degrees of control of the game, e.g., the right to take a turn, in accordance with their respective ranks.