Results 71 to 80 of about 4,614 (253)
Soft Skins With Reversible Thickness Morphing: Materials, Mechanisms, and Applications
Evolution of electronic skin (e‐skin) technologies toward adaptive, multifunctional soft skins. Phase I highlights early rigid and discrete sensory interfaces. Phase II shows the transition toward flexible, stretchable, and large‐area e‐skin. Phase III captures the emergence of computational e‐skin.
Oliver Ozioko +2 more
wiley +1 more source
We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source
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 +4 more sources
Transient Cytoskeletal Anisotropy Encodes Short‐Term Mechanical Memory in Glioblastoma Cells
The same mechanical deformation can produce distinct cytoskeletal states depending on loading history. Experiments and constitutive modeling reveal that transient actin–vimentin anisotropy stores mechanical information and governs short‐term mechanical memory in glioblastoma cells.
Clara Gomez‐Cruz +5 more
wiley +1 more source
Modification to Planarity is Fixed Parameter Tractable.
A replacement action is a function L that maps each k-vertex labeled graph to another k-vertex graph. We consider a general family of graph modification problems, called L-Replacement to C, where the input is a graph G and the question is whether it is possible to replace in G some k-vertex subgraph H of it by L(H) so that the new graph belongs to the ...
Fomin, Fedor V. +2 more
openaire +4 more sources
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 +4 more sources
Shape Memory Polymer‐Based Flexible Pressure Sensor for Real‐Time Venous Thrombosis Monitoring
A shape‐memory tubular flexible pressure sensor with a 100‐mesh microstructured SMP‐PLA/MWCNTs sensing layer was developed for PICC‐mounted monitoring of thrombosis‐related pressure changes. The sensor combines high sensitivity (204 kPa−1), a fast response time (28 ms), and conformal catheter fixation and was validated by hydrostatic and ex vivo ...
Yi Chen +7 more
wiley +1 more source
Therapies consisting of a combination of agents are an attractive proposition, especially in the context of diseases such as cancer, which can manifest with a variety of tumor types in a single case.
Drew Mellor +3 more
doaj +1 more source
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
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

