نتایج جستجو برای: ds graph
تعداد نتایج: 215912 فیلتر نتایج به سال:
Two species of dermatan sulfate proteoglycans, called DS-PGI and DS-PGII, have been isolated from mature bovine articular cartilages. On sodium dodecyl sulfate-polyacrylamide gel electrophoresis at low ionic strength in 0.01 M phosphate the dermatan sulfate proteoglycans appeared as a single polydisperse species whose molecular weight ranged from 80,000 to 140,000. The dermatan sulfate proteogl...
A search for double-heavy tetraquark state candidates Xccs¯s¯ decaying to Ds+Ds+ and Ds*+Ds*+ is presented the first time using data samples of 102×106 ϒ(1S) 158×106 ϒ(2S) events, at s=10.52, 10.58, 10.867 GeV corresponding integrated luminosities 89.5, 711.0, 121.4 fb−1, respectively, accumulated with Belle detector KEKB asymmetric energy electron-positron collider. The invariant-mass spectra ...
A search for double-heavy tetraquark state candidates Xccs¯s¯ decaying to Ds+Ds+ and Ds*+Ds*+ is presented the first time using data samples of 102×106 ϒ(1S) 158×106 ϒ(2S) events, at s=10.52, 10.58, 10.867 GeV corresponding integrated luminosities 89.5, 711.0, 121.4 fb−1, respectively, accumulated with Belle detector KEKB asymmetric energy electron-positron collider. The invariant-mass spectra ...
Graph-based clustering methods perform clustering on a fixed input data graph. If this initial construction is of low quality then the resulting clustering may also be of low quality. Moreover, existing graph-based clustering methods require post-processing on the data graph to extract the clustering indicators. We address both of these drawbacks by allowing the data graph itself to be adjusted...
0
Children with Down syndrome (DS) have an increased risk for leukemia. The prognosis for DS acute myeloid leukemia (AML) is better than for non-DS AML, but the clinical outcome of DS acute lymphoblastic leukemia (ALL) is equal to that of non-DS ALL. Differences in prognosis may reflect differences in cellular drug resistance. In vitro drug resistance profiles were successfully investigated on le...
the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.
Protein synthesis initiation in reticulocyte lysates is inhibited by low concentrations (1-20 ng/ml) of double-stranded RNA (ds RNA) due to the activation of a ds RNA-dependent cAMP-independent protein kinase (ds I) that phosphorylates the alpha subunit of the eukaryotic initiation factor eIF-2. In lysates, ds I is present in the latent inactive form and is associated with the ribosome compleme...
a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید