Results 51 to 60 of about 1,481,196 (275)

A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) [PDF]

open access: yesOpuscula Mathematica, 2017
A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i
Dalibor Froncek
doaj   +1 more source

Near-Linear Query Complexity for Graph Inference

open access: yes, 2015
How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let $G = (V,E)$ be an unweighted, connected graph of bounded degree.
Kannan, Sampath   +2 more
core   +1 more source

From ab initio quantum chemistry to molecular dynamics: The delicate case of hydrogen bonding in ammonia [PDF]

open access: yes, 2003
The ammonia dimer (NH3)2 has been investigated using high--level ab initio quantum chemistry methods and density functional theory (DFT). The structure and energetics of important isomers is obtained to unprecedented accuracy without resorting to ...
Boese, A. Daniel   +3 more
core   +2 more sources

Prognostic Impact of Treatment Modalities, Including Targeted Compartmental Radio‐Immunotherapy, in a Cohort of Neuroblastoma Patients With CNS Metastases at Relapse

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Neuroblastoma (NB) with central nervous system (CNS) metastases is rare at diagnosis, but occurs more often during relapse/progression. Patients with CNS metastases face a dismal prognosis, with no standardized curative treatment available.
Vicente Santa‐Maria Lopez   +13 more
wiley   +1 more source

Pathogenic Germline PALB2 and RAD50 Variants in Patients With Relapsed Ewing Sarcoma

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Approximately 10% of patients with Ewing sarcoma (EwS) have pathogenic germline variants. Here, we report two cases: first, a novel germline pathogenic variant in partner and localizer of BRCA2 (PALB2) in a patient with a late EwS relapse. Its impact on homologous recombination is demonstrated, and breast cancer risk is discussed.
Molly Mack   +12 more
wiley   +1 more source

Distance between consecutive elements of the multiplicative group of integers modulo n [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
For a prime number p, we consider its primorial P:=p# and U(P):=(ℤ/Pℤ)^× the set of elements of the multiplicative group of integers modulo P which we represent as points anticlockwise on a circle of perimeter P.
Steven Brown
doaj   +1 more source

Developmental Disorders in Children Recently Diagnosed With Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Neurocognitive deficits in adult survivors of childhood cancer are well established, but less is known about developmental disorders (DD) arising shortly after cancer diagnosis. Using 2016–2019 linked Ohio cancer registry and Medicaid data, we compared DD among 324 children with cancer and 606,913 cancer‐free controls.
Jamie Shoag   +5 more
wiley   +1 more source

Applying QFD to the Vehicle Market Deployment Process

open access: yesWorld Electric Vehicle Journal
This study presents a practical methodology for systematically incorporating customer expectations and needs into the market implementation of electric vehicles (EVs).
Marta Pino-Servian   +3 more
doaj   +1 more source

Quantum corrections in 4d N = 1 infinite distance limits and the weak gravity conjecture

open access: yesJournal of High Energy Physics, 2021
We study quantum corrections in four-dimensional theories with N = 1 supersymmetry in the context of Quantum Gravity Conjectures. According to the Emergent String Conjecture, infinite distance limits in quantum gravity either lead to decompactification ...
Daniel Klaewer   +3 more
doaj   +1 more source

Approximation Algorithm for N-distance Minimal Vertex Cover Problem

open access: yes, 2016
Evolution of large scale networks demand for efficient way of communication in the networks. One way to propagate information in the network is to find vertex cover. In this paper we describe a variant of vertex cover problem naming it N-distance Vertex Minimal Cover(N-MVC) Problem to optimize information propagation throughout the network.
Yadav, Tarun   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy