Results 111 to 120 of about 3,689,343 (292)
A chemically defined PEG‐based microgel platform enables scalable, reproducible production of three‐dimensional microgel‐iPSC constructs in multiple sizes. The system is compatible with high‐throughput automation and supports human iPSC expansion and differentiation within a single construct, including directed differentiation into cardiac organoids ...
Laura Klasen +8 more
wiley +1 more source
Fiber‐Format Flexible Linear Electrostatic Motors
A flexible coaxial fibre‐format electrostatic motor enables backdrivable and reversible linear actuation with high force density and functionality under bending, offering a scalable actuation platform for soft and wearable robotics. ABSTRACT Linear motion is fundamental to robotics, yet existing solutions are either rigid electromagnetic motors or ...
Sylvain Schaller, Herbert Shea
wiley +1 more source
Outlier detection using iterative adaptive mini-minimum spanning tree generation with applications on medical data. [PDF]
Li J +5 more
europepmc +1 more source
Minimum Cost Spanning Tree Games and Spillover Stability [PDF]
This paper discusses minimum cost spanning tree games and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws.
Peter Borm +2 more
core
Phase‐Engineered MoS2 Quantum Monolayer Catalysts
A new type of catalyst model—phase‐engineered MoS2 quantum‐monolayer catalyst (∼0.8 nm thick, < 6 nm in the lateral size; switchable freely among metallic 1T, semiconducting 2H, and a hybrid phase of metallic‐semiconducting 1T‐2H)—is reported. It can efficiently and stably drive photochemical H2, syngas and ammonia synthesis as a catalyst or co ...
Ruijie Yang +12 more
wiley +1 more source
A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem. [PDF]
Zhang S, Mao J, Wang N, Li D, Ju C.
europepmc +1 more source
The enumeration of spanning tree of weighted graphs
Jiang Zhou, Changjiang Bu
semanticscholar +1 more source
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core
Minimum cost arborescences [PDF]
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well ...
Dutta, Bhaskar, Mishra, Debasis
core
A Simple Descriptor for Solid‐State Ionic Conductors Across Chemistries
Researchers develop a simple and transferable descriptor, distance contraction, for solid‐state ion migration across Li‐, Na‐, K‐, and Mg‐ion conductors and diverse anion chemistries. By capturing the maximum local contraction experienced by the migrating ion, the descriptor enables rapid materials screening and unifies diverse ion‐transport mechanisms.
Ramanuja Srinivasan Saravanan +4 more
wiley +1 more source

