Results 91 to 100 of about 184,015 (290)
This review examines passive, active, and hybrid liquid manipulation strategies, highlighting hybrid approaches as an emerging route to reconcile energy efficiency with adaptive control. By actively reconstructing passive surfaces to store programmable interfacial energy, hybrid systems enable flexible yet low‐power liquid transport, with perspectives ...
Jiaqi Miao +3 more
wiley +1 more source
Classification of index partitions to boost XML query performance [PDF]
XML query optimization continues to occupy considerable research effort due to the increasing usage of XML data. Despite many innovations over recent years, XML databases struggle to compete with more traditional database systems. Rather than using node
Marks, Gerard +4 more
core +2 more sources
Additively manufactured triply periodic minimal surface (TPMS) membranes offer an architecture‐driven alternative to hollow fiber bundles in artificial lungs. Multiphysics simulations and endothelialized prototypes show that the 3D‐printable membrane architecture improves gas exchange, blood flow distribution, and hemocompatibility, enabling ...
Michael Pflaum +14 more
wiley +1 more source
Measures and generalizations of dual Littlewood identities
We introduce three families of vectors |λ―so⟩ $|\underline {\lambda }^{so}\rangle $ vertical bar lamda underbar Superscript s o Baseline right angle bracket , |λ―sp⟩ $|\underline {\lambda }^{sp}\rangle $ vertical bar lamda underbar Superscript s
Zhongren Cai +4 more
doaj +1 more source
Plane partition realization of (web of) W $$ \mathcal{W} $$ -algebra minimal models
Recently, Gaiotto and Rapčák (GR) proposed a new family of the vertex operator algebra (VOA) as the symmetry appearing at an intersection of five-branes to which they refer as Y algebra.
Koichi Harada, Yutaka Matsuo
doaj +1 more source
Cutwidth Bounds via Vertex Partitions
14 pages including appendix.
Amarilli, Antoine, Groz, Benoît
openaire +4 more sources
Boosting Vertex-Cut Partitioning for Streaming Graphs
While the algorithms for streaming graph partitioning are proved promising, they fall short of creating timely partitions when applied on large graphs. For example, it takes 415 seconds for a state-of-the-art partitioner to work on a social network graph with 117 millions edges.
Hooman Peiro Sajjad +4 more
openaire +3 more sources
The deposition of Iron on pristine MoS2/Au(111) monolayers produces nanoparticles that donate charge to the support, generating Fe+2‐interfacial species. On the contrary, on defect‐engineered MoS2, sulfur vacancies trap sub‐nanometric Fe clusters and host two excess electrons that redistribute locally, suppressing Fe oxidation without formal Mo ...
Marco Nalesso +10 more
wiley +1 more source
Splitting Plane Graphs to Outerplanarity
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often planarity, for ...
Martin Gronemann +2 more
doaj +1 more source
Weighted Partition Vertex and Edge Cover
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collecting Partition Vertex Cover} (WP-PVC) problem: given a graph with weights on both vertices and edges, and a partition of the edge set into $ω$ groups, the goal is to select a ...
Rajni Dabas +2 more
openaire +3 more sources

