Results 21 to 30 of about 130 (129)
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source
Heuristically Adaptive Diffusion‐Model Evolutionary Strategy
Building on the mathematical equivalence between diffusion models and evolutionary algorithms, researchers demonstrate unprecedented control over evolutionary optimization through conditional diffusion. By training diffusion models to associate parameters with specific traits, they can guide evolution toward solutions exhibiting desired behaviors ...
Benedikt Hartl +3 more
wiley +1 more source
Solid Harmonic Wavelet Bispectrum for Image Analysis
The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown +3 more
wiley +1 more source
Hierarchical Artificial Muscle with Nonlinear Elasticity for Antagonistic and Cyclic Robotics
We construct hierarchical muscles by plying nylon fibers around a heating wire. The hierarchical muscle shows a J‐shaped passive curve, which shows benefit in antagonistic muscle pair and work accumulation mechanism. We also develop a computational, first‐principle model to understand the physics of both active actuation stroke and passive J‐curve ...
Samuel Tsai +15 more
wiley +1 more source
A probabilistic framework based on random time‐space coding metasurfaces enables control of the spatial distribution of electromagnetic fields temporal statistics. By tailoring the marginal and joint distributions of random codes, electromagnetic fields with desired mean and variance patterns are realized, enabling simultaneous transmission and jamming.
Jia Cheng Li +3 more
wiley +1 more source
PAIR: Reconstructing Single‐Cell Open‐Chromatin Landscapes for Transcription Factor Regulome Mapping
scATAC‐seq analysis is often constrained by limited sequencing depth, extreme sparsity, and pervasive technical missingness. PAIR is a probabilistic framework that restores scATAC‐seq accessibility profiles by directly modeling the native cell–peak bipartite structure of chromatin accessibility.
Yanchi Su +7 more
wiley +1 more source
Conformal Reconfigurable Intelligent Surfaces: A Cylindrical Geometry Perspective
Cylindrical reconfigurable intelligent surfaces are explored for low‐complexity beam steering using one‐bit meta‐atoms. A multi‐level modeling approach, including optimization‐based synthesis, demonstrates that even minimal hardware can support directive scattering.
Filippo Pepe +4 more
wiley +1 more source
Topological Materials and Related Applications
This review covers topological materials—including topological insulators, quantum valley Hall and quantum spin Hall insulators, and topological Weyl and Dirac semimetals—as well as their most recent advancements in fields such as spintronics, electronics, photonics, thermoelectrics, and catalysis.
Carlo Grazianetti +9 more
wiley +1 more source
Trust‐region filter algorithms utilizing Hessian information for gray‐box optimization
Abstract Optimizing industrial processes often involves gray‐box models that couple algebraic glass‐box equations with black‐box components lacking analytic derivatives. Such systems challenge derivative‐based solvers. The classical trust‐region filter (TRF) algorithm provides a robust framework but requires extensive parameter tuning and numerous ...
Gul Hameed +4 more
wiley +1 more source
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source

