Abstract: Disclosed herein are efficient geometries for dynamical topology changing (DTC), together with protocols to incorporate DTC into quantum computation. Given an Ising system, twisted depletion to implement a logical gate T, anyonic state teleportation into and out of the topology altering structure, and certain geometries of the (1,?2)-bands, a classical computer can be enabled to implement a quantum algorithm.

Abstract: A virtual-image projector comprises a laser configured to form a narrow beam, first and second dilation optics, first and second redirection optics each having a diffraction grating, and a controller. The first dilation optic is arranged to receive the narrow beam and to project a one-dimensionally dilated beam into the second dilation optic. The second dilation optic is arranged to receive the one-dimensionally dilated beam and project a two-dimensionally dilated beam. The first and second redirection optics are each operatively coupled to a transducer. The first redirection optic is arranged to direct the narrow beam into the first dilation optic at a first entry angle. The second redirection optic is configured to direct the one-dimensionally dilated beam into the second dilation optic at a second entry angle. The controller is configured to bias the transducers to vary the first and second entry angles.

Abstract: Resizing and/or repositioning a target object related by containment to one or more related object laid out on a computer user interface. Original sizes and/or positions of the related objects to the target object resized and/or repositioned are stored. During the resize and/or reposition operation of the target object, an impact on a related object is calculated based upon a change from the stored original sizes and/or positions of the related object.

Abstract: Accelerator systems and methods are disclosed that utilize FPGA technology to achieve better parallelism and flexibility. The accelerator system may be used to implement a relevance-ranking algorithm, such as RankBoost, for a training process. The algorithm and related data structures may be organized to enable streaming data access and, thus, increase the training speed. The data may be compressed to enable the system and method to be operable with larger data sets. At least a portion of the approximated RankBoost algorithm may be implemented as a single instruction multiple data streams (SIMD) architecture with multiple processing engines (PEs) in the FPGA. Thus, large data sets can be loaded on memories associated with an FPGA to increase the speed of the relevance ranking algorithm.

Abstract: Technologies are described herein for altering the appearance of a digital image using a shape. A mask edit mode of operation is provided in which an application program displays a mask shape superimposed on a digital image. The application program also provides user interface controls for altering the size, position, and rotation of the digital image independently of the mask shape, and user interface controls for altering the size, position, and rotation of the mask shape independently of the digital image. When a cropping request is received, the portion of the digital image within the mask shape is mapped onto the mask shape, thereby creating a mask-cropped shape, and a normal editing mode is entered. In the normal editing mode a set of user interface controls is provided for modifying the size, position, and rotation of the mask-cropped shape.

Abstract: A framework for enabling users to create User Defined Functions (UDFs), which can run simultaneously without using multiple calculation threads, is provided. A calculation engine continues a remainder of calculation operations independent of a pending asynchronous function upon starting to run the asynchronous function without waiting to receive a result. The result value is introduced to the computation at a later time during the calculation cycle, when it is received or completed by the calculation engine. When the results are received, downstream operations such as dependent functions are calculated without changing a flow of dependencies within the operations.

Abstract: Techniques and tools are described for using a signaled or derived buffer fullness value to determine a decoding time stamp. The decoding time stamp can be used in a layer such as a system layer to determine when an access unit such as a coded representation of a field or frame should be decoded. For example, a decoding time stamp that corresponds to a clock cycle of a decoder is determined based at least in part on a hypothetical reference decoder initial buffer fullness value. An initial data access unit of a bitstream is transferred to the decoder for decoding at about the time of the corresponding clock cycle for the decoding time stamp.

Abstract: In an example implementation, a bifurcated security scheme has a first level that does not allow usage of negations and a second level that does permit usage of negations. In another example implementation, an authorization query table maps respective resource-specific operations to respective associated authorization queries. In yet another example implementation, authorization queries are permitted to have negations, but individual assertions are not.

Abstract: An authentication mechanism in a local area network may use a cloud authentication mechanism to allow or deny authentication requests. A user may gain access within a local area network by entering a cloud identification and password, which may be verified by a cloud authentication mechanism. If the authentication is successful from the cloud authentication mechanism, the user identification and password are stored locally for subsequent authentication requests. In some embodiments, the cloud password may be periodically flushed so that subsequent requests may be passed to the cloud authentication mechanism. The authentication mechanism may be used in both domain and workgroup local area networks, and may operate in parallel with other users who may have local area network or client credentials which may not be authenticated from the cloud.

Abstract: A method described herein includes receiving a query that is configured by an issuer of the query to be utilized to retrieve a portion of local search content, wherein the local search content comprises a first dataset and a second data set, wherein the first dataset comprises a first entity and the second dataset comprises a second entity, and wherein the query comprises a first token and a second token. The method also includes parsing the query such that the first token of the query is mapped to the first entity in the first dataset and the second token of the query is mapped to the second entity in the second dataset. The method also includes returning search results based at least in part upon the parsing of the query.

Abstract: Some embodiments are directed to controlling interactions between a host software program and a computer system by providing a managed execution environment running within the host software program. In one embodiment, a computer system integrates a managed execution environment within a host software program. The computer system uses the managed execution environment to interact with one or more features of the host software program. The managed execution environment includes interface controls configured to interface between the computer system and the host software program. The compute system alters one or more of the various software program features based on code that is identified in downloaded content.

Abstract: As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.

Abstract: Techniques for visualizing sets are described. Arbitrary subsets of data elements are represented by corresponding graphic lines. The data elements in a set are connected up sequentially by a corresponding graphic line, the graphic line passing through each data element once with minimal or no self-overlapping. The graphic lines may be curved, for instance in the form of spline segments interconnecting nodes that represent the respective subsets. Each line may have a different color. Data elements not belonging to a subset may still be represented by a nodes but are not connected with any of the graphic lines, thus it can be seen which data elements belong to which sets, if any.

Abstract: Allocation of memory registers for shaders by a processor is described herein. For each shader, registers are allocated based on the shader's level of complexity. Simpler shader instances are restricted to a smaller number of memory registers. More complex shader instances are allotted more registers. To do so, developers' high level shading level (HLSL) language includes template classes of shaders that can later be replaced by complex or simple versions of the shader. The HLSL is converted to bytecode that can be used to rasterize pixels on a computing device.

Abstract: One or more techniques and/or systems are disclosed for identifying a list of destination servers ordered by round-trip time (RTT) for a requesting machine. When a client interacts with an address, such as an IP address, when accessing a remote service, an RTT is collected for the address, or the RTT may be derived for a range of addresses, and saved in a database. When the client subsequently requests access to a remote service, a list of destination servers are returned, respectively identified by corresponding addresses. The destination servers can be sorted in order of efficiency by determining an expected RTT associated with a matching address, or range, in the database, and sorting the destination servers by their respective expected RTTs.

Abstract: Embodiments of the invention compress an image that contains a representation of text. Embodiments take an image of graphical data and determines one or more portions of that image that have a high probability of containing text. Embodiments then take each such portion of the image and determines one or more rows of text within each portion (where text does, in fact, exist within the portion). The embodiments then traverse each vertical band of pixels of each row to determine sub-glyphs. Where a particular sub-glyph is encountered for the first time, the embodiments cache that sub-glyph, and send it (or a compressed representation thereof) to a client in a remote presentation session. Where a particular sub-glyph has been cached already, the embodiments send a reference to that cached vertical band to the client.

Abstract: Hierarchical structures are visualized and navigated using an orbital model. Sibling nodes are orbitally displayed in a generally circular arrangement along an orbital path. Choosing one of the orbitally displayed nodes opens it, moving down in the hierarchy. Nodes which were not chosen are undisplayed, and child node(s) of the chosen node are orbitally displayed. Node movements may be animated. A history displays recently chosen nodes. Choosing a parent node of the orbiting nodes undisplays the child nodes, and the parent node and its siblings are orbitally displayed, thereby moving up in the hierarchy. A user may select nodes from different parts of the hierarchy by moving them into a selection tray. Selected nodes can then be subjected to a specified batch operation. Controls are available for sorting nodes and/or for altering node appearance in the display.

Abstract: Systems and computer-implemented methods of electing a new leader node in distributed systems of simple topologies connecting a plurality of nodes on at least one computer system. The computer-implemented method comprises several steps including at least one node, which detected the absence of a leader, starting a first round for its approval as an Approved Election Initiator. If a quorum accepts the StartElection request during the first round, then the Election Initiator starts a second round to set the leader. If a quorum of all nodes has not been reached during the first round, then the first round fails. The method repeats until a leader is set and is repeated each time a node discovers that the network does not have an active leader. Also provided herein is a computer readable medium having computer executable instructions stored thereon for performing the computer-implemented method.

Abstract: Described is a multiple phase process/system that combines spatial filtering with regularization to separate sound from different sources such as the speech of two different speakers. In a first phase, frequency domain signals corresponding to the sensed sounds are processed into separated spatially filtered signals including by inputting the signals into a plurality of beamformers (which may include nullformers) followed by nonlinear spatial filters. In a regularization phase, the separated spatially filtered signals are input into an independent component analysis mechanism that is configured with multi-tap filters, followed by secondary nonlinear spatial filters. Separated audio signals are the provided via an inverse-transform.