Results 121 to 130 of about 982,672 (306)
Engineered red blood cell‐derived extracellular vesicles (eRBCEVs) are synthesized via controlled microfluidic assembly from native RBC lipids, enabling tunable encapsulation of proteins, nucleic acids, nanoparticles, and viral vectors. The platform demonstrates reproducible nanoscale architecture, preserved membrane composition, and functional cargo ...
Chiranth K. Nagaraj +23 more
wiley +1 more source
On Vertex Magic 3-Regular Graphs with a Perfect Matching
Let G=(V,E) be a finite simple graph with p=|V| vertices and q=|E| edges, without isolated vertices or isolated edges. A vertex magic total labeling is a bijection f from V∪E to the consecutive integers 1,2,…,p+q, with the property that, for every vertex
Tao-Ming Wang
doaj +1 more source
NeuroVisio SyncPatch integrates skin‐conformal electromyography (EMG) electrodes with camera‐tracked markers to jointly assess muscle activity and three‐dimensional knee kinematics during rehabilitation. Parallel feedback pathways provide real‐time kinematic guidance during movement and post‐trial neuromuscular feedback.
Bohyung Choi +11 more
wiley +1 more source
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Borel fractional perfect matchings in quasi-transitive amenable graphs [PDF]
We show that if a locally finite Borel graph with quasitransitive amenable components admits a fractional perfect matching, it will admit a Borel fractional perfect matching.
Murray, Sam
core +3 more sources
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect matching, the solution to the problem is the entire graph.
Stavros D. Nikolopoulos, Leonidas Palios
core
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source
Another mathematical optimization models based on assignment problem [PDF]
This contribution is presenting the concrete possibilities of applying the mathematical optimization model based on the graph theory. Method of creating at hematical model for the perfect matching optimized in a special way is described in this paper ...
Ladislav Mixtaj +3 more
doaj
Matching Heterogeneous Agents with a Linear Search Technology [PDF]
Steady state equilibria in heterogeneous agent matching models with search frictions have been shown to exist in Shimer and Smith (2000) under the assumption of a quadratic search technology.
Thomas Tröger, Georg Nöldeke
core
Why Is the Mechanism Underlying the Chiral‐Induced Selectivity Effect Still Challenging?
The chiral‐induced spin selectivity (CISS) effect is observed in many experimental configurations and for different materials. However, there are theoretical challenges in attempting to explain those results. A qualitative framework for explaining all the results is presented.
Ron Naaman, Yossi Paltiel
wiley +1 more source

