A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-...
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
We show that the consistency of the theory “ZF + DC + Every successor cardinal is regular + Every limit cardinal is singular + Every successor cardinal satisfies the tree prope...
We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated ...
Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi
While the Web Ontology Language (OWL) provides a mechanism to import ontologies, this mechanism is not always suitable. First, given the current state of editing tools and the iss...
A method to learn and reproduce robot force interactions in a Human-Robot Interaction setting is proposed. The method allows a robotic manipulator to learn to perform tasks which ...
Petar Kormushev, Sylvain Calinon, Darwin G. Caldwe...
People often use direct physical contact to guide a person to a desired location (e.g., leading a child by the hand) or to adjust a person’s posture for a task (e.g., a dance in...
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu ...