Results 11 to 20 of about 4,285 (126)

A comprehensive review of cluster methods for drug-drug interaction network. [PDF]

Quant Biol
Abstract The detection of drug–drug interaction (DDI) is crucial to the rational use of drug combinations. Experimentally, DDI detection is time‐consuming and laborious. Currently, researchers have developed a variety of computational methods to predict DDI.
Cao S, Liu G, Zhou X, Lv J.
europepmc   +2 more sources

Optoelectronic-Driven van der Waals Ferroelectric Materials-Based Memory Devices for Retinomorphic and In-Sensory Hardware. [PDF]

Adv Sci (Weinh)
2D ferroelectrics materials enabling non‐volatile polarization memory, optical excitability, and neuromorphic processing within a unified material and provides a mechanistic analysis of polarization‐induced band modulation, including photon‐assisted domain reorientation, switching kinetics, and interfacial dipole coupling that governs resistive ...
Pal P, Wang YH, Kumar S, Prodromakis T.
europepmc   +2 more sources

Simultaneous Feedback Vertex Set: A Parameterized Perspective [PDF]

, 2015
Given a family of graphs $\mathcal{F}$, a graph $G$, and a positive integer $k$, the $\mathcal{F}$-Deletion problem asks whether we can delete at most $k$ vertices from $G$ to obtain a graph in $\mathcal{F}$.
Agrawal, Akanksha, Lokshtanov, Daniel, Mouawad, Amer E., Saurabh, Saket   +3 more
core   +2 more sources

Coherent Matter Wave Transport in Speckle Potentials [PDF]

, 2007
This article studies multiple scattering of matter waves by a disordered optical potential in two and in three dimensions. We calculate fundamental transport quantities such as the scattering mean free path $\ell_s$, the Boltzmann transport mean free ...
Akkermans E, Akkermans E, Allen L, Ashcroft N, Bender C M, Berry M V, Born M, C A Müller, C Miniatura, Chandrasekhar S, Clément D, Cohen-Tannoudji C, D Delande, Domb C, Frisch U, Galindo A, Goodman J W, Henkel C, Ishimaru A, John S, Kaiser R, Kopp T, Kopp T, Kramer B, Le Bellac M, Mahan G D, Mandel L, McCrea W H, Minkov G M Germanenko A V Rut O E Sherstobitov A A Zvonkov B N, Mott N F, O Sigwarth, Perrin H, R C Kuhn, Rammer J, Sachdev S, Shapiro B, Sheng P, van Tiggelen B A, Vollhardt D   +38 more
core   +2 more sources

Nonlocal Electrodynamics of Accelerated Systems [PDF]

, 2007
Acceleration-induced nonlocality is discussed and a simple field theory of nonlocal electrodynamics is developed. The theory involves a pair of real parameters that are to be determined from observation. The implications of this theory for the phenomenon
Anderson, Ashby, Bahram Mashhoon, Bohr, Buchholz, Chicone, Chicone, Hehl, Kennard, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Muench, Pegram   +19 more
core   +3 more sources

H-kernels by walks in H-colored digraphs and the color-class digraph

AKCE International Journal of Graphs and Combinatorics, 2016
Let H be a digraph possibly with loops and D a finite digraph without loops whose arcs are colored with the vertices of H (D is an H-colored digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively.
Hortensia Galeana-Sánchez, Rocío Sánchez-López   +1 more
doaj   +1 more source

Critical Percolation Exploration Path and SLE(6): a Proof of Convergence [PDF]

, 2006
It was argued by Schramm and Smirnov that the critical site percolation exploration path on the triangular lattice converges in distribution to the trace of chordal SLE(6). We provide here a detailed proof, which relies on Smirnov's theorem that crossing
Camia, Federico, Newman, Charles M.
core   +4 more sources

γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs

Discussiones Mathematicae Graph Theory, 2013
We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a.
Casas-Bautista Enrique, Galeana-Sánchez Hortensia, Rojas-Monroy Rocío   +2 more
doaj   +1 more source

Independent and monochromatic absorbent sets in infinite digraphs

AKCE International Journal of Graphs and Combinatorics, 2015
Let D be a digraph, we say that it is an m-coloured digraph if the arcs of D are coloured with at most m-colours. An (u,v) arc is symmetrical if (v,u) is also an arc of D. A directed path (resp.
Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy   +2 more
doaj   +1 more source

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems [PDF]

, 2015
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family {Mathematical expression} (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a ...
Gyárfás, András, Selkow, Stanley, Sárközy, Gábor   +2 more
core   +1 more source