Path queries on a knowledge graph can be used to answer compositional questions such as “What languages are spoken by people living in Lisbon?”. However, knowledge graphs often have missing facts (edges) which disrupts path queries. Recent models for knowledge base completion impute missing facts by embedding knowledge graphs in vector spaces. We show that these models can be recursively applie...

A simple and linear-time algorithm is presented for solving the problem of traversing a machining graph with minimum retractions encountered in zigzag pocket machining and other applications. This algorithm finds a traversal of the machining graph of a general pocket P with Nh holes, such that the number of retractions in the traversal is no greater than OPT þ Nh þ Nr, where OPT is the (unknown...

Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories—the common representation basis for modern pipelined text processing architectures. The open-ended nature of these architectures and expressiveness of feature structure-based annotation schemes account for the natural tendency of such annotat...

For those fascinated by cell biology, it can be delightful to imagine shrinking to the size of a bacterium to become, in Christian du Duve’s word, a cytonaut, a tiny explorer inside the labyrinth of the cell. But there’s a hitch: the cytoplasm of a cell is no swimming pool. It is instead crowded and viscous, with globular proteins and tangles of fibers forming a sticky gel that neither the imag...

The medium that forms in a heavy-ion collision modifies the properties of jets traversing it. These modifications give substantial information about nature and, therefore, they are one main focuses program at LHC. influence into highly energetic partons depends on correlators Wilson lines, which have been studied perturbation theory and several phenomenological models. Here, we focus antenna co...