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

Xuezhen Wang

dblp:42/3483 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
3since 2021 · last 2024
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 61% Approximation and online algorithms · 30% Algorithms and data structures · 9%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 77% User interface design and tools · 23%

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

TopicWeightPapersLastEvidence papers
Human-robot interaction › teleoperation
teleoperation interface
0.812024
Asynchronously Assigning, Monitoring, and Managing Assembly Goals in Virtual Reality for High-Level Robot Teleoperation · VR 2024
Approximation and online algorithms
facility location
0.712023
Multi-Stage Facility Location Problems with Transient Agents · AAAI 2023
Algorithmic game theory and mechanism design
mechanism design
0.712023
Multi-Stage Facility Location Problems with Transient Agents · AAAI 2023
Algorithmic game theory and mechanism design › mechanism design
truthful mechanism
0.712023
Multi-Stage Facility Location Problems with Transient Agents · AAAI 2023

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

user study · 0.86dof pose specification · 0.8polynomial-time algorithm · 0.7first-come-first-serve ordering · 0.7XP algorithm · 0.7
YearPublicationVenuePosition
2024 Asynchronously Assigning, Monitoring, and Managing Assembly Goals in Virtual Reality for High-Level Robot Teleoperation
abstract
We present a prototype virtual reality user interface for robot teleoperation that supports high-level specification of 3D object positions and orientations in remote assembly tasks. Users interact with virtual replicas of task objects. They asynchronously assign multiple goals in the form of 6DoF destination poses without needing to be familiar with specific robots and their capabilities, and manage and monitor the execution of these goals. The user interface employs two different spatiotemporal visualizations for assigned goals: one represents all goals within the user’s workspace (Aggregated View), while the other depicts each goal within a separate world in miniature (Timeline View). We conducted a user study of the interface without the robot system to compare how these visualizations affect user efficiency and task load. The results show that while the Aggregated View helped the participants finish the task faster, the participants preferred the Timeline View.
Shutaro Aoyama, Jen-Shuo Liu, Portia Wang, Shreeya Jain, Xuezhen Wang, Jingxi Xu 0002, Shuran Song, Barbara Tversky, Steven K. Feiner
VR5
2023 Multi-Stage Facility Location Problems with Transient Agents
abstract
We study various models for the one-dimensional multi-stage facility location problems with transient agents, where a transient agent arrives in some stage and stays for a number of consecutive stages. In the problems, we need to serve each agent in one of their stages by determining the location of the facility at each stage. In the first model, we assume there is no cost for moving the facility across the stages. We focus on optimal algorithms to minimize both the social cost objective, defined as the total distance of all agents to the facility over all stages, and the maximum cost objective, defined as the max distance of any agent to the facility over all stages. For each objective, we give a slice-wise polynomial (XP) algorithm (i.e., solvable in m^f(k) for some fixed parameter k and computable function f, where m is the input size) and show that there is a polynomial-time algorithm when a natural first-come-first-serve (FCFS) order of agent serving is enforced. We then consider the mechanism design problem, where the agents' locations and arrival stages are private, and design a group strategy-proof mechanism that achieves good approximation ratios for both objectives and settings with and without FCFS ordering. In the second model, we consider the facility's moving cost between adjacent stages under the social cost objective, which accounts for the total moving distance of the facility. Correspondingly, we design XP (and polynomial time) algorithms and a group strategy-proof mechanism for settings with or without the FCFS ordering.
Xuezhen Wang, Vincent Chau, Hau Chan, Ken C. K. Fong, Minming Li
AAAI1
2023 Interval stability/stabilization of impulsive positive systems
Xuezhen Wang, Huasheng Zhang, Jianwei Xia, Wei Sun 0020, Guangming Zhuang
Sci. China Inf. Sci.1
2015 Multimode crystal oscillator for power management unit with digitally controlled AGC loop in 0.18μm CMOS technology
abstract
In this paper, a novel multimode crystal oscillator approach is proposed for a Power Management Unit (PMU). It consists of a digitally controlled Automatic Gain Control (AGC) loop allowing multiple power modes to meet the system's low phase noise and power consumption requirements. A new technique with a programmable switched capacitor array controlled by a counter is presented preserving the integrity of the clock during the mode transition. A 32.768 kHz crystal oscillator using the proposed idea was fabricated in a 0.18 μm CMOS technology. Measurement results show that it achieves phase noise of -120 dBc/Hz at 1 kHz offset in normal operating mode and only consumes 860nA current off 3.3V backup battery in RTC-only (low-power) mode including all the digital supporting circuitry. It also shows the seamless transition between the operating modes.
Xuezhen Wang, Russell E. Radke, Jay E. Ackerman, Michael Baker
ISCAS1
2000 Adaptive learning control for nonminimum phase systems
abstract
A novel adaptive learning algorithm is presented for the repetitive tracking control of a class of unstable nonminimum phase systems. After each repetitive trial, a least squares method is used to estimate the system parameters. The output tracking error and the identified system model are used through stable inversion to find the feed forward input, together with the desired state trajectories for the next trial. An adaptive backstepping based tracking controller is used in each trial to ensure the regulation of the desired state trajectories. Simulation results demonstrate that the proposed learning control scheme is very effective in reproducing the desired trajectories.
Xuezhen Wang, Degang Chen 0001
SMC1