http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
严雪琴(Xueqin Yan),刘薇薇(Weiwei Liu),雷迅(Xun Lei),吴成斌(Chengbin Wu) 아시아사회과학학회 2023 International Science Research Vol.3 No.1
The incidence of obesity has risen rapidly in the world, and the occurrence and development of obesity is closely related to the “three high” problem of adolescents after adulthood, which has become one of the most serious public health problems. China's teenagers are not only facing the problem of obesity, but also lack understanding of health-related knowledge, and their health literacy needs to be improved. Based on the analysis of the epidemic trend of adolescent obesity, this paper focuses on the relevant factors affecting the health literacy of obese adolescents, and puts forward countermeasures from the four levels of the country, school, family and individual, in order to improve and enhance their health literacy level, and provide theoretical basis for achieving the overall goal of national health.
Construction of Multiple-Rate Quasi-Cyclic LDPC Codes via the Hyperplane Decomposing
Xueqin Jiang,Yier Yan,이문호 한국통신학회 2011 Journal of communications and networks Vol.13 No.3
This paper presents an approach to the construction of multiple-rate quasi-cyclic low-density parity-check (LDPC) codes. Parity-check matrices of the proposed codes consist of q×q square submatrices. The block rows and block columns of the parity-check matrix correspond to the hyperplanes (μ-flats) and points in Euclidean geometries, respectively. By decomposing the μ-flats, we obtain LDPC codes of different code rates and a constant code length. The code performance is investigated in term of the bit error rate and compared with those of LDPC codes given in IEEE standards. Simulation results show that our codes perform very well and have low error floors over the additive white Gaussian noise channel.
Ternary Codes From Modified Jacket Matrices
Xueqin Jiang,이문호,Ying Guo,Yier Yan,Sarker Md. Abdul Latif 한국통신학회 2011 Journal of communications and networks Vol.13 No.1
In this paper, we construct two families C^∗_m and ˜C^∗_m of ternary (2^m, 3^m, 2^(m−1)) and (2^m, 3^(m+1), 2^(m−1)) codes, for m =1, 2, 3, · · ·, derived from the corresponding families of modified ternary Jacket matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.
Construction of Multiple-Rate Quasi-Cyclic LDPC Codes via the Hyperplane Decomposing
Jiang, Xueqin,Yan, Yier,Lee, Moon-Ho The Korea Institute of Information and Commucation 2011 Journal of communications and networks Vol.13 No.3
This paper presents an approach to the construction of multiple-rate quasi-cyclic low-density parity-check (LDPC) codes. Parity-check matrices of the proposed codes consist of $q{\times}q$ square submatrices. The block rows and block columns of the parity-check matrix correspond to the hyperplanes (${\mu}$-fiats) and points in Euclidean geometries, respectively. By decomposing the ${\mu}$-fiats, we obtain LDPC codes of different code rates and a constant code length. The code performance is investigated in term of the bit error rate and compared with those of LDPC codes given in IEEE standards. Simulation results show that our codes perform very well and have low error floors over the additive white Gaussian noise channel.
Ternary Codes from Modified Jacket Matrices
Jiang, Xueqin,Lee, Moon-Ho,Guo, Ying,Yan, Yier,Latif, Sarker Md. Abdul The Korea Institute of Information and Commucation 2011 Journal of communications and networks Vol.13 No.1
In this paper, we construct two families $C^*_m$ and ${\~{C}}^*_m$ of ternary ($2^m$, $3^m$, $2^{m-1}$ ) and ($2^m$, $3^{m+1}$, $2^{m-1}$ ) codes, for m = 1, 2, 3, ${\cdots}$, derived from the corresponding families of modified ternary Jacket matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.
Callus induction and plant regeneration from leaves of peony
Xiangtao Zhu,Xueqin Li,Wenjie Ding,Songheng Jin,Yan Wang 한국원예학회 2018 Horticulture, Environment, and Biotechnology Vol.59 No.4
Tree peony (Paeonia suffruticosa Andr.) is a valued ornamental plant. This study reports on peony callus induction, shoot organogenesis and plant regeneration using young peony leaves as explants. Various media containing diverse plant growth regulators were assessed for their potency in peony propagation. After exposure of dark-adapted leaf discs to 30 μmol m−2 s−1 of light, inoculation in Murashige and Skoog (MS) + 0.2 mg L−1 2,4-dichlorophenoxyacetic acid (2,4-D) + 0.2 mg L−1 a-naphthaleneacetic acid (NAA) + 3.0 mg L−1 thidiazuron (TDZ) medium resulted to the highest callus induction rate with values reaching up to 87.8%. We identified that MS + 0.2 mg L−1 NAA + 2.0 mg L−1 6-benzyladenine (6-BA) + 2.0 mg L−1 kinetin (KT), with a multiplication coefficient of 3.025, to be the optimal medium for further callus proliferation under light. Inoculation in MS + 2.0 mg L−16-BA + 0.2 mg L−1 NAA + 0.3 mg L−1 TDZ medium allowed 22.22% of callus cultures to differentiate into adventitious shoots, whereas a similar rate of root formation was detected when 1/2 MS + 0.1 mg L−1 NAA + 0.05 mg L−1 IBA + 30 g L−1 sucrose medium was used. Our findings provide important information on peony regeneration and present a new method for peony tissue culture that will potentially facilitate mass propagation and genetic engineering of peony plants.
Research on High-Dimensional Data Reduction
Cuihua Tian,Yan Wang,Xueqin Lin,Jing Lin,Jiangshui Hong 보안공학연구지원센터 2016 International Journal of Database Theory and Appli Vol.9 No.1
In this paper, features of high-dimensional data are analyzed, and existing problems of the Canonical Correlation Analysis (CCA) are analyzed for a single view of a full supervised view data. In order to improve CCA, we introduce the method of classifier and present a Classifying to Reduce Correlation Dimensionality (CRCD). Meanwhile, combining big interval learning method, we propose the big correlation analysis (BCA). At last, experiments are respectively conducted by using artificial data set and UCI standard data set. The result shows that methods are feasible and effective.
Enhanced beamforming design and sum-rate maximization for two-way multi-relay networks
Duan, Wei,Yan, Yier,Hai, Han,Jiang, Xueqin,Yu, Haiyang,Lee, Moon Ho SpringerOpen 2016 Eurasip Journal on Wireless Communications and Net Vol.2016 No.-
<P>In this paper, we investigate an enhanced relay beamforming design for two-way relay networks (TWRN). In order to reduce the computational complexity, we derive a sum of the inverse of the signal-to-noise ratio (SI-SNR) problem equivalent to the objective sum-rate (SR) problem. The SI-SNR problem can be reformulated as a simple optimization problem by using the Cholesky decomposition and Cauchy-Schwarz inequality, and solved by the interior-point method. The numerical results show that the proposed SI-SNR method can not only reduce the computational complexity but also have the same SR performance as that of the conventional works.</P>
何姗(Shan He),严雪琴(Xueqin Yan),伍颖(Ying Wu),杨倩茹(Qianru Yang),刘薇薇(Weiwei Liu) 아시아사회과학학회 2023 International Science Research Vol.3 No.1
International researches on the relationship between children and cities, the impact of urban environment on children's body and mind, and how to build a child friendly city have reached a certain depth. At present, the construction of child friendly cities in China is still in its infancy. Among them, the urban spatial planning involving children has not been in-depth, and the disease burden caused by falls and road traffic injuries is still high. In view of the problems existing in the built environment of the city, we should carry out the construction of a child friendly city, pay attention to the safety guarantee of children's activity space, formulate targeted accidental injury prevention and control measures, and promote the inclusive sharing of children's medical and health service resources, high-quality and balanced development.