Search

Your search keyword '"CHENG Xiaoyan"' showing total 455 results
Start Over Author "CHENG Xiaoyan"
455 results on '"CHENG Xiaoyan"'

3. Finite-Time Switched Second-Order Sliding-Mode Control of Nonholonomic Wheeled Mobile Robot Systems

Author

Hao Ce, Wang Hongbin, Cheng Xiaoyan, Zhou Zhen, Ge Shungang, and Hu Zhongquan

Subjects
Electronic computers. Computer science, QA75.5-76.95
Abstract

A continuous finite-time robust control method for the trajectory tracking control of a nonholonomic wheeled mobile robot (NWMR) is presented in this paper. The proposed approach is composed of conventional sliding-mode control (SMC) in the internal loop and modified switched second-order sliding-mode (S-SOSM) control in the external loop. Sliding-mode controller is equivalently represented as stabilization of the nominal system without uncertainties. An S-SOSM control algorithm is employed to counteract the impact of state-dependent unmodeled dynamics and time-varying external disturbances, and the unexpected chattering has been attenuated significantly. Particularly, state-space partitioning is constructed to obtain the bounds of uncertainty terms and accomplish different control objectives under different requirements. Simulation and experiment results are used to demonstrate the effectiveness and applicability of the proposed approach.

Published
2018
Full Text
View/download PDF

6. Biologically Inspired and Energy-Efficient Neurons

Author

Cheng, Xiaoyan, Simmich, Sebastian, Zahari, Finn, Birkoben, Tom, Noll, Maximiliane, Wolfer, Tobias, Hennig, Eckhard, Rieger, Robert, Kohlstedt, Hermann, Bahr, Andreas, Kasabov, Nikola, Series Editor, Amari, Shun-ichi, Editorial Board Member, Avesani, Paolo, Editorial Board Member, Benuskova, Lubica, Editorial Board Member, Brown, Chris M., Editorial Board Member, Duro, Richard J., Editorial Board Member, Georgieva, Petia, Editorial Board Member, Hou, Zeng-Guang, Editorial Board Member, Indiveri, Giacomo, Editorial Board Member, King, Irwin, Editorial Board Member, Kozma, Robert, Editorial Board Member, König, Andreas, Editorial Board Member, Mandic, Danilo, Editorial Board Member, Masulli, Francesco, Editorial Board Member, Thivierge, JeanPhilippe, Editorial Board Member, Villa, Allessandro E.P., Editorial Board Member, Ziegler, Martin, editor, Mussenbrock, Thomas, editor, and Kohlstedt, Hermann, editor

Published
2024
Full Text
View/download PDF

7. Girth of the algebraic bipartite graph $D(k,q)$

Author

Xu, Ming, Cheng, Xiaoyan, and Tang, Yuansheng

Subjects
Mathematics - Combinatorics
Abstract

For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is $q$-regular, edge-transitive and of girth at least $k+4$. Its exact girth $g=g(D(k,q))$ was conjectured in 1995 to be $k+5$ for odd $k$ and $q\geq4$. This conjecture was shown to be valid in 2016 when $\frac{k+5}{2}|_p(q-1)$, where $p$ is the characteristic of $\mathbb{F}_q$ and $m|_pn$ means that $m$ divides $p^r n$ for some nonnegative integer $r$. In this paper, for $t\geq 1$ we prove that (a) $g(D(4t+2,q))=g(D(4t+1,q))$; (b) $g(D(4t+3,q))=4t+8$ if $g(D(2t,q))=2t+4$; (c) $g(D(8t,q))=8t+4$ if $g(D(4t-2,q))=4t+2$; (d) $g(D(2^{s+2}(2t-1)-5,q))=2^{s+2}(2t-1)$ if $p\geq 3$, $(2t-1)|_p(q-1)$ and $2^s\|(q-1)$. A simple upper bound for the girth of $D(k,q)$ is proposed in the end of this paper.

Published
2022

8. On the girth cycles of the bipartite graph $D(k,q)$

Author

Xu, Ming, Cheng, Xiaoyan, and Tang, Yuansheng

Subjects
Mathematics - Combinatorics
Abstract

For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is $q$-regular, edge-transitive and of girth at least $k+4$. For its exact girth $g=g(D(k,q))$, F\"{u}redi et al. (1995) conjectured $g=k+5$ for odd $k$ and $q\geq4$. This conjecture was shown to be valid in 2016 when $(k+5)/2$ is the product of an arbitrary factor of $q-1$ and an arbitrary power of the characteristic of $\mathbb{F}_q$. In this paper, we determine all the girth cycles of $D(k,q)$ for $3\leq k\leq 5$, $q>3$, and those for $3\leq k\leq8$, $q=3$.

Published
2022

12. Biologically Inspired and Energy-Efficient Neurons

Author

Cheng, Xiaoyan, primary, Simmich, Sebastian, additional, Zahari, Finn, additional, Birkoben, Tom, additional, Noll, Maximiliane, additional, Wolfer, Tobias, additional, Hennig, Eckhard, additional, Rieger, Robert, additional, Kohlstedt, Hermann, additional, and Bahr, Andreas, additional

Published
2023
Full Text
View/download PDF

14. Forecasting China's Military Industry Index: Based on Decision Tree, Random Forest and Time Series Models

Author

Cheng, Xiaoyan, Liu, Ziyan, Zhang, Zhijie, Zhu, Zhiyue, Appolloni, Andrea, Series Editor, Caracciolo, Francesco, Series Editor, Ding, Zhuoqi, Series Editor, Gogas, Periklis, Series Editor, Huang, Gordon, Series Editor, Nartea, Gilbert, Series Editor, Ngo, Thanh, Series Editor, Striełkowski, Wadim, Series Editor, Gaikar, Vilas, editor, Hou, Min, editor, and Qalati, Sikandar Ali, editor

Published
2023
Full Text
View/download PDF

16. On the characterization of some algebraically defined bipartite graphs of girth eight

Author

Xu, Ming, Cheng, Xiaoyan, and Tang, Yuansheng

Subjects
Mathematics - Combinatorics
Abstract

For any field $\mathbb{F}$ and polynomials $f_{2},f_{3}\in\mathbb{F}[x,y]$, let $\Gamma_{\mathbb{F}}(f_{2},f_{3})$ denote the bipartite graph with vertex partition $P\cup L$, where $P$ and $L$ are two copies of $\mathbb{F}^{3}$, and $(p_{1},p_{2},p_{3})\in P$ is adjacent to $[l_{1},l_{2},l_{3}]\in L$ if and only if $p_{2}+l_{2}=f_{2}(p_{1},l_{1})$ and $p_{3}+l_{3}=f_{3}(p_{1},l_{1})$. The graph $\Gamma_{3}(\mathbb{F})=\Gamma_{\mathbb{F}}(xy,xy^{2})$ is known to be of girth eight. When $\mathbb{F}=\mathbb{F}_q$ is a finite field of odd size $q$ or $\mathbb{F}=\mathbb{F}_{\infty}$ is an algebraically closed field of characteristic zero, the graph $\Gamma_{3}(\mathbb{F})$ is conjectured to be the unique one with girth at least eight among those $\Gamma_{\mathbb{F}}(f_{2},f_{3})$ up to isomorphism. This conjecture has been confirmed for the case that both $f_{2},f_{3}$ are monomials over $\mathbb{F}_q$, and for the case that at least one of $f_{2},f_{3}$ is a monomial over $\mathbb{F}_{\infty}$. If one of $f_{2},f_{3}\in\mathbb{F}_q[x,y]$ is a monomial, it has also been proved the existence of a positive integer $M$ such that $G=\Gamma_{\mathbb{F}_{q^{M}}}(f_2,f_3)$ is isomorphic to $\Gamma_{3}(\mathbb{F}_{q^{M}})$ provided $G$ has girth at least eight. In this paper, these results are shown to be valid when the restriction on the polynomials $f_2,f_3$ is relaxed further to that one of them is the product of two univariate polynomials. Furthermore, all of such polynomials $f_2,f_3$ are characterized completely.

Published
2019

24. On a Generalization of the Bipartite Graph $D(k,q)$

Author

Cheng, Xiaoyan, Tang, Yuansheng, and Wang, Huaxiong

Subjects
Mathematics - Combinatorics
Abstract

In this paper, we deal with a generalization $\Gamma(\Omega,q)$ of the bipartite graphs $D(k,q)$ proposed by Lazebnik and Ustimenko, where $\Omega$ is a set of binary sequences that are adopted to index the entries of the vertices. A few sufficient conditions on $\Omega$ for $\Gamma(\Omega,q)$ to admit a variety of automorphisms are proposed. A sufficient condition for $\Gamma(\Omega,q)$ to be edge-transitive is proposed further. A lower bound of the number of the connected components of $\Gamma(\Omega,q)$ is given by showing some invariants for the components. For $\Gamma(\Omega,q)$, paths and cycles which contain vertices of some specified form are investigated in details. Some lower bounds for the girth of $\Gamma(\Omega,q)$ are then shown. In particular, one can give very simple conditions on the index set $\Omega$ so as to assure the generalized graphs $\Gamma(\Omega,q)$ to be a family of graphs with large girth.

Published
2017

29. Evaluating the efficacy of intermittent fasting and exercise combinations for weight loss: A network meta‐analysis.

Author

Cheng, Xiaoyan, Sun, Shunli, Chen, Maolin, Zhou, Xinyou, Rao, Mingxin, Guo, Dongjuan, Xie, Jinfeng, Huang, Qiang, and Su, Liqiang

Abstract

Summary: Objective: The purpose of this study is to utilize network meta‐analysis (NMA) to synthesize relevant randomized controlled trials (RCTs) and evaluate the most effective intermittent fasting (IF) combined with exercise interventions for weight loss. Methods: This study searched five databases up until April 2024, obtaining RCTs that investigated the effects of intermittent fasting (IF) combined with exercise. The quality of the literature was assessed using the Cochrane tool, followed by a random‐effects statistical analysis of each intervention. Eventually, a NMA was conducted to compare the effectiveness of each intervention on weight loss, thereby determining their combined effectiveness on reducing weight. Results: A total of nine trials, comparing 12 interventions involving 570 participants, were included. All interventions significantly reduced body weight (BW) and fat mass (FM) compared to the control (CON) group. In terms of BW reduction, the alternate‐day fasting + moderate‐intensity continuous training (ADF + MICT) intervention had the highest surface under the cumulative ranking curve average (SUCRA) score 88.1(MD: −4.44,95% CI −5.95, −2.92). Furthermore, for improving FM, the ADF + MICT intervention also had the highest SUCRA score 92.7(MD: −3.65,95% CI −5.05, −2.25), making it the optimal intervention for improving FM. Conclusion: The NMA results indicate that all interventions are effective in reducing weight. Among them, ADF + MICT is the most effective strategy for reducing BW, and it is also the best approach for improving FM. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

31. Frequent Acquisition of Glycoside Hydrolase Family 32 (GH32) Genes from Bacteria via Horizontal Gene Transfer Drives Adaptation of Invertebrates to Diverse Sources of Food and Living Habitats.

Author

Cheng, Xiaoyan, Liu, Xuming, Jordan, Katherine W., Yu, Jingcheng, Whitworth, Robert J., Park, Yoonseong, and Chen, Ming-Shun

Subjects
*HORIZONTAL gene transfer, *DIGESTIVE enzymes, *GLYCOSIDASES, *PESTS, *HOST plants
Abstract

Glycoside hydrolases (GHs, also called glycosidases) catalyze the hydrolysis of glycosidic bonds in polysaccharides. Numerous GH genes have been identified from various organisms and are classified into 188 families, abbreviated GH1 to GH188. Enzymes in the GH32 family hydrolyze fructans, which are present in approximately 15% of flowering plants and are widespread across microorganisms. GH32 genes are rarely found in animals, as fructans are not a typical carbohydrate source utilized in animals. Here, we report the discovery of 242 GH32 genes identified in 84 animal species, ranging from nematodes to crabs. Genetic analyses of these genes indicated that the GH32 genes in various animals were derived from different bacteria via multiple, independent horizontal gene transfer events. The GH32 genes in animals appear functional based on the highly conserved catalytic blades and triads in the active center despite the overall low (35–60%) sequence similarities among the predicted proteins. The acquisition of GH32 genes by animals may have a profound impact on sugar metabolism for the recipient organisms. Our results together with previous reports suggest that the acquired GH32 enzymes may not only serve as digestive enzymes, but also may serve as effectors for manipulating host plants, and as metabolic enzymes in the non-digestive tissues of certain animals. Our results provide a foundation for future studies on the significance of horizontally transferred GH32 genes in animals. The information reported here enriches our knowledge of horizontal gene transfer, GH32 functions, and animal–plant interactions, which may result in practical applications. For example, developing crops via targeted engineering that inhibits GH32 enzymes could aid in the plant's resistance to animal pests. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

32. Effects of AR-HMD Interactive Interface Layout on Usability and Obstacle Avoidance in Subway Overhauls.

Author

Jing, Chunhui, Cheng, Xiaoyan, Wang, Xinxian, Yu, Dongyu, and Yao, Xing

Subjects
*HEAD-mounted displays, *SUBWAYS, *AUGMENTED reality, *RECOGNITION (Psychology)
Abstract

AbstractThe maintenance and overhaul of rail transit vehicle frames are vital for ensuring the safe and reliable operation of equipment. AR-based maintenance has been proven to be cost-reducing and effective. Few studies explored the application of AR-based maintenance on subway overhaul. In this study, 74 participants were selected to conduct the underground maintenance AR recognition and obstacle avoidance experiment. And two-factor ANOVA, independent samples t-test, and non-parametric test were used for data statistics. The results show that a high-opacity AR interface has better recognition but affects obstacle avoidance. Facing different types of obstacles, AR interfaces with different layouts have significant differences in terms of recognizability and obstacle avoidance effects. Compared with the list layout, the matrix layout AR interface will make more effort for workers. The findings provide useful references for designing the visual information layout of AR interfaces and conducting usability testing of AR interfaces in complex scenarios such as underground maintenance.HighlightsThis study assessed the effects of the AR-HMD interface on workers’ recognition of and ability to safely avoid obstacles in a subway maintenance environment.A high-opacity AR interface leads to better recognition but affects obstacle avoidance.List AR interfaces lead to better recognition but increase the probability of obstacle avoidance failure by 50% under block obstacles.For linear obstacles, layout has no significant effect on recognition or obstacle avoidance.A matrix layout AR interface is more effortful than the list layout AR for the workers.This study assessed the effects of the AR-HMD interface on workers’ recognition of and ability to safely avoid obstacles in a subway maintenance environment.A high-opacity AR interface leads to better recognition but affects obstacle avoidance.List AR interfaces lead to better recognition but increase the probability of obstacle avoidance failure by 50% under block obstacles.For linear obstacles, layout has no significant effect on recognition or obstacle avoidance.A matrix layout AR interface is more effortful than the list layout AR for the workers. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results