Abstract: The claimed subject matter includes techniques for providing an application testing service with a user interface that enables a user to evaluate performance data for computer implemented decision policies. An example method includes displaying a first reward statistic comprising an actual performance result for a policy implemented by an application. The method also includes obtaining experimental data corresponding to previously implemented policies, computing a second reward statistic for a hypothetical policy using a reward function applied to the experimental data. The method also includes displaying the second reward statistic together with the first reward statistic to enable a user to compare the first reward statistic and the second first reward statistic.

Abstract: Techniques and constructs can reduce the time required to determine solutions to optimization problems such as training of neural networks. Modifications to a computational model can be determined by a plurality of nodes operating in parallel. Quantized modification values can be transmitted between the nodes to reduce the volume of data to be transferred. The quantized values can be as small as one bit each. Quantization-error values can be stored and used in quantizing subsequent modifications. The nodes can operate in parallel and overlap computation and data transfer to further reduce the time required to determine solutions. The quantized values can be partitioned and each node can aggregate values for a corresponding partition.

Abstract: An actuator system comprising a rotatable lock mechanism defining a path for an actuator pin as the actuator is expanded and retracted, wherein the lock mechanism defines an entry passage through which the pin enters as the actuator extends, a guide surface along which the pin travels from the entry passage as the actuator retracts, a locking recess into which the pin is guided by the guide surface, and an exit passage into which the pin is guided as it is caused to leave the lock recess by extension of the actuator and subsequent retraction; whereby a detent surface is provided to prevent the pin returning back into the lock recess when the actuator is extended to cause the pin to leave the lock recess; and whereby the lock mechanism provides a sloping engagement surface for the pin, either side of the entry passage.

Abstract: The claimed subject matter includes techniques for providing an application testing service. An example method includes receiving context information from a client system, the context information comprising parameters that describe details of a user interaction with an application under test (AUT). The method also includes receiving a set of potential actions from the client system. The method also includes identifying a selected action from the set of potential actions and sending the selected action to the client system, wherein the AUT is customized based on the selected action. The method also includes receiving reward data from the client system based on a user's interaction with the AUT. The method also includes storing the context information, the selected action, and the reward data to a log of application test data.

Abstract: The claimed subject matter includes techniques for providing an application testing service with a user interface that enables a user to evaluate performance data for computer implemented decision policies. An example method includes displaying a first reward statistic comprising an actual performance result for a policy implemented by an application. The method also includes obtaining experimental data corresponding to previously implemented policies, computing a second reward statistic for a hypothetical policy using a reward function applied to the experimental data. The method also includes displaying the second reward statistic together with the first reward statistic to enable a user to compare the first reward statistic and the second first reward statistic.

Abstract: Techniques and constructs can reduce the time required to determine solutions to optimization problems such as training of neural networks. Modifications to a computational model can be determined by a plurality of nodes operating in parallel. Quantized modification values can be transmitted between the nodes to reduce the volume of data to be transferred. The quantized values can be as small as one bit each. Quantization-error values can be stored and used in quantizing subsequent modifications. The nodes can operate in parallel and overlap computation and data transfer to further reduce the time required to determine solutions. The quantized values can be partitioned and each node can aggregate values for a corresponding partition.

Abstract: A computing device can determine a decomposition of data of actions of a first session based at least in part on a first computational model associating the actions of the first session with corresponding state values of the first session. The computing device can determine a second computational model based at least in part on the decomposition and an operation template. The computing device can receive a query via the communications interface, the query associated with the second session. The computing device can determine a state value of the second session based at least in part on the query. The computing device can operate the second computational model to determine at least one response associated with the query based at least in part on the state value of the second session. The computing device can provide an indication of the at least one response via the communications interface.

Abstract: Method, system, and programs for distributed machine learning on a cluster including a plurality of nodes are disclosed. A machine learning process is performed in each of the plurality of nodes based on a respective subset of training data to calculate a local parameter. The training data is partitioned over the plurality of nodes. A plurality of operation nodes are determined from the plurality of nodes based on a status of the machine learning process performed in each of the plurality of nodes. The plurality of operation nodes are connected to form a network topology. An aggregated parameter is generated by merging local parameters calculated in each of the plurality of operation nodes in accordance with the network topology.

Abstract: An actuator system comprising a rotatable lock mechanism defining a path for an actuator pin as the actuator is expanded and retracted, wherein the lock mechanism defines an entry passage through which the pin enters as the actuator extends, a guide surface along which the pin travels from the entry passage as the actuator retracts, a locking recess into which the pin is guided by the guide surface, and an exit passage into which the pin is guided as it is caused to leave the lock recess by extension of the actuator and subsequent retraction; whereby a detent surface is provided to prevent the pin returning back into the lock recess when the actuator is extended to cause the pin to leave the lock recess; and whereby the lock mechanism provides a sloping engagement surface for the pin, either side of the entry passage.

Abstract: The claimed subject matter includes techniques for providing an application testing service. An example method includes receiving context information from a client system, the context information comprising parameters that describe details of a user interaction with an application under test (AUT). The method also includes receiving a set of potential actions from the client system. The method also includes identifying a selected action from the set of potential actions and sending the selected action to the client system, wherein the AUT is customized based on the selected action. The method also includes receiving reward data from the client system based on a user's interaction with the AUT. The method also includes storing the context information, the selected action, and the reward data to a log of application test data.

Abstract: An actuator comprises an actuator output shaft, a rotatable lock formation associated with the output shaft so as to be axially fixed relative thereto, the lock formation defining an entry passage, a lock pocket and an exit passage, a pin positioned for movement relative to the lock formation such that, as the actuator approaches a fully extended position, a part of the pin is received within and passes along the entry passage, and resilient detent means operable such that, once the pin has moved beyond a predetermined position within the entry passage, the resilient detent means prevents return movement of the pin along the entry passage.

Abstract: Various embodiments for maintaining security and confidentiality of data and operations within a fraud detection system. Each of these embodiments utilizes a secure architecture in which: (1) access to data is limited to only approved or authorized entities; (2) confidential details in received data can be readily identified and concealed; and (3) confidential details that have become non-confidential can be identified and exposed.

Abstract: Various technologies relating to prevention of display of advertisements on pages rendered on client computing devices are described. A user participates in real-time auctions for advertisement positions on pages, where a bidding agent submits bids on behalf of the user. When the user wins an auction for an advertisement position, the advertisement position is populated with content approved by the user, thus effectively preventing another advertiser from presenting an advertisement in the advertisement position.

Abstract: Various embodiments for maintaining security and confidentiality of data and operations within a fraud detection system. Each of these embodiments utilizes a secure architecture in which: (1) access to data is limited to only approved or authorized entities; (2) confidential details in received data can be readily identified and concealed; and (3) confidential details that have become non-confidential can be identified and exposed.

Abstract: Methods and apparatus for performing computer-implemented personalized recommendations are disclosed. User information pertaining to a plurality of features of a plurality of users may be obtained. In addition, item information pertaining to a plurality of features of the plurality of items may be obtained. A plurality of sets of coefficients of a linear model may be obtained based at least in part on the user information and/or the item information such that each of the plurality of sets of coefficients corresponds to a different one of a plurality of items, where each of the plurality of sets of coefficients includes a plurality of coefficients, each of the plurality of coefficients corresponding to one of the plurality of features. In addition, at least one of the plurality of coefficients may be shared among the plurality of sets of coefficients for the plurality of items.

Abstract: Method, system, and programs for distributed machine learning on a cluster including a plurality of nodes are disclosed. A machine learning process is performed in each of the plurality of nodes based on a respective subset of training data to calculate a local parameter. The training data is partitioned over the plurality of nodes. A plurality of operation nodes are determined from the plurality of nodes based on a status of the machine learning process performed in each of the plurality of nodes. The plurality of operation nodes are connected to form a network topology. An aggregated parameter is generated by merging local parameters calculated in each of the plurality of operation nodes in accordance with the network topology.

Abstract: Techniques are provided for use in an auction in which selected content items, or advertisements, of content providers, or advertisers, are selected and served, and in which, for an item served in response to a serving opportunity, contingent upon occurrence of a specified user action, an associated provider's account is charged a first sum and an associated publisher's account is credited a second sum. Performance of particular content items may be explored, such as ones for which little or no historical performance information may be available. Content item selection may be based at least in part on an objective of acquiring learning information that can be used in prediction of future performance of the content item. The associated provider's account may be charged a sum that reflects a learning value component, but the associated publisher's account may be credited a sum that does not reflect a learning value component.

Abstract: An actuator comprises an actuator output shaft, a rotatable lock formation associated with the output shaft so as to be axially fixed relative thereto, the lock formation defining an entry passage, a lock pocket and an exit passage, a pin positioned for movement relative to the lock formation such that, as the actuator approaches a fully extended position, a part of the pin is received within and passes along the entry passage, and resilient detent means operable such that, once the pin has moved beyond a predetermined position within the entry passage, the resilient detent means prevents return movement of the pin along the entry passage.

Abstract: An actuator comprises an actuator shaft mounted for rotation by a drive shaft, releasable lock means operable to restrict axial movement of the actuator shaft relative to the drive shaft, and an output member co-operating with the actuator shaft such that rotation of the actuator shaft drives the output member for translating movement relative to the actuator shaft.

Abstract: Embodiments are directed towards employing an admission controller (AC) network device to coordinate voluntary requests by traffic source devices (TSDs) to transmit traffic over a network. The TSDs submit voluntary requests to transmit network traffic during an allocated time frame to the AC. The AC monitors historical network traffic data and, based on various allocation policies, provides permission to at least some of the TSDs in the form of a nonexclusive lease of bandwidth with a rate cap for an allocated time frame. The TSDs receiving the lease voluntarily agree to transmit traffic not exceeding the rate cap for the time frame of the lease. TSDs that receive a zero rate cap voluntarily agree not to transmit. However, urgent network traffic bypasses the AC. The allocation policies used to determine the rate cap and number of permitted senders include a reactive approach, a predictive approach, and a predictive-reactive approach.