Results 81 to 90 of about 29,853 (260)
Objectives: The accuracy of malaria rapid diagnostic tests is threatened by Plasmodium falciparum with pfhrp2/3 deletions. This study compares gene deletion prevalence determined by multiplex real time polymerase chain reaction (qPCR) and conventional ...
Michelle L. Gatton +9 more
doaj +1 more source
Twin Crystal Moiré Metasurfaces for Crossing Flat‐Band Transport
This study introduces twin crystal moiré metasurfaces, breaking in‐plane symmetry to enable reconfigurable acoustic wave manipulation. By adjusting the twin angle and interlayer twist angle, various combinations of hyperbolic, flat bands, and elliptic states can be synthesized in the system.
Shida Fan +9 more
wiley +1 more source
Unmanned aerial vehicles (UAVs) have become a tool for solving numerous practical tasks. UAV sensors provide images and videos for on-line or off-line data processing for object localization, classification, and tracking due to the use of trained ...
Rostyslav Tsekhmystro +2 more
doaj +1 more source
A robust plant protein adhesive was prepared by fabricating a bi‐continuous organic–inorganic hybrid structure. Compared with traditional organic–inorganic hybrid adhesives, the addition amount of inorganic phase is increased from 0.2%–3.0% to 50%, and the strength and toughness are increased by 6 and 121 times, respectively.
Zheng Liu +10 more
wiley +1 more source
The stable marriage problem with master preference lists [PDF]
We study variants of the classical stable marriage problem in which the preferences of the men or the women, or both, are derived from a master preference list.
Sandy Scott +8 more
core +1 more source
Almost-perfect colorful matchings in three-edge-colored bipartite graphs
We prove that, for positive integers $n,a_1, a_2, a_3$ satisfying $a_1+a_2+a_3 = n-1$, it holds that any bipartite graph $G$ which is the union of three perfect matchings $M_1$, $M_2$, and $M_3$ on $2n$ vertices contains a matching $M$ such that $|M\cap M_i| =a_i$ for $i= 1,2,$ and $3$. The bound $n-1$ on the sum is best possible in general. Our result
Boyadzhiyska, Simona +2 more
openaire +2 more sources
It is well-known that the number of non-crossing perfect matchings of $2k$ points in convex position in the plane is $C_k$, the $k$th Catalan number. García, Noy, and Tejel proved in 2000 that for any set of $2k$ points in general position, the number of such matchings is at least $C_k$. We show that the equality holds only for sets of points in convex
openaire +2 more sources
This study investigates the M13 bacteriophage as a biomimetic nanovector capable of crossing in vitro models of the blood–brain barrier. By exploiting peculiar transcellular pathways, M13 avoids lysosomal degradation and preserves its structural integrity and functionality.
Silvia Vercellino +12 more
wiley +1 more source
Conditional matching preclusion for hypercube-like interconnection networks
The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is ...
Son, Sang Hyuk, Park, Jung-Heum
core +1 more source
Continuous and discrete Clebsch variational principles [PDF]
18.02.14 Kb.
Cotter, CJ, Holm, DD
core +1 more source

