Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- abstractMarch 2017
Participatory Design: Repositioning, Transferring, and Personal Care Robots
HRI '17: Proceedings of the Companion of the 2017 ACM/IEEE International Conference on Human-Robot InteractionPages 351–352https://doi.org/10.1145/3029798.3034815In our ongoing survey, we examine the feedback of robotic aids that increases independence of persons with physical disabilities. Participants are asked to evaluate the perceived pros and cons of prototypes for repositioning, transferring, and personal ...
- posterAugust 2015
FALE: Fine-grained Device Free Localization that can Adaptively work in Different Areas with Little Effort
SIGCOMM '15: Proceedings of the 2015 ACM Conference on Special Interest Group on Data CommunicationPages 601–602https://doi.org/10.1145/2785956.2790020Many emerging applications and the ubiquitous wireless signals have accelerated the development of Device Free localization (DFL) techniques, which can localize objects without the need to carry any wireless devices. Most traditional DFL methods have a ...
Also Published in:
ACM SIGCOMM Computer Communication Review: Volume 45 Issue 4 - posterApril 2014
Poster abstract: Implications of target diversity for organic device-free localization
IPSN '14: Proceedings of the 13th international symposium on Information processing in sensor networksPages 279–280Device-free localization (DFL) plays an important role in many applications, such as the intrusion detection. Most traditional DFL systems assume a fixed distribution of the received signal strength (RSS) changes even they are distorted by different ...
- articleMay 2007
On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
Mathematics of Operations Research (MOOR), Volume 32, Issue 2Pages 266–283https://doi.org/10.1287/moor.1060.0239A deterministic server is shared by users with identical linear waiting costs, requesting jobs of arbitrary lengths. Shortest jobs are served first for efficiency. The server can monitor the length of a job but not the identity of the job's user, thus ...
