Abstract: A resource allocation framework for wireless/wired networks is described. In an embodiment, methods of end host based traffic management are described which operate separately from the underlying access control protocol within the network (e.g. wireless MAC protocol or TCP). The rate limits for each flow are set based on per-flow weights, which may be user specified, and based on an estimate of the utilization of the shared resource and the rate limits are adjusted periodically so that the resource is not underutilized or saturated. Some embodiments compute a virtual capacity of the resource which is adjusted to optimize the value of the utilization and then the virtual capacity is shared between flows according to the per-flow weights. Methods for estimating the utilization of a wireless network and the capacity of a broadband access link are also described.

Abstract: Image processing using geodesic forests is described. In an example, a geodesic forest engine determines geodesic shortest-path distances between each image element and a seed region specified in the image in order to form a geodesic forest data structure. The geodesic distances take into account gradients in the image of a given image modality such as intensity, color, or other modality. In some embodiments, a 1D processing engine carries out 1D processing along the branches of trees in the geodesic forest data structure to form a processed image. For example, effects such as ink painting, edge-aware texture flattening, contrast-aware image editing, forming animations using geodesic forests and other effects are achieved using the geodesic forest data structure. In some embodiments the geodesic forest engine uses a four-part raster scan process to achieve real-time processing speeds and parallelization is possible in many of the embodiments.

Abstract: Controlled constraint sharing in parallel problem solvers is described. In embodiments, constraint sharing in a problem solver is controlled by comparing a total number of shared constraints obtained in a time interval to a target, and regulating the subsequent number of shared constraints obtained from other problem solvers accordingly. Embodiments describe how the regulation of the subsequent number of shared constraints can be achieved by controlling the size of constraints shared by other problem solvers. Embodiments describe how an additive increase/multiplicative decrease algorithm can be used to determine the size of constraints to be exchanged. Embodiments also describe how the utility of the shared constraints can be determined, and used to control the size of constraints shared by other problem solvers. In embodiments, the problem solver is a Boolean satisfiability problem solver.

Abstract: Content-based information retrieval is described. In an example, a query item such as an image, document, email or other item is presented and items with similar content are retrieved from a database of items. In an example, each time a query is presented, a classifier is formed based on that query and using a training set of items. For example, the classifier is formed in real-time and is formed in such a way that a limit on the proportion of the items in the database that will be retrieved is set. In an embodiment, the query item is analyzed to identify tokens in that item and subsets of those tokens are selected to form the classifier. For example, the subsets of tokens are combined using Boolean operators in a manner which is efficient for searching on particular types of database.

Abstract: Control of background data transfers is described. In an embodiment, a background data transfer is controlled at a receiver node by measuring a time period taken to receive from a sender node a data sequence of the same size as a receive window. The time period is used to evaluate available network capacity, and the network capacity used to calculate a new window size. The new window size is applied and communicated to the sender node. In another embodiment, a background data transfer is controlled at a receiver node by measuring a quantity of data received from a sender node during a first control interval. The measured quantity is used to evaluate available network capacity, and the network capacity used to calculate a new receive window size and a second control interval duration. The new window size is applied for the second control interval, and communicated to the sender node.

Abstract: Histograms formed based on samples of a population, such as histograms created from random page-level samples of a data store, are intelligently scaled to histograms estimating distribution of the entire population of the data store. As an optional optimization, where a threshold number of duplicate samples are observed during page-level sampling, the number of distinct values in the overall population data is presumed to be the number of distinct values in the sample data. Also, during estimation of distinct values of an overall population, a “Chao” estimator can optionally be utilized as a lower bound of the estimate. The resulting estimate is then used when scaling, which can take domain knowledge of the data being scaled into account in order to prevent scaled estimates from exceeding the limits of the domain.

Abstract: The claimed subject matter relates to an architecture or arrangement that can limit access to sensitive information by means of encryption. In particular, data obtained from a payment instrument at, e.g., a Point-Of-Sale (POS) location can be encrypted at an early stage such that a POS (or another) application does not have access to the data in an unencrypted form and/or does not have access to a means for decrypting the data. For example, a Public Key Infrastructure (PKI) arrangement can be employed such that a back-end payment processor can define encryption algorithms, associate itself with a public key, and maintain a private key for decryption. The public key can be delivered to the POS location and employed for data encryption, and, moreover, the PKI can be regulated by the more trusted parties.

Abstract: A configuration management system that uses a data compression method to compress entries in a data set. An entry is selected as a prefix value and prefix compression of the data set is performed. The entry to serve as the prefix value is quickly selected using an iterative approach. In each iteration, subgroups of entries are formed from groups formed in prior iterations based on the values of characters at successive positions in the entries. The approach is readily implemented using data structures represented as lists.

Abstract: A multi level virtual function table uses a hierarchy of chunks or segments of virtual function tables to identify methods for a particular class. At least one level of indirection pointers may point to individual virtual function table chunks, which may be shared by multiple classes. In some embodiments, fixed size chunks of virtual function tables may be used, other embodiments may use variable sized chunks of virtual function tables. In just in time compiled code, virtual function tables may be limited to sharing across parent and child classes, while in pre-compiled code, more complex sharing may be used.

Abstract: A software development system and method are provided. The system includes a transform component to convert a schema file into a simplified graphical data representation that coincides with a data representation associated with an underlying instance document. A viewing component displays the simplified graphical data representation.

Abstract: An application programming interface (API) for administering the distribution of software updates on an update service node is presented. The API provides a plurality of interface calls through which an administrator can establish rules by which software updates available to the update service node are distributed.

Abstract: A method and system for enhancing a network load balancing system's ability to distribute connection information and data amongst the plurality of nodes within the system is presented. A client connection request is redirected to a load balancing service residing on a receiving node by modifying the destination port information contained within the packet. The receiving node can be any node within the load balancing system, and is determined from amongst the plurality of nodes that comprise the system by a conventional means. A transparent connection is then established between the client and the load balancing service residing on the node by modifying subsequently transmitted connection setup packets sent by the receiving node and the client. A target node is determined according to resource specific information contained within initially received data packets from the client. The target node determined this way could be the local node or another node.

Abstract: Various technologies and techniques are disclosed for offering and applying source code modifications based upon a context of a user in a development environment. For example, code snippets can be offered to the user and customized programmatically. A code editor accepts user input comprising source code. Code snippets of sample source code are stored in a data store. A code completion tool monitors user actions and detects a triggering action in the monitored user actions. A code snippet associated with the triggering action is identified. An option is offered representing the code snippet. In response to user selection of the option, the associated code snippet is inserted into the code editor and is automatically customized based upon the user context. As another example, aspect-oriented source code transformations are offered based upon the user context. As yet another example, solutions to commonly problematic tasks are offered based upon the user context.

Abstract: The claimed subject matter provides systems and/or methods that facilitate generating an inference about events that may not have yet been observed. Open-world modeling can be used to take a history of observation so as to understand trends over time in the revelation of previously unseen events, and to make inferences with subsets of data that new unseen events will be seen. Thus, inaccuracies associated with predictions generated from incomplete data sets can be mitigated. To yield such predictions, open-world submodels and closed-world submodels that do not allow for previously unseen events can be combined via a model mixture methodology, which fuses inferences from the open- and close-world models.

Abstract: Events captured at an application are compared to event correlation instances, wherein an event correlation instance represents a relationship between events of components of the application. The event of a plurality of events that is a potential root cause event of the plurality of events is determined. The potential root cause event and component associated with the potential root cause event are outputted.

Abstract: A method includes executing a web script by a browser element to access a web service executing on a web server and providing access to a web application, subscribing to the web service by the browser element so that data will be sent from the web service without requiring the browser element to initiate a request for the data, receiving the data from the web service by a communicator module executing on the client computing device, and sending the data to the browser element by the communicator module. A system includes a browser having at least one browser element configured to subscribe to data from an external web service.

Abstract: Systems and methods that group atomic scalar values recognized by a database such as columns into sets (e.g., column sets). A grouping component associated with the SQL server creates a logical representation for column groupings, which are accessible by a single I/O and can be co-located (e.g., substantially close or compact) in terms of storage location. Interesting column sets (e.g., non-null) can also be selected for a data representation thereof as a single entity to other applications.

Abstract: Aspects of the subject matter described herein relate to configuring file shares. In aspects, a template is created that includes policies to apply to one or more shares. The template may derive or otherwise obtain policies from other templates and may also refer to other templates. The template may include opaque data to pass to a subsystem that configures a share with a policy corresponding to the data. After the template is created, the template may then be applied to one or more shares to configure the shares according to policies included in the template. When the template or any template upon which the template depends or to which the template refers is changed, shares associated with the template may also be automatically changed as appropriate.

Abstract: A system that employs out-of-process (‘out-of-proc’) architectures with respect to malware scanning related to network services applications is provided. The ‘out-of-proc’ malware (e.g., virus) scanning is employed in connection with a web conferencing server. This architecture enables more versatile options related to scanning, for example, selective bypass in a crisis situation.

Abstract: Techniques are described that perform software testing using virtual machines on dedicated or underutilized available computing devices. One or more virtual machines are identified as being sufficient to perform a test and availability of the one or more virtual machines is determined. The test is then executed on the one or more virtual machines when resources are available, thereby reducing the time and risks involved in using non-dedicated devices for testing.