Abstract: A system, method and computer-readable medium supports a feature that predicts a selection based on history of use and uses this information to pre-select an item in a list for syntax completion in a source program editor.

Abstract: A tool that allows a user, such as a software developer, to create test data that can consistently be employed to simulate the operation of a hardware pen or stylus. Raw pen data, such as position coordinates, pen angle and pen properties, is captured. This data is then later injected into a system being tested in place of pen data from a device driver. The raw pen data may be captured through an application programming interface invoked by a host application. The captured data can then subsequently be injected through another application programming interface invoked by a host application, such as a software testing application for testing a variety of operations of another software application. Alternately, a stand-alone utility may be used for capturing and then injecting raw pen data.

Abstract: The invention uses a three phase IKE protocol main mode negotiation to implement a port float algorithm that permits UDP encapsulated ESP traffic to traverse an IPSec-aware NAT. The NAT is connected to a plurality of client computers on a private network and provides an interface between the client computers and a server connected to a public network. In a first phase, a client and the server determine whether both are capable of sending UDP encapsulated ESP packets. In a second phase, the client and server conduct NAT discovery and determine whether the client, server, or both operate behind a NAT. In a third phase, the client and server initiate a port float algorithm, moving a destination UDP port specified in IKE packets from a first port value to a second port value. The server maintains a data structure that allows the server to identify the client sending IKE packets after exiting the second phase and entering the third phase.

Abstract: A method and apparatus for configuring a plurality of computers, each of which requires interaction with at least one resource to advance a configuration state of the computer. A request for access to a resource may be received from at least one of the computers, and a resource needed may be determined. An availability of the resource needed may be determined, and the computer instructed to interact with the resource if the resource is available. If the resource is not available, the computer may be caused to not interact with the resource.

Abstract: A method is provided for displaying a page formed of discrete elements, such as a Web page, on different computing devices. The method converts the page into a semantic thumbnail, which preserves the overall appearance of the page and displays readable text segments that enable a user to identify main areas of the page. The semantic thumbnail is adaptable to different screen sizes and target font sizes. The method enlarges unreadable text segments in a miniature version of the page. The method also trims the enlarged text segments to fit the width of the semantic thumbnail by summarizing or cropping text in the enlarged text segments.

Abstract: Techniques for testing a station, such as a wireless-enabled device, are described. A first method relates to evaluating a station configured to communicate with at least one access point. Another device is controlled to communicate wirelessly with the station by transmitting a wireless signal. The first device is controlled, via software, to reduce the strength of the wireless signal, and the response of the station is evaluated. A second method relates to evaluating a station configured to communicate in accordance with a wireless communication standard. Another device is controlled to engage in wireless communication with the station in a manner that does not comply with the wireless communication standard, and the station's response is evaluated. A third method relates to evaluating a station that can be configured to communicate in different communication modes.

Abstract: A computer network has links for carrying data among computers, including one or more client computers. Packet loss rates are determined for the client computers and, based on the loss rates, a number of possible sets of solutions for the loss rates at each of the links are generated. The sets of possible solutions are subjected to a statistical analysis. Based on the results of the analysis, a determination is made regarding which of the links are excessively lossy.

Abstract: Lightweight query processing for in-memory or cache memory data structures, such as DataSet, is provided. Prior to executing a query over an in-memory data structure, a query processor determines whether any benefits can be obtained by first optimizing the query execution strategy. Additionally, one or more bail out points can be applied to the optimization analysis to further enhance query execution speed for circumstances where optimization is unlikely to provide significant performance benefits. The lightweight query processing techniques can be supported in any framework for processing or formulating queries of in-memory data structures, such as language integrated query (LINQ) queries.

Abstract: Described herein is technology for, among other things, providing receiver side services for electronic content. The technology involves determining a price for a specific service to be executed on electronic content to be viewed by a receiver. A redeemable code associated with said pre-determined price is attached to the electronic content. This code, if the receiver chooses to redeem it, allows the receiver of a file to have a service provider perform a pre-priced service to the electronic document that the code relates to. The receiver has a choice to not redeem the code if they are satisfied with the electronic content and then no charge shall be incurred. The charge can be incurred if the receiver chooses to redeem the coupon in which case the service shall be provided to the electronic document.

Abstract: The techniques and mechanisms described herein are directed to a system for stylizing video, such as interactively transforming video to a cartoon-like style. Briefly stated, the techniques include determining a set of volumetric objects within a video, each volumetric object being a segment. Mean shift video segmentation may be used for this step. With that segmentation information, the technique further includes indicating on a limited number of keyframes of the video how segments should be merged into a semantic region. Finally, a contiguous volume is created by interpolating between keyframes by a mean shift constrained interpolation technique to propagate the semantic regions between keyframes.

Abstract: One or more fact qualifiers may be associated with an assertion in security scenarios. In an example implementation, each respective assertion may be associated with a respective fact qualifier in a security token having multiple assertions. In another example implementation, a fact qualifier of a first assertion may be checked or disregarded based on whether a corresponding second assertion includes a fact qualifier check constraint. In yet another example implementation, an assertion made by an assertor may be associated with multiple fact qualifiers.

Abstract: Efficient server-side query statement parameter bucketization is provided for a query language, such as the structured query language (SQL). A process is applied for replacing the parameters of a parameterized query with new parameters, whose types are normalized to enable more query execution plan sharing. In one embodiment, in response to receiving a parameterized query expression of a query language, the bucketization process operates to bucketize parameter(s) of the parameterized expression based on the type(s) of the parameter(s) by replacing the type(s) with new broader, or more specific, type(s). An existing server-side parameterization framework that includes a mechanism for determining when parameterization is “safe,” is extended, and is applied to bucketize parameters by using the mechanism to determine when replacing a parameter(s) of parameterized expressions with new parameter(s) of different type(s) is safe.

Abstract: A unified workspace (UWS) design that provides a single system-wide display and interaction surface, and a set of tools that allow a user to discover relevant information. Data is surfaced across boundaries of applications and documents and stored implicitly from preset business logic or explicitly from user demand. Data can be implicitly and explicitly queried and aggregated from many different data sources such as various content types that are created in different formats and displayed on a single interaction surface. The UWS surfaces the required application functionalities to perform the tasks by partial launch of the associated application. Data elevation surfaces only the relevant amount of information, based on the context and activity, to assist the completion and decisionmaking process. Private and shared workspaces can be employed with object passing therebetween. The UWS provides a visual representation of each element such as information or relationship and allows direct user interaction.

Abstract: Generation of test data for systems having functionality subject to a grammar or other sort of meta-data is automated by a controlled combinatorial approximation of naïve combinatorial coverage. A suite of control mechanisms are applied to an algorithm that generates test data to provide well-defined and understandable approximations of full combinatorial coverage.

Abstract: Creating a journal of media encounters listing media content that was previously provided to a user. Metadata describing the media encounters is used to create journal entries. The journal is presented to the user for interaction. A purchase opportunity for the media content is provided to the user based on the metadata.

Abstract: Described is a technology by which an intermediate taxonomy is processed (e.g., offline) with respect to a target taxonomy to determine relationship values between categories represented in the intermediate taxonomy and the target taxonomy. The relationship values are used to construct a bridging classifier for use in online query processing to relate queries to categories in the target taxonomy. The relation is based on each target category's relationship to one or more categories that were represented in the intermediate taxonomy. Further, only a relevant subset of the categories represented in the intermediate taxonomy may be chosen for use in the bridging classifier, e.g., based on relative probability scores and/or mutual information scores computed between the categories represented in the intermediate taxonomy and categories in the target taxonomy.