Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Li, Ning" wg kryterium: Autor


Tytuł:
A characterization of (γₜ,γ₂)-trees
Autorzy:
Lu, You
Hou, Xinmin
Xu, Jun-Ming
Li, Ning
Tematy:
domination
total domination
2-domination
(λ,μ)-tree
Pokaż więcej
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:
https://bibliotekanauki.pl/articles/744036.pdf  Link otwiera się w nowym oknie
Opis:
Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respectively. It has been shown that: γₜ(T) ≤ γ₂(T) for any tree T. In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The experimental instrumented bolt with fibre bragg grating force sensors
Autorzy:
Wang, Tuo
Chang, Jucai
Gong, Peng
Shi, Wenbao
Li, Ning
Cheng, Shixing
Tematy:
siatka światłowodowa
system kotwienia
wspornik śruby
fiber Bragg grating
pullout testing
anchorage systems
pre-tightening torque
bolt support
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:
https://bibliotekanauki.pl/articles/219784.pdf  Link otwiera się w nowym oknie
Opis:
Monitoring the stress change of bolt and knowing the anchoring condition in a reasonable and effective way, accurately, can effectively prevent tunnel accident from breaking out. The stress of rock mass around the roadway is usually transferred to the anchor rod in the form of axial load, so it is of great significance to study the axial load of the bolt. In this paper, a full size anchoring and drawing experiment system was designed and established, innovatively, which realized the pull-out test of 2.5 m prestressed end Anchorage and the full-length Anchorage by using the new resin anchorage agent under vertical and horizontal loads. Through the application of fiber Bragg grating (FBG) sensing technology to the test of full-scale anchor rod, the axial force distribution characteristics of the end Anchorage and the full-length Anchorage anchor rod were obtained under the action of pre-tightening torque and confining rock pressure. The comparison indicates that the proportion of high stress range accounts for only 17.5% and the main bearing range is near the thread end of anchor rod, the proportion of main bearing range of end Anchorage is 83.3%, and the feasibility of FBG force-measuring anchor rod is verified in the field. The research results have certain reference value.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Altered microRNA and mRNA profiles during heart failure in the human sinoatrial node
Autorzy:
Whitson, Bryan
Mohler, Peter J.
Pietrzak, Maciej
Dobrzynski, Halina
Artiga, Esthela
Fedorov, Vadim
Webb, Amy
Mokadam, Nahush A.
Kalyanasundaram, Anuradha
Li, Ning
Janssen, Paul M.L.
Hummel, John
Biesiadecki, Brandon
Hansen, Brian
Opis:
Heart failure (HF) is frequently accompanied with the sinoatrial node (SAN) dysfunction, which causes tachy-brady arrhythmias and increased mortality. MicroRNA (miR) alterations are associated with HF progression. However, the transcriptome of HF human SAN, and its role in HF-associated remodeling of ion channels, transporters, and receptors responsible for SAN automaticity and conduction impairments is unknown. We conducted comprehensive high-throughput transcriptomic analysis of pure human SAN primary pacemaker tissue and neighboring right atrial tissue from human transplanted HF hearts (n = 10) and non-failing (nHF) donor hearts (n = 9), using next-generation sequencing. Overall, 47 miRs and 832 mRNAs related to multiple signaling pathways, including cardiac diseases, tachy-brady arrhythmias and fibrosis, were significantly altered in HF SAN. Of the altered miRs, 27 are predicted to regulate mRNAs of major ion channels and neurotransmitter receptors which are involved in SAN automaticity (e.g. HCN1, HCN4, SLC8A1) and intranodal conduction (e.g. SCN5A, SCN8A) or both (e.g. KCNJ3, KCNJ5). Luciferase reporter assays were used to validate interactions of miRs with predicted mRNA targets. In conclusion, our study provides a profile of altered miRs in HF human SAN, and a novel transcriptome blueprint to identify molecular targets for SAN dysfunction and arrhythmia treatments in HF.
Dostawca treści:
Repozytorium Uniwersytetu Jagiellońskiego
Artykuł
Tytuł:
HKU5 bat merbecoviruses engage bat and mink ACE2 as entry receptors
Autorzy:
Catanzaro, Nicholas J.
Ring, Aaron
Russell, Gabriel A.
Lee, Sanghyun
Spaulding, Alicen B.
Synowiec, Aleksandra
Schäfer, Alexandra
Teng, I-Ting
Madel Alfajaro, Mia
Song, Jaewon
Menasche, Bridget L.
Arinola, Ridwan
Li, Ning
Serebryannyy, Leonid
Wei, Jin
Baric, Ralph S.
Keeler, Emma L.
Zepeda, Samantha
Iwasaki, Akiko
Jangra, Rohit K.
Kim, Arthur S.
Peña-Hernández, Mario A.
Doench, John G.
Douek, Daniel C.
Tsybovsky, Yaroslav
Kaur, Ramandeep
Martinez, David R.
Zhao, Zhe
Uchil, Pradeep D.
Huck, John
Yount, Boyd
Mothes, Walther
Wilen, Craig B.
Grunst, Michael W.
Zhou, Tongqing
Wang, Danyi
Opis:
Identifying receptors for bat coronaviruses is critical for spillover risk assessment, countermeasure development, and pandemic preparedness. While Middle East respiratory syndrome coronavirus (MERS-CoV) uses DPP4 for entry, the receptors of many MERS-related betacoronaviruses remain unknown. The bat merbecovirus HKU5 was previously shown to have an entry restriction in human cells. Using both pseudotyped and full-length virus, we show that HKU5 uses Pipistrellus abramus bat ACE2 but not human ACE2 or DPP4 as a receptor. Cryo-electron microscopy analysis of the virus-receptor complex and structure-guided mutagenesis reveal a spike and ACE2 interaction that is distinct from other ACE2-using coronaviruses. MERS-CoV vaccine sera poorly neutralize HKU5 informing pan-merbecovirus vaccine design. Notably, HKU5 can also engage American mink and stoat ACE2, revealing mustelids as potential intermediate hosts. These findings highlight the versatility of merbecovirus receptor use and underscore the need for continued surveillance of bat and mustelid species.
Dostawca treści:
Repozytorium Uniwersytetu Jagiellońskiego
Artykuł
Tytuł:
On path-quasar Ramsey numbers
Autorzy:
Li, Binlong
Ning, Bo
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Powiązania:
https://bibliotekanauki.pl/articles/747260.pdf  Link otwiera się w nowym oknie
Opis:
Let \(G_1\) and \(G_2\) be two given graphs. The Ramsey number \(R(G_1,G_2)\) is the least integer \(r\) such that for every graph \(G\) on \(r\) vertices, either \(G\) contains a \(G_1\) or \(\overline{G}\) contains a \(G_2\). Parsons gave a recursive formula to determine the values of \(R(P_n,K_{1,m})\), where \(P_n\) is a path on \(n\) vertices and \(K_{1,m}\) is a star on \(m+1\) vertices. In this note, we study the Ramsey numbers \(R(P_n,K_1\vee F_m)\), where \(F_m\) is a linear forest on \(m\) vertices. We determine the exact values of \(R(P_n,K_1\vee F_m)\) for the cases \(m\leq n\) and \(m\geq 2n\), and for the case that \(F_m\) has no odd component. Moreover, we give a lower bound and an upper bound for the case \(n+1\leq m\leq 2n-1\) and \(F_m\) has at least one odd component.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heavy Subgraphs, Stability and Hamiltonicity
Autorzy:
Li, Binlong
Ning, Bo
Tematy:
heavy subgraphs
hamiltonian graphs
closure theory
Pokaż więcej
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:
https://bibliotekanauki.pl/articles/31341693.pdf  Link otwiera się w nowym oknie
Opis:
Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw of G contains two end-vertices with degree sum at least |V (G)| in G. In this paper, we introduce a new concept, and say that G is S-c-heavy if for a given graph S and every induced subgraph G′ of G isomorphic to S and every maximal clique C of G′, every non-trivial component of G′ − C contains a vertex of degree at least |V (G)|/2 in G. Our original motivation is a theorem of Hu from 1999 that can be stated, in terms of this concept, as every 2-connected 2-heavy and N-c-heavy graph is hamiltonian, where N is the graph obtained from a triangle by adding three disjoint pendant edges. In this paper, we will characterize all connected graphs S such that every 2-connected o-heavy and S-c-heavy graph is hamiltonian. Our work results in a different proof of a stronger version of Hu’s theorem. Furthermore, our main result improves or extends several previous results.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An implicit weighted degree condition for heavy cycles
Autorzy:
Cai, Junqing
Li, Hao
Ning, Wantao
Tematy:
weighted graph
hamiltonian cycles
heavy cycles
implicit degree
implicit weighted degree
Pokaż więcej
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:
https://bibliotekanauki.pl/articles/30148719.pdf  Link otwiera się w nowym oknie
Opis:
For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least t; (b) w(xz) = w(yz) for every vertex z ∈ N(x) ∩ N(y) with xy /∈ E(G); (c) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains either a hamiltonian cycle or a cycle of weight at least 2t/3. This generalizes the result of Zhang et al. [9].
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies