Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Connie Wu

dblp:33/5146 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Human-computer interaction and pervasive computing
1 paper
Haptics and multimodal interaction · 91% Immersive interaction · 9%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 75% Information retrieval · 25%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Haptics and multimodal interaction
haptic feedback
0.212016
Comparison of kinesthetic and skin deformation feedback for mass rendering · ICRA 2016
Haptics and multimodal interaction
haptic rendering
0.212016
Comparison of kinesthetic and skin deformation feedback for mass rendering · ICRA 2016
Haptics and multimodal interaction › haptic feedback
skin deformation feedback
0.212016
Comparison of kinesthetic and skin deformation feedback for mass rendering · ICRA 2016
Immersive interaction
virtual reality
0.112016
Comparison of kinesthetic and skin deformation feedback for mass rendering · ICRA 2016
Indexing and storage engines › b-tree
b-tree variants
0.011985
P-Trees: Storage Efficient Multiway Trees · SIGIR 1985
Information retrieval › indexing
index compression
0.011985
P-Trees: Storage Efficient Multiway Trees · SIGIR 1985
Indexing and storage engines › tree structures
multiway tree
0.011985
P-Trees: Storage Efficient Multiway Trees · SIGIR 1985
Indexing and storage engines › storage management
storage utilization
0.011985
P-Trees: Storage Efficient Multiway Trees · SIGIR 1985

Methods — techniques the papers use, named apart from their topics

psychophysical experiment · 0.2method of adjustments · 0.2insertion algorithm · 0.0
YearPublicationVenuePosition
2016 Comparison of kinesthetic and skin deformation feedback for mass rendering
abstract
Virtual and augmented reality systems that immerse users in a 3D environment could benefit from haptic (force and/or tactile) feedback to increase realism and task performance. A canonical task that cannot be achieved compellingly without haptic feedback is the grasp and lift of an object with mass. Traditional kinesthetic (force) feedback devices provide realistic physical interactions with virtual objects, but typically require large actuators, making them bulky and encumbering. In contrast, tactile feedback devices can use smaller actuators and may enable freer movement of a user in a virtual world. One form of tactile feedback, skin deformation feedback, has been previously shown to provide effective haptic feedback of force, stiffness, and friction. Here we compare human perception of mass via kinesthetic feedback and skin deformation feedback in a virtual environment. Participants grasp and lift two virtual blocks and attempt to equalize their masses by the method of adjustments. From the accuracy of this equalization, we determined that the Weber Fraction (the just noticeable difference in proportion to the original stimulus value) of virtual mass during a grasp and lift task was 0.11 for kinesthetic force feedback and 0.35 for skin deformation feedback. In addition, participants exhibited differences in exploratory procedures between the two types of feedback.
Jacob M. Suchoski, Aaron C. Barron, Connie Wu, Zhan Fan Quek, Sean J. Keller, Allison M. Okamura
ICRA3
1985 P-Trees: Storage Efficient Multiway Trees
abstract
A new variation of high order multiway tree structures, the P-tree is presented. P-trees have average access costs that are significantly better than those of B-trees and are no worse (and often better) in storage utilization. Unlike compact B-trees, they can be maintained dynamically, and unlike dense multiway trees and B-trees, their associated insertion algorithm, which is also presented, is cheap and involves (at most) a very localized rearrangement of keys.
David M. Arnow, Aaron M. Tenenbaum, Connie Wu
SIGIR3