Results 101 to 110 of about 5,978,611 (274)
Advanced Science, EarlyView.Tau populations with different aggregation states associate with distinct sets of proteins in the Alzheimer's disease brain. Proteomic discovery combined with single‐molecule analysis in neurons reveals dynamic associations involving proteostasis, metabolism and RNA biology.
Dorothea Böken +8 more
wiley +1 more source
Experiments on Nonlocal Fluid‐Flow Metamaterials
Advanced Science, EarlyView.A nonlocal fluid‐flow metamaterial composed of standard microfluidic tubes and connectors is designed. Hence, the current of the system at one position depends on the gradient of fluid flow at many other positions, leading to unusual alternating backward and forward laminar flows of water.
Ke Wang, Yi Chen, Martin Wegener
wiley +1 more source
Advanced Science, EarlyView.PCSK9 upregulation in cerebrovascular endothelial cells and microglia destabilizes the Aβ transporter LRP1, while TRIB3‐associated autophagy blockade further limits intracellular Aβ degradation. A RAP‐modified tea‐polyphenol nanoparticle co‐delivers siPCSK9 and siTRIB3 to restore LRP1‐mediated Aβ efflux and autophagy‐dependent degradation, reducing Aβ ...
Jie Miao +8 more
wiley +1 more source
Journal of Applied Mathematics, 2012 Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph.
Fatih Yılmaz, Durmuş Bozkurt
doaj +1 more source
A fast practical algorithm for the vertex separation of unicyclic graphs [PDF]
, 2008 The vertex separation of a graph is the minimum vertex separation of a linear layout of that graph over all its linear layouts. A linear layout of a graph is an arrangement of its vertices in a line and the vertex separation of a linear layout is maximum
Markov, Minko Marinov.
core
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Advanced Science, EarlyView.Poly(vinyl alcohol)‐modified liquid‐metal particles form conductive networks through spray‐induced self‐fusion without additional post‐treatment. Spray impact initiates oxide‐shell rupture and electrical contact, while subsequent Marangoni flow and capillary forces promote particle redistribution, neck growth, and network consolidation. This sequential
Keun‐Young Yook +13 more
wiley +1 more source
The t-Pebbling Number of Jahangir Graph [PDF]
, 2012 Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move (or pebbling step) is defined as the removal of two pebbles from a vertex and placing one pebble on an adjacent vertex.
Samuel Jeyaseelan, S. +2 more
core +1 more source
Advanced Science, EarlyView.The blood–brain–tumor barrier (BBTB) penetration by anticancer drugs and their effects on glioblastoma (GBM) is assessed using 3D bioprinted‐spheroids. Anticancer drug‐induced U‐87 MG cell death is quantified through in situ imaging of spheroids using a cancer cell death probe. The Ru compound, a partial P‐gp substrate, induces greater tumor‐cell death
Hyunjung Lee +5 more
wiley +1 more source
, 2008 In this research, graph theory is applied for two purposes. One is to express the routing of communication and the other is to express the condition of roads.
Graph Theory
core