Results 71 to 80 of about 73,753 (309)
Milled polycrystalline NMC811 cathode (MPC NMC) with smaller secondary particle and higher surface area had 1) greater cathode tortuosity, 2) reduced surface Ni on the cycled MPC cathodes consistent with surface reconstruction, and 3) increased Ni deposition from cathode‐anode crosstalk, manifesting in lower functional capacity and higher impedance ...
Edelmy J. Marin Bernardez +22 more
wiley +1 more source
Flexible sweat sensor patch integrating graphene‑interfaced gold microelectrodes functionalized with bio‑receptors and ion‑selective membrane, coupled with a capillary‑driven microfluidic layer and portable potentiostat electronics for multiplexed monitoring of inflammatory, metabolic, and electrolyte biomarkers in microliter sweat volumes.
Roomia Memon +4 more
wiley +1 more source
Polynomial Time and Parameterized Approximation Algorithms for Boxicity [PDF]
The boxicity (cubicity) of a graph G, denoted by box(G) (respectively cub(G)), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (cubes) in ℝk. The problem of computing boxicity (cubicity) is known to be inapproximable in polynomial time even for graph classes like bipartite, co-bipartite and split
Adiga, Abhijin +2 more
openaire +2 more sources
Hard‐Magnetic Soft Millirobots in Underactuated Systems
This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang +4 more
wiley +1 more source
A Polynomial Time Algorithm for Unidimensional Unfolding Representations
Summary: Two conditions on a collection of simple orders -- unimodality and straightness -- are necessary but not jointly sufficient for unidimensional unfolding representations. From the analysis of these conditions, a polynomial time algorithm is derived for the testing of unidimensionality and for the construction of a representation when one exists.
Doignon, Jean-Paul +1 more
openaire +3 more sources
Polynomial Time Algorithms for Tracking Path Problems [PDF]
AbstractGiven a graphG, and terminal verticessandt, theTracking Pathsproblem asks to compute a set of minimum number of vertices to be marked as trackers, such that the sequence of trackers encountered in each$$s$$s-$$t$$tpath is unique.Tracking PathsisNP-hard in both directed and undirected graphs in general.
openaire +4 more sources
Embedded flexible sensing technologies advance underwater soft robotics, yet most systems still suffer from hysteresis and limited perceptiveness. Instead, vision‐based tactile sensors provide reliable and rapid feedback essential for complex underwater tasks.
Qiyi Zhang +5 more
wiley +1 more source
Parametric Polynomial Time Perceptron Rescaling Algorithm
Let us consider a linear feasibility problem with a possibly infinite number of inequality constraints posed in an on-line setting: an algorithm suggests a candidate solution, and the oracle either confirms its feasibility, or outputs a violated ...
Kharechko, Andriy
core
Pak Biawak, a necrobot, embodies an unusual fusion of biology and robotics. Designed to repurpose natural structures after death, it challenges conventional boundaries between nature and engineering. Its movements are precise yet unsettling, raising questions about sustainability, ethics, and the untapped potential of biointegrated machines.
Leo Foulds +2 more
wiley +1 more source
Robot Time-Optimal Trajectory Planning Based on Improved Cuckoo Search Algorithm
The trajectory planning time is uncertain when there is no velocity constraint in the joint space of an operating robot. This paper proposes a 3-5-3 polynomial interpolation trajectory planning algorithm based on improved cuckoo search algorithm (ICS ...
Wenjie Wang +4 more
doaj +1 more source

