In this paper parallel algorithms are presented for enumeration and unranking of t–ary trees with n internal nodes. Generation algorithms are designed in the associative computing model ASC that belongs to a broad category of SIMD models. Tree sequences are generated in lexicographical order, with O(1) time per object, in a new representation, as combinations with repetitions with restricted gr...

Representation learning (RL) has recently proven to be effective in capturing local item relationships by modeling item co-occurrence in individual user’s interaction record. However, the value of RL for recommendation has not reached the full potential due to two major drawbacks: 1) recommendation is modeled as a rating prediction problem but should essentially be a personalized ranking one; 2...

Hydrogen-bonding, intrastrand base-stacking, and interstrand base-stacking energies were calculated for RNA and DNA dimers at the MP2(full)/6-311G** level of theory. Standard A-form RNA and B-form DNA geometries from average fiber diffraction data were employed for all base monomer and dimer geometries, and all dimer binding energies were obtained via single-point calculations. The effects of w...

Graph ranking plays an important role in many applications, such as page ranking on web graph and entity ranking on social networks. In the applications, besides graph structure, rich information on nodes and edges and explicit or implicit human supervision are often available. In contrast, conventional algorithms (e.g., PageRank and HITS) compute ranking scores by only resorting to graph struc...

A round-robin political tournament is an election format where multiple candidates contest in pairs, and votes are aggregated using a general rule to form social ranking. We formalize this as strategic game provide necessary sufficient condition under which truthful voting Nash equilibrium. Building on analysis, we study the concept of effective power, defined voter's ability bring about rankin...