Abstract: Systems and methods for generating a slate of ranked items are provided. In one example embodiment, a computer-implemented method includes inputting a sequence of candidate items into a machine-learned model, and obtaining, in response to inputting the sequence of candidate items into the machine-learned model, an output of the machine-learned model that includes a ranking of the candidate items that presents a diverse set of the candidate items at the top positions in the ranking such that one or more highly relevant candidate items can be demoted in the ranking.

Abstract: Systems and methods for generating a slate of ranked items are provided. In one example embodiment, a computer-implemented method includes inputting a sequence of candidate items into a machine-learned model, and obtaining, in response to inputting the sequence of candidate items into the machine-learned model, an output of the machine-learned model that includes a ranking of the candidate items that presents a diverse set of the candidate items at the top positions in the ranking such that one or more highly relevant candidate items can be demoted in the ranking.

Abstract: Systems and methods for generating a slate of ranked items are provided. In one example embodiment, a computer-implemented method includes inputting a sequence of candidate items into a machine-learned model, and obtaining, in response to inputting the sequence of candidate items into the machine-learned model, an output of the machine-learned model that includes a ranking of the candidate items that presents a diverse set of the candidate items at the top positions in the ranking such that one or more highly relevant candidate items can be demoted in the ranking.

Abstract: Implementations provide an improved system for presenting search results based on entity associations of the search items. An example method includes, for each of a plurality of crowdsource workers, initiating display of a first randomly selected cluster set from a plurality of cluster sets to the crowdsource worker. Each cluster set represents a different clustering algorithm applied to a set of search items responsive to a query. The method also includes receiving cluster ratings for the first cluster set from the crowdsource worker and calculating a cluster set score for the first cluster set based on the cluster ratings. This is repeated for remaining cluster sets in the plurality of cluster sets. The method also includes storing a cluster set definition for a highest scoring cluster set, associating the cluster set definition with the query, and using the definition to display search items responsive to the query.

Abstract: A novel keyboard interface and input method are described. The interface is driven by a dynamic, general-purpose typing and data-entry software application, with a reduced number of keys to minimize screen real-estate requirements, especially for mobile devices. At any given time, the interface presents base characters with built-in key points on or around the base characters that can be selected and/or swiped to generate characters. The key points are strategically placed based on the intuitiveness of such placements, reducing the curve for learning how to use the interface. Its advantage over other methods of input such as handwriting, voice and gesture recognition is that it is less prone to error and privacy issues. The interface occupies a dramatically smaller area of the screen compared to traditional on-screen keyboards and can provide alternate placement as well as transparency to reveal text or images underneath.

Abstract: Described is an analysis tool/techniques for determining the computational complexity of a computer program, including when the program includes procedures having nested loops and/or multi-path loops. First, multi-path loops are converted into code-fragments consisting of simpler loops via a transformation called control flow refinement. Progress invariants are determined for appropriate locations in the procedure to represent relationships between a state that can arise at that program location and the previous state at that location. A bound finding mechanism (such as one based on pattern matching) is then used to compute loop bounds from progress invariants. These bounds are then composed appropriately to determine a precise bound for the enclosing procedure.

Abstract: The present invention relates to a massaging device and vibrator for providing soothing vibrations to the body of a user. One aspect of the massaging device includes an article of furniture, a vibrator comprised of an electric motor with an eccentric rotor, and means for attaching the vibrator to the article of furniture so that the rotor rotates and induces vibrations in a plane that is parallel to the user contacting surface of the furniture. The vibrator itself is constructed to enable it to be easily attached to articles of furniture that are constructed in various ways from varying materials. A further aspect of the massaging device comprises a pad device having a soft, flexible, upper supporting surface, and a vibrating device with an eccentric rotor mounted in the pad device so that the rotor has an axis of rotation that is generally perpendicular to the upper supporting surface of the pad.