Results 111 to 120 of about 2,650,610 (297)

Distributed Graph Simulation: Impossibility and Possibility [PDF]

open access: yes, 2014
This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin   +3 more
core  

The Middle Equitable Dominating Graphs

open access: yesOpen Journal of Discrete Mathematics, 2012
Let G= (V, E) be a graph and A(G) is the collection of all minimal equitable dominating set of G. The middle equitable dominating graph of G is the graph denoted by Med(G) with vertex set the disjoint union of V∪A(G) and (u, v) is an edge if and only if u ∩ v ≠ φ whenever u, v ∈ A(G) or u ∈ v whenever u ∈ v and v ∈ A(G) .
Alwardi, Anwar   +2 more
openaire   +2 more sources

Development and validation of a depression risk prediction model for middle-aged and elderly adults with sensory impairment: Evidence from the China health and retirement longitudinal study.

open access: yesPLoS ONE
ObjectiveCompared with those without such impairment, middle-aged and older adults with sensory impairment (SI) demonstrate a greater prevalence and severity of depressive symptoms, significantly affecting their mental health.
Mengzhen Qin   +3 more
doaj   +1 more source

Finding novel vulnerabilities of hypomorphic BRCA1 alleles

open access: yesMolecular Oncology, EarlyView.
Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder   +10 more
wiley   +1 more source

Graph Drawing Techniques for Geographic Visualization [PDF]

open access: yes, 2004
Geovisualizers often need to represent data that consists of items related together. Such data sets can be abstracted to a mathematical structure, the graph.
Rodgers, Peter
core  

Supporting Middle School Students’ Understanding of Time-Series Data With Graph Comparisons

open access: yesJournal of Statistics and Data Science Education
After participating in an afterschool program where they used the Common Online Data Analysis Platform (CODAP) to study time-series data about infectious diseases, four middle school students were interviewed to determine how they understood features of ...
Jan Mokros, Jacob Sagrans, Pendred Noyce
doaj   +1 more source

MITF maintains genome stability in nonmelanocyte lineages

open access: yesMolecular Oncology, EarlyView.
MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir   +13 more
wiley   +1 more source

Heuristic Search for the Analysis of Graph Transition Systems [PDF]

open access: yes, 2006
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Lluch-Lafuente, Alberto   +5 more
core   +1 more source

A novel quinazolinone insulin receptor inhibitor and its synergy with an EGFR inhibitor in glucose‐driven glioblastoma

open access: yesMolecular Oncology, EarlyView.
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka   +9 more
wiley   +1 more source

The t-Pebbling Number of Jahangir Graph [PDF]

open access: yes, 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

Home - About - Disclaimer - Privacy