Transductive learning considers a training set of m labeled samples and a test set of u unlabeled samples, with the goal of best labeling that particular test set. Conversely, inductive learning considers a training set of m labeled samples drawn iid from P (X,Y ), with the goal of best labeling any future samples drawn iid from P (X). This comparison suggests that transduction is a much easier...

The general impossibility of jointly implementing arbitrary sets of measurements is a fundamental feature of quantum theory. Indeed, it is a key ingredient that enables a demonstration of the nonclassicality of quantum theory in proofs of Bell’s theorem [1] and the Kochen-Specker theorem [2]. A finite set of measurements is called jointly measurable or compatible if there exists a single measur...

Numerous research groups are now utilizing Basic Formal Ontology (BFO) as an upper-level framework to assist in the organization and integration of biomedical and other types of information. In this paper, we attempt to elucidate the categories of role, disposition, function, and capability in BFO by means of definitions and examples. We also discuss tendency as one variety of disposition, and ...

Hand synergies, or joint coordination patterns, have become an effective tool for achieving versatile robotic grasping with simple hands or planning algorithms. Here we propose a method to determine the hand synergies such that they can be physically implemented in an underactuated fashion. Given a kinematic hand model and a set of desired grasps, our algorithm optimizes a Mechanically Realizab...

We consider PAC learning of probability distributions (a.k.a. density estimation), where we are given an i.i.d. sample generated from an unknown target distribution, and want to output a distribution that is close to the target in total variation distance. Let F be an arbitrary class of probability distributions, and let F denote the class of k-mixtures of elements of F . Assuming the existence...

Incomplete or pruned k-ary n-cube, nX3; is derived as follows. All links of dimension n 1 are left in place and links of the remaining n 1 dimensions are removed, except for one, which is chosen periodically from the remaining dimensions along the intact dimension n 1: This leads to a node degree of 4 instead of the original 2n and results in regular networks that are Cayley graphs, provided th...

A weaving is a number of lines drawn in the plane so that no three lines intersect at a point, and the intersections are drawn so as to show which of the two lines is above the other. For each integer n 4 we construct a weaving of n lines, which is not realizable as a projection of a number of lines in 3-space, all of whose subfigures are realizable as such projections. © 2005 Elsevier B.V. All...