Results 71 to 80 of about 5,303 (261)
Numerical Modeling of Photothermal Self‐Excited Composite Oscillators
We present a numerical framework for simulating photothermal self‐excited oscillations. The driving mechanism is elucidated by highlighting the roles of inertia and overshoot, as well as the phase lag between the thermal moment and the oscillation angle, which together construct the feedback loop between the system state and the environmental stimulus.
Zixiao Liu +6 more
wiley +1 more source
Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization
The complexity of agent localization increases significantly when unique identification of the agents is not possible. Corresponding application cases include multiple-source localization, in which the agents do not have identification sequences at all ...
Stephan Schlupkothen +2 more
doaj +1 more source
This work presents a robotic control method for human–robot collaborative assembly based on a biomechanics‐constrained digital human model. Reinforcement learning is used to generate physiologically plausible human motion trajectories, which are integrated into a virtual environment for robot control learning.
Bitao Yao +4 more
wiley +1 more source
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Robert Bredereck +5 more
doaj +1 more source
Almost 2-SAT is fixed-parameter tractable
We consider the following problem. Given a 2-CNF formula, is it possible to remove at most $k$ clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to different research communities in Theoretical Computer Science under the names 'Almost 2-SAT', 'All-but-$k$ 2-SAT', '2-CNF deletion', '2-SAT deletion'.
Igor Razgon, Barry O'Sullivan
openaire +5 more sources
Fixed-Parameter Tractable Distances to Sparse Graph Classes [PDF]
We show that for various classes C$$\mathcal {C}$$ of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C$$\mathcal {C}$$ is fixed-parameter tractable. The results are based on two general techniques.
Jannis Bulian, Anuj Dawar
openaire +6 more sources
A flexible, skin‐integrated electromagnetic actuator is developed for wearable virtual/augmented reality (VR/AR) haptic systems. A tunable design model enables control over displacement and resonance frequency. The system is validated through a custom VR application with a 6 × 4 actuator array, demonstrating real‐time, spatially targeted tactile ...
Naji Tarabay +9 more
wiley +1 more source
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
Background We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions.
Niedermeier Rolf +4 more
doaj +1 more source
Mutual Adaptation and Influence: Review of Latent Dynamics Models in Human–Robot Interaction
Robots are becoming better teammates by learning hidden patterns in how people act. This review covers how state‐of‐the‐art approaches leverage these patterns to help robots not only react but also anticipate and guide cooperation. Here, we synthesize a unifying framework for these approaches, classify and review existing works, and highlight key ...
Mason O. Smith +4 more
wiley +1 more source
Bounded-Degree Cut is Fixed-Parameter Tractable
ICALP ...
Mingyu Xiao 0001, Hiroshi Nagamochi
openaire +3 more sources

