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ę "Yang, Nan" wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
Dexamethasone inhibits U937 cell adhesion via the down-regulation of ROCK1 activity
Autorzy:
Liu, Dong
Chen, Xing
Xiong, Ren
Ning, Ya
Li, Ping
Peng, Yan
Liu, Ping
Zhao, Yan
Yang, Nan
Zhou, Yuan
Powiązania:
https://bibliotekanauki.pl/articles/1039650.pdf
Data publikacji:
2012
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
dexamethasone
ROCK1
fasudil
non-genomic effects
Opis:
Objective. To explore the effect of dexamethasone (DEX) on monocyte adhesion function and its underlying mechanism. Methods. The effects of DEX and fasudil on adhesion of cultured U937 monocytes to human umbilical vein endothelial cells (HUVEC) following stimulation with phorbol myristate acetate (PMA) were studied; Changes in the Rho-associated coiled-coil protein kinase 1 (ROCK1) protein content and activity were evaluated. Results. DEX and fasudil significantly inhibited U937 cell adhesion rates under PMA stimulation and inhibited ROCK1 activity. Mifepristone (RU-486) and cycloheximide (CHX) did not alter these effects of DEX. Conclusions. DEX interferes with the adhesion function of U937 cells through the inhibition of ROCK1 activity.
Źródło:
Acta Biochimica Polonica; 2012, 59, 4; 557-560
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Developing a Pronunciation Computer Program for the Acquisition of English Phonemes and Word Stress
Autorzy:
Hong, Jhao-Nan
Yang, James H.
Powiązania:
https://bibliotekanauki.pl/articles/620949.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
MALL
phonemes
word stress
Opis:
This study devised a pronunciation computer program to examine whether mobile-assisted language learning (MALL) could facilitate college students’ acquisition of English phonemes and word stress. Thirty-eight participants enrolled in the remedial English class offered at the language center of a national technological university in central Taiwan. Before the class, they were asked to read a word list. In the following six weeks, they were taught to distinguish and articulate English phonemes and to predict word stress locations using the designed computer program. They were also instructed to review the learning materials using the smart-phone version of the devised program. After the teaching session, each participant was asked again to read the same word list and fill out an assessment questionnaire. The sound analyses show that their readings of English minimal pairs and word stress placement were more accurate than their performances before the instruction. Their responses to the questionnaire indicate that both the given instruction and the designed computer program were satisfactory. In the open-ended questions, some of them said that they have built up a better understanding of phonemes and word stress, and that they would try to predict polysyllabic word stress when reading English articles. The present findings can be further applied to research on MALL-based English pronunciation acquisition.
Źródło:
Research in Language; 2017, 15, 4; 325-352
1731-7533
Pojawia się w:
Research in Language
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
2-Spanning Cyclability Problems of Some Generalized Petersen Graphs
Autorzy:
Yang, Meng-Chien
Hsu, Lih-Hsing
Hung, Chun-Nan
Cheng, Eddie
Powiązania:
https://bibliotekanauki.pl/articles/31348327.pdf
Data publikacji:
2020-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Petersen graph
spanning cyclable
Opis:
A graph G is called r-spanning cyclable if for every r distinct vertices v1, v2, . . ., vr of G, there exists r cycles C1, C2, . . ., Cr in G such that vi is on Ci for every i, and every vertex of G is on exactly one cycle Ci. In this paper, we consider the 2-spanning cyclable problem for the generalized Petersen graph GP (n, k). We solved the problem for k ≤ 4. In addition, we provide an additional observation for general k as well as stating a conjecture.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 713-731
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    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