Results 101 to 110 of about 973,826 (351)
Advanced Healthcare Materials, EarlyView.This work introduces a “cancer‐in‐a‐well” technology that recreates tumor heterogeneity in vitro using multitype spheroid arrays. Combining bioprinting/microdispensing with microstructured culture devices, the system improves drug screening and modeling of tumor complexity.
Simone Bonetti +10 more
wiley +1 more source
Decomposing Berge graphs and detecting balanced skew partitions [PDF]
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core
Reconstructibility and perfect graphs
Discrete Mathematics, 1983 AbstractIt is shown that the following classes of graphs are recognizable (i.e. looking at the point-deleted subgraphs of a graph G one can decide whether G belongs to that class or not): (1) perfect graphs, (2) triangulated graphs, (3) interval graphs, (4) comparability graphs, (5) split graphs.Furthermore we show the reconstructibility of (1 ...
openaire +2 more sources
Advanced Healthcare Materials, EarlyView.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
First-order logic with metric betweenness – the case of non-definability of some graph classes
AKCE International Journal of Graphs and CombinatoricsThe metric betweenness of a connected graph and arbitrary graphs is FO definable. Moreover, several interesting classes of graphs with strong distance properties are shown to be FO definable using metric betweenness.
Jeny Jacob, Manoj Changat
doaj +1 more source
On connected components and perfect codes of proper order graphs of finite groups [PDF]
Proceedings of the Estonian Academy of SciencesLet G be a finite group with the identity element e. The proper order graph of G, denoted by â* (G), is an undirected graph with a vertex set G \ {e}, where two distinct vertices x and y are adjacent whenever o(x) | o(y) or o(y) | o(x), where o(x) and ...
Huani Li, Shixun Lin, Xuanlong Ma
doaj +1 more source
On the Existence of Markov Perfect Equilibria in Perfect Information Games [PDF]
We study the existence of pure strategy Markov perfect equilibria in two-person perfect information games. There is a state space X and each period player's possible actions are a subset of X.
Hannu Vartiainen, Hannu Salonen
core
Advanced Materials, EarlyView.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
Existence of perfect matchings in a plane bipartite graph [PDF]
, 1996 summary:We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the ...
Che, Zhongyuan, Kochol, Martin
core +1 more source
Advanced Materials, EarlyView.The energetic offset between the donor and the acceptor components in organic photoactive layers is central to the tradeoff between photovoltage and photocurrent losses. This Perspective covers the most important issues surrounding this topic in non‐fullerene acceptor blends, from the difficulty of accurately determining state energies and driving ...
Dieter Neher, Manasi Pranav
wiley +1 more source