Abstract: Data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. The present disclosure provides a Distributed Accelerated Semiring All-Pairs Shortest Path (DSNAPSHOT) algorithm for computing shortest paths of a knowledge graph using distributed-memory parallel computers accelerated by GPUs. DSNAPSHOT implementations can analyze connected input graphs with millions of vertices using a large number graphics processing units (e.g., the 24,576 GPUs of the Oak Ridge National Laboratory's Summit supercomputer system). DSNAPSHOT provides sustained performance of about 136*1015 floating-point operations per second (136 petaflop/s) at a parallel efficiency of about 90% under weak scaling and, in absolute speed, 70% of the performance given our computation (in the single-precision tropical semiring or “min-plus” algebra).

Abstract: An online game mechanic matches requests and responses of different data types that include text, image and audio. Request values corresponding to a first data type are sent to users in a distribution list, and those users send response values corresponding to a second data type. Winning response values are selected and announced.

Abstract: An online game mechanic matches requests and responses of different data types that include text, image and audio. Request values corresponding to a first data type are sent to users in a distribution list, and those users send response values corresponding to a second data type. Winning response values are selected and announced.

Abstract: An online game mechanic matches requests and responses of different data types that include text, image and audio. Request values corresponding to a first data type are sent to users in a distribution list, and those users send response values corresponding to a second data type. Winning response values are selected and announced. In an example embodiment, the request values include a text description that includes at least one word, and the response values include an image file or a reference to an image file.

Abstract: A player-matching mechanic selects users for an online asynchronous game where players specify moves at different times. Values from instances of the game are used to determine characteristics of the users including at least one of gameplay characteristics or chat characteristics. Users can be chosen for instances of the game by comparing values corresponding to these characteristics.

Abstract: A player-matching mechanic selects users for an online asynchronous game where players specify moves at different times. Values from instances of the game are used to determine characteristics of the users including at least one of gameplay characteristics or chat characteristics. Users can be chosen for instances of the game by comparing values corresponding to these characteristics.

Abstract: A player-matching mechanic selects users for an online asynchronous game where players specify moves at different times. Values from instances of the game are used to determine characteristics of the users including at least one of gameplay characteristics or chat characteristics. Users can be chosen for instances of the game by comparing values corresponding to these characteristics.

Abstract: An online game mechanic matches requests and responses of different data types that include text, image and audio. Request values corresponding to a first data type are sent to users in a distribution list, and those users send response values corresponding to a second data type. Winning response values are selected and announced. In an example embodiment, the request values include a text description that includes at least one word, and the response values include an image file or a reference to an image file.

Abstract: A player-matching mechanic selects users for an online asynchronous game where players specify moves at different times. Values from instances of the game are used to determine characteristics of the users including at least one of gameplay characteristics or chat characteristics. Users can be chosen for instances of the game by comparing values corresponding to these characteristics.

Abstract: A player-matching mechanic selects users for an online asynchronous game where players specify moves at different times. Values from instances of the game are used to determine characteristics of the users including at least one of gameplay characteristics or chat characteristics. Users can be chosen for instances of the game by comparing values corresponding to these characteristics.

Abstract: A player-matching mechanic selects users for an online asynchronous game where players specify moves at different times. Values from instances of the game are used to determine characteristics of the users including at least one of gameplay characteristics or chat characteristics. Users can be chosen for instances of the game by comparing values corresponding to these characteristics.