Abstract: Techniques of interaction data processing in a distributed computing system are disclosed herein. One example technique includes upon receiving a user interface output having a content item to be surfaced on a client device and a script configured to detect an interaction with the content item at the client device, surfacing the user interface output having the content item on a display of the client device and automatically executing the script embedded in the user interface output to detect an interaction with the surfaced content item at the client device. Upon detecting an interaction with the content item on the surfaced user interface output, the example technique also includes generating and transmitting interaction data representing the detected interaction to a remote server.

Abstract: In a computing system, data is ingested into a primary row of shards in a stamp data structure. The stamp data structure includes a primary row of data shards and a set of replica rows of data shards so the data shards are arranged in rows and columns in the stamp structure. The ingested data is replicated from the primary row into the replica rows of data shards. Each of the data shards, in each row, is evaluated to identify a particular data shard in each column of shards to generate a logical row of data shards. Queries against the data shards are serviced from the logical row of data shards. The system dynamically controls expansion and contraction of the number of data shards in a row and of the number of replica rows.

Abstract: Techniques of interaction data processing in a distributed computing system are disclosed herein. One example technique includes upon receiving a user interface output having a content item to be surfaced on a client device and a script configured to detect an interaction with the content item at the client device, surfacing the user interface output having the content item on a display of the client device and automatically executing the script embedded in the user interface output to detect an interaction with the surfaced content item at the client device. Upon detecting an interaction with the content item on the surfaced user interface output, the example technique also includes generating and transmitting interaction data representing the detected interaction to a remote server.

Abstract: A string, identifying an item to be assigned to a physical resource, is hashed to obtain a numeric hash value. The numeric hash value is downscaled to obtain a bucket identifier that identifies a bucket that will hold the numeric hash value. The bucket is then deterministically mapped to a physical resource so that it can be retrieved without accessing a stored data structure representative of the mapping.

Abstract: In a computing system, data is ingested into a primary row of shards in a stamp data structure. The stamp data structure includes a primary row of data shards and a set of replica rows of data shards so the data shards are arranged in rows and columns in the stamp structure. The ingested data is replicated from the primary row into the replica rows of data shards. Each of the data shards, in each row, is evaluated to identify a particular data shard in each column of shards to generate a logical row of data shards. Queries against the data shards are serviced from the logical row of data shards. The system dynamically controls expansion and contraction of the number of data shards in a row and of the number of replica rows.

Abstract: A string, identifying an item to be assigned to a physical resource, is hashed to obtain a numeric hash value. The numeric hash value is downscaled to obtain a bucket identifier that identifies a bucket that will hold the numeric hash value. The bucket is then deterministically mapped to a physical resource so that it can be retrieved without accessing a stored data structure representative of the mapping.

Abstract: A string, identifying an item to be assigned to a physical resource, is hashed to obtain a numeric hash value. The numeric hash value is downscaled to obtain a bucket identifier that identifies a bucket that will hold the numeric hash value. The bucket is then deterministically mapped to a physical resource so that it can be retrieved without accessing a stored data structure representative of the mapping.

Abstract: A string, identifying an item to be assigned to a physical resource, is hashed to obtain a numeric hash value. The numeric hash value is downscaled to obtain a bucket identifier that identifies a bucket that will hold the numeric hash value. The bucket is then deterministically mapped to a physical resource so that it can be retrieved without accessing a stored data structure representative of the mapping.

Abstract: Techniques of interaction data processing in a distributed computing system are disclosed herein. One example technique includes upon receiving a user interface output having a content item to be surfaced on a client device and a script configured to detect an interaction with the content item at the client device, surfacing the user interface output having the content item on a display of the client device and automatically executing the script embedded in the user interface output to detect an interaction with the surfaced content item at the client device. Upon detecting an interaction with the content item on the surfaced user interface output, the example technique also includes generating and transmitting interaction data representing the detected interaction to a remote server.

Abstract: The inertial system for gravity difference measurement uses COTS nano accelerometer and a strapdown Global Navigation Satellite System (GNSS)-aided inertial measurement unit (IMU). The former has low measurement noise density, while the latter is used to analytically stabilize the platform. Stochastic modeling of the gravity anomaly is utilized (as opposed to the deterministic modeling of causes and effects) to simplify the algorithm. The algorithm aims at finding relative changes between points, as opposed to absolute values at the points, which allows for high relative precision required in many applications.

Abstract: Caching of an immutable buffer that has its data and address prevented from changing during the lifetime of the immutable buffer. A first computing entity maintains a cache of the immutable buffer and has a strong reference to the immutable buffer. So long as any entity has a strong reference to the immutable buffer, the immutable buffer is guaranteed to continue to exist for the duration of the strong reference. A second computing entity communicates with the first computing entity to obtain a strong reference to the immutable buffer and thereafter read data from the immutable buffer. Upon reading the data from the cache, the second computing entity demotes the strong reference to a weak reference to the immutable buffer. A weak reference to the immutable buffer does not guarantee that the immutable buffer will continue to exist for the duration of the weak reference.

Abstract: The environment and use of an immutable buffer. A computing entity acquires data or generates data and populates the data into the buffer, after which the buffer is classified as immutable. The classification protects the data populated within the immutable buffer from changing during the lifetime of the immutable buffer, and also protects the immutable buffer from having its physical address changed during the lifetime of the immutable buffer. As different computing entities consume data from the immutable buffer, they do so through views provided by a view providing entity. The immutable buffer architecture may also be used for streaming data in which each component of the streaming data uses an immutable buffer. Accordingly, different computing entities may view the immutable data differently without having to actually copy the data.

Abstract: The environment and use of an immutable buffer. A computing entity acquires data or generates data and populates the data into the buffer, after which the buffer is classified as immutable. The classification protects the data populated within the immutable buffer from changing during the lifetime of the immutable buffer, and also protects the immutable buffer from having its physical address changed during the lifetime of the immutable buffer. As different computing entities consume data from the immutable buffer, they do so through views provided by a view providing entity. The immutable buffer architecture may also be used for streaming data in which each component of the streaming data uses an immutable buffer. Accordingly, different computing entities may view the immutable data differently without having to actually copy the data.

Abstract: Caching of an immutable buffer that has its data and address prevented from changing during the lifetime of the immutable buffer. A first computing entity maintains a cache of the immutable buffer and has a strong reference to the immutable buffer. So long as any entity has a strong reference to the immutable buffer, the immutable buffer is guaranteed to continue to exist for the duration of the strong reference. A second computing entity communicates with the first computing entity to obtain a strong reference to the immutable buffer and thereafter read data from the immutable buffer. Upon reading the data from the cache, the second computing entity demotes the strong reference to a weak reference to the immutable buffer. A weak reference to the immutable buffer does not guarantee that the immutable buffer will continue to exist for the duration of the weak reference.

Abstract: Described is a mechanism for exposing a volume shadow copy of a shared volume over a network to a remote client. A shared volume is accessed at a client computing system having a root. A volume shadow copy (or “snapshot”) of the volume is identified as a child resource of the shared volume. The child resource representing the snapshot may be hidden from ordinary view by default. To access the snapshot, a user may access the child resource as if it were an ordinary file or directory on the shared volume. Advantageously, the user need not mount a new volume representing the snapshot volume, but rather the user may directly access the snapshot.

Abstract: A method and system for providing state-full access to files and resuming access should a connection be broken. A resume key is returned to the client that allows the client to request a duplicate handle to an open file. The duplicate handle can be used to access the file in the same manner as the handle used to open the file. When a connection is broken, the file remains open on the server for a period of time and the state information associated with the file is maintained. Even if a connection is not broken, a client may request one or more duplicate handles and establish other channels (also known as connections) with which to access the file.

Abstract: Described is a mechanism for exposing a volume shadow copy of a shared volume over a network to a remote client. A shared volume is accessed at a client computing system having a root. A volume shadow copy (or “snapshot”) of the volume is identified as a child resource of the shared volume. The child resource representing the snapshot may be hidden from ordinary view by default. To access the snapshot, a user may access the child resource as if it were an ordinary file or directory on the shared volume. Advantageously, the user need not mount a new volume representing the snapshot volume, but rather the user may directly access the snapshot.

Abstract: The present invention provides a processor including a core unit for processing requests from at least one process. The at least one process has a code portion with at least one segment having a first code context identifier. The at least one process also has a data portion with a first data context identifier. The processor further includes a first storage device for storing code address translations and a second storage device for storing data address translations. The processor also includes a code context register coupled to the core unit and to the first storage device, for storing a second code context register. The processor also includes a data context register, coupled to the core unit and to the second storage device for storing a second data context identifier.

Abstract: An address translation control circuit which operates in connection with a processor and a translation look-aside buffer ("TLB") to perform virtual-to-physical address translations through shared entries of the TLB. The address translation control circuit comprises a primary context storage element, a group context storage element, a context matching circuit, a comparing unit and a logic unit. The context matching circuit is coupled to primary and group context storage elements to receive their context numbers and reads a context identification number and a context select bit value from a chosen translation entry of the TLB. Concurrently, the comparing unit compares the virtual address contained in that entry with the virtual address requested for translation by the processor. The logic unit receives the outputs from the context matching circuit and the comparing unit and signals operating system software whether an appropriate translation has been found in the TLB.