Abstract: Systems and methods are described that facilitate idempotent execution of commands generated by a client for execution by a database server. Each command transmitted to the server includes a command ID generated by the client. The server attempts to execute each command and subsequently stores the command ID associated therewith in a repository along with an indication of whether the command executed successfully. When a new command is received by the server, it determines if the command ID associated therewith has already been stored in the repository. If the command ID associated with the new command has not already been stored in the repository, then the server executes the new command. If the command ID associated with the new command has already been stored in the repository and a previously-received command associated with the command ID has been executed successfully, then the server will not execute the new command.

Abstract: Three-dimensional environment reconstruction is described. In an example, a 3D model of a real-world environment is generated in a 3D volume made up of voxels stored on a memory device. The model is built from data describing a camera location and orientation, and a depth image with pixels indicating a distance from the camera to a point in the environment. A separate execution thread is assigned to each voxel in a plane of the volume. Each thread uses the camera location and orientation to determine a corresponding depth image location for its associated voxel, determines a factor relating to the distance between the associated voxel and the point in the environment at the corresponding location, and updates a stored value at the associated voxel using the factor. Each thread iterates through an equivalent voxel in the remaining planes of the volume, repeating the process to update the stored value.

Abstract: A “General Click Model” (GCM) is constructed using a Bayesian network that is inherently capable of modeling “tail queries” by building the model on multiple attribute values that are shared across queries. More specifically, the GCM learns and predicts user click behavior towards URLs displayed on a query results page returned by a search engine. Unlike conventional click modeling approaches that learn models based on individual queries, the GCM learns click models from multiple attributes, with the influence of different attribute values being measured by Bayesian inference. This provides an advantage in learning that enables the GCM to achieve improved generalization and results, especially for tail queries, than conventional click models. In addition, most conventional click models consider only position and the identity of URLs when learning the model. In contrast, the GCM considers more session-specific attributes in making a final prediction for anticipated or expected user click behaviors.

Abstract: Technology is described for enabling passive enforcement of security at computing systems. A component of a computing system can passively authenticate or authorize a user based on observations of the user's interactions with the computing system. The technology may increase or decrease an authentication or authorization level based on the observations. The level can indicate what level of access the user should be granted. When the user or a component of the computing device initiates a request, an application or service can determine whether the level is sufficient to satisfy the request. If the level is insufficient, the application or service can prompt the user for credentials so that the user is actively authenticated. The technology may enable computing systems to “trust” authentication so that two proximate devices can share authentication levels.

Abstract: Systems and associated methods for processing textures in a graphical processing unit (GPU) are disclosed. Textures may be managed on a per region (e.g., tile) basis, which allows efficient use of texture memory. Moreover, very large textures may be used. Techniques provide for both texture streaming, as well as sparse textures. A GPU texture unit may be used to intelligently clamp LOD based on a shader specified value. The texture unit may provide feedback to the shader to allow the shader to react conditionally based on whether clamping was used, etc. Per region (e.g., per-tile) independent mipmap stacks may be used to allow very large textures.

Abstract: Systems, methods, and computer storage media for upgrading a domain in a distributed computing environment are provided. Upgrading of the domain includes preparing for the upgrade, upgrading, and finalizing the upgrade. The preparation of the domain includes ensuring predefined quantities of role instances are available in domains other than the upgrade domain. The preparation also includes ensuring that a predefined number of extent replicas are available in domains other than the upgrade domain. The preparation may also include checkpointing partitions within the upgrade domain to facilitate faster loading once transferred to a domain other than the upgrade domain. The finalization may include allowing nodes within the upgrade domain to resume functionality that was suspended during the upgrade.

Abstract: Various technologies and techniques are disclosed for using heuristics to determine source code ownership. A request is received to identify at least one owner of a particular source code unit. Initial ownership totals are calculated for the source code unit based upon a code contribution heuristic. The code contribution heuristic counts lines of code that were added and that were modified in the totals for contributing users. The initial ownership totals of the particular source code unit are adjusted based upon at least one other heuristic. The at least one owner of the particular source code unit is then output to an output device. The at least one owner is determined by selecting a contributing user that has a highest ranking total after adjusting the initial ownership totals. For example, there can be a primary owner and a backup owner selected based on the ranking of the ownership totals.

Abstract: A Universal Serial Bus (USB) compatible storage device is utilized as a security token for storage of cryptographic keys. A cryptographic subsystem of a processor accesses cryptographic keys in containers on the USB compatible storage device. Accessing includes storing and/or retrieving. The processor does not include an infrastructure dedicated to the USB compatible storage device. Cryptographic key storage is redirected from an in-processor container to the USB compatible storage device. No password or PIN is required to access the cryptographic keys, yet enhanced security is provided. Utilizing a USB compatible storage device for a cryptographic key container provides a convenient, portable, mechanism for carrying the cryptographic key, and additional security is provided via physical possession of the device.

Abstract: A digital media encoder/decoder performs quantization/dequantization based on quantization parameters taken from a harmonic quantizer scale. The harmonic quantizer scale can include a normal portion consisting of quantization parameter values harmonically-related as simple fractions of each other, and a denormal portion of quantizers having a linear or other relation. The encoder/decoder further supports a scaled quantizer mode where quantization is performed based on the quantization parameter as scaled by a fractional value. A compressed domain contrast adjustment is effected by adjusting the quantization parameters in the compressed bitstream, without having to adjust and recode the digital media data in the compressed bitstream.

Abstract: A gateway controls access to a region of a network by either granting or denying a client machine access to the network region based on whether a particular program is running on the client machine. A program is installed on the client machine which sends a detectable indication that the program is running. When it is detected that the program is running, the gateway allows the client machine access to the network region. When the program is not detected to be running, the gateway denies the client machine access to the network region.

Abstract: Systems and methods for visually representing scripted behaviors are provided. A system is disclosed that includes an authoring program executable on a computing device and configured to display a visual scripting interface. The visual scripting interface may be configured to display a plurality of user-selectable graphical building blocks. Each graphical building block may represent a respective component of a script, and may be spatially arrangable within the visual scripting interface to visually represent a script for a target scripted object. Input selectors may be provided on the graphical building blocks to enable users to input script information, and status indicators and messages may also be displayed on the graphical building blocks to inform users whether script information has been properly inputted. Propagation tools may be provided to enable users to successively add new graphical building blocks to build a tree that represents a script sentence.

Abstract: A “Demand-Driven Pointer Analyzer” (DDPA) provides a “demand-driven” field-sensitive pointer analysis process. This process rapidly and accurately identifies alias sets for selected pointers in software modules or programs of any size, including large-scale C/C++ programs such as a complete operating system (OS). The DDPA formulates the pointer analysis task as a Context-Free Language (CFL) reachability problem that operates using a Program Expression Graph (PEG) automatically constructed from the program code. The PEG provides a node and edge-based graph representation of all expressions and assignments in the program and allows the DDPA to rapidly identify aliases for pointers in the program by traversing the graph as a CFL reachability problem to determine pointer alias sets. In various embodiments, the DDPA is also context-sensitive.

Abstract: Many computing scenarios involve the classification of content items within one or more categories. The content item set may be too large for humans to classify, but an automated classifier (e.g., an artificial neural network) may not be able to classify all content items with acceptable accuracy. Instead, the automated classifier may calculate a classification confidence while classifying respective content items. Content items having a low classification confidence may be sent to a human classifier, and may be added, along with the categories identified by the human classifier, to a training set. The automated classifier may then be retrained using the training set, thereby incrementally improving the classification confidence of the automated classifier while conserving the involvement of human classifiers. Additionally, human classifiers may be rewarded for classifying the content items, and the costs of such rewards may be considered while selecting content items for the training set.

Abstract: An RF fingerprinting methodology is generalized to include non-RF related factors. For each fingerprinted tile, there is an associated distance function between two fingerprints (the training fingerprint and the test fingerprint) from within that tile which may be a linear or non-linear combination of the deltas between multiple factors of the two fingerprints. The distance function for each tile is derived from a training dataset corresponding to that specific tile, and optimized to minimize the total difference between real distances and predicted distances. Upon receipt of an inference request, a result is derived from a combination of the fingerprints from the training dataset having the least distance per application of the distance function. Likely error for the tile is also determined to ascertain whether to rely on other location methods.

Abstract: Controlling resource access by entities hosted by an execution extension environment via entity identifiers associated with the resources or with the execution extension environment. Policy sets define the access to the resources. Each policy set includes a principal identifier for execution extension environment, a resource identifier for one of the resources, and access rights. The principal identifier or the resource identifier includes one of the entity identifiers. Access requests from entities are evaluated by comparing the entity identifiers to the policy sets. In some embodiments, the policy sets implement access control for web browsers hosting executable code that attempts to access resources on a computing device.

Abstract: Automatically generating a glossary of terms for a given document or group of documents is provided. A single document or a group of documents associated with a given project or event are parsed for one or more unique terms (e.g., words, acronyms, phrases, etc.). Identified terms are passed to a local or external definition source, and definitions for the one or more identified terms are retrieved. Retrieved definitions are presented to a user of the documents, and approved definitions are stored in a project store for subsequent use in association with the documents.