Results 91 to 100 of about 855,405 (264)
Numerical interactive controller [PDF]
Device allows interaction of operator with data in computer central processor in order to shift frame of data in Cartesian coordinates and slew desired data into view.
Brokl, S. S., Zygielbaum, A. I.
core +1 more source
Reciprocal control of viral infection and phosphoinositide dynamics
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source
On the Families of Graphs With Unbounded Metric Dimension
A family G of connected graphs is a family with unbounded metric dimension if dim(G) is not constant and depends on the order of graph. In this paper, we compute the metric dimension of the splitting graphs S(Pn) and S(Cn) of a path and cycle.
Heng Pan +4 more
doaj +1 more source
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
A vertex w of a connected graph G strongly resolves two distinct vertices u,v∈V(G), if there is a shortest u,w path containing v, or a shortest v,w path containing u. A set S of vertices of G is a strong resolving set for G if every two distinct vertices
Dorota Kuziak
doaj +1 more source
Overlarge sets of resolvable idempotent quasigroups
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Y. Chang +3 more
openaire +2 more sources
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Let G be a finite, connected graph of order of, at least, 2 with vertex set VG and edge set EG. A set S of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of S.
Jia-Bao Liu, Ali Zafari
doaj +1 more source
The Metric Dimension of Graph with Pendant Edges [PDF]
For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v,w_1), d(v,w_2),..., d(v,w_k)) where d(x,y) represents the distance between the ...
Baskoro, Edy Tri +3 more
core
By dawn or dusk—how circadian timing rewrites bacterial infection outcomes
The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo +2 more
wiley +1 more source
Further new results on strong resolving partitions for graphs
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +1 more source

