Results 51 to 60 of about 395,936 (323)
Report on the 2nd MObility for Vesicle research in Europe (MOVE) symposium—2024
FEBS Open Bio, EarlyView.The 2nd MObility for Vesicle research in Europe (MOVE) Symposium in Belgrade brought over 280 attendees from 28 countries to advance extracellular vesicle (EV) research. Featuring keynotes, presentations, and industry sessions, it covered EV biogenesis, biomarkers, therapies, and manufacturing.
Dorival Mendes Rodrigues‐Junior +5 more
wiley +1 more source
On size multipartite Ramsey numbers for stars versus paths and cycles
Electronic Journal of Graph Theory and Applications, 2017 Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the ...
Anie Lusiani +2 more
doaj +1 more source
Frontiers in Bioengineering and Biotechnology, 2022 To disclose the net effect of light on microalgal growth in photobioreactors, self-shading and mixing-induced light–dark cycles must be minimized and discerned from the transient phenomena of acclimation.
Alberto Saccardo +3 more
doaj +1 more source
On-line Ramsey numbers of paths and cycles [PDF]
, 2014 Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some
Cyman, Joanna +3 more
core
FEBS Open Bio, EarlyView.What factors make for an effective digital learning tool in Higher Education? This systematic review identifies elements of a digital tool that published examples reveal to be features of an engaging and impactful digital tool. A systematic literature search yielded 25 research papers for analysis.
Akmal Arzeman +4 more
wiley +1 more source
Γ-independent dominating graphs of paths and cycles [PDF]
Songklanakarin Journal of Science and Technology (SJST)A set D of vertices in a graph G is an independent dominating set if D is a set of pairwise nonadjacent vertices of G such that every vertex of G not in D is adjacent to at least one vertex in D.
Roongrat Samanmoo +1 more
doaj
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Apolipoprotein ε4 (APOE ε4) is a potent genetic risk factor for Alzheimer's disease (AD). However, its role in cerebral small vessel disease (CSVD) remains unclear. Given the clinical and pathological similarities between CSVD and AD, this study aimed to investigate the associations of APOE ε4 gene dosage with cognitive function and
Tingru Jin +6 more
wiley +1 more source
PATHS AND CYCLES IN COLORED GRAPHS [PDF]
Electronic Notes in Discrete Mathematics, 2001 Let G be an (edge-)colored graph. A path (cycle) is called monochromatic if all the edges of it have the same color, and is called heterochromatic if all the edges of it have different colors. In this note, some sufficient conditions for the existence of monochromatic and heterochromatic paths and cycles are obtained.
Hajo Broersma +2 more
openaire +2 more sources
Arthritis Care &Research, Accepted Article.Objective We aimed to compare clinical outcomes between patients in the Allegheny Health Network rheumatoid arthritis (RA) care pathway and patients receiving usual care. Methods The care pathway initiative implements guideline‐based best practice alongside multi‐disciplinary team‐based care. Clinical and insurance claims data were extracted to compare
Tarun Sharma +7 more
wiley +1 more source
Edge ideals and DG algebra resolutions
Le Matematiche, 2015 Let R = S/I where S = k[T_1, . . . , T_n] and I is a homogeneous ideal in S. The acyclic closure R<Y> of k over R is a DG algebra resolution obtained by means of Tate’s process of adjoining variables to kill cycles.
Adam Boocher +4 more
doaj