Inspired by “Google Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given a query consisting of a few atoms from that concept. We formulate this as a within-network relational learning problem using few labels only and describe an algorithm that ranks atoms using a score based on random walks wit...

Supplemental Materials Yipeng Qin Hongchuan Yu Jianjun Zhang National Centre for Computer Animation, Bournemouth University, UK 1 RWR Performance Verification To verify that the proposed RWR procedure effectively reduces memory cost, this section compares memory costs against nearest distance dmin(wn) of the wavefront between two variants of the Voronoi diagram construction: with and without RW...

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball. Collisions occur when a ball is placed in an urn which already contains a ball of different color. Equivalently, this can be viewed as sequentially coloring a ...

Roller bearing is one of the most widely used and critical elements in rotating machinery. In consequence, bearing fault diagnosis in machines, as well as to discriminate the different fault conditions have been a great interest. In this study, firstly, analytical model of a shaft-ball bearing system is developed. The shaft is assumed to be perfectly rigid and uniform, and supported by two radi...

Players in American football must be able to competently and quickly intercept and tackle an opponent who has the ball. We developed a mathematical model that describes the use of a constant target-heading angle between the pursuer and ball carrier. We found that players in American football maintained a constant target-heading angle across changes in initial angle, direction, and speed of the ...

Suppose we sequentially put n balls into n bins. If we put each ball into a random bin then the heaviest bin will contain ∼ logn/ log logn balls with high probability. However, Azar, Broder, Karlin and Upfal [SIAM J. Comput. 29 (1999) 180–200] showed that if each time we choose two bins at random and put the ball in the least loaded bin among the two, then the heaviest bin will contain only ∼ l...

Balls-into-bins games describe in an abstract setting several multiple-choice scenarios, and allow for a systematic and unified theoretical treatment. In the process that we consider, there are n bins, initially empty, and m = bcnc balls. Each ball chooses independently and uniformly at random k ≥ 3 bins. We are looking for an allocation such that each ball is placed into one of its chosen bins...