default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuping Qin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Junchang Zhai, Huanqing Wang, Yuping Qin, Hongxia Cui:
Estimation-based event-triggered fixed-time fuzzy tracking control for high-order nonlinear systems. Appl. Math. Comput. 486: 129057 (2025)- 2024
- [j9]Junchang Zhai, Huanqing Wang, Hongxia Cui, Yuping Qin:
Fixed-time fuzzy tracking control for high-order nonstrict feedback nonlinear systems with unknown virtual control gains and actuator faults. Inf. Sci. 662: 120266 (2024) - 2023
- [c7]Yuqun Qin
, Danping Duan, Hui Wang, Xiaomeng Chen, Litao Wen, Yuping Qin:
Application of Virtual Simulation Technology in Human Anatomy Teaching in 5G Environment. ICETM 2023: 121-128 - 2021
- [j8]Qiangkui Leng, Zuowei He, Yuqing Liu, Yuping Qin, Yujian Li:
A soft-margin convex polyhedron classifier for nonlinear task with noise tolerance. Appl. Intell. 51(1): 453-466 (2021) - 2020
- [c6]Yuping Qin, Xueying Cheng, Qiangkui Leng:
A Multi-class Classification Algorithm Based on Geometric Support Vector Machine. ICIC (3) 2020: 355-364 - [c5]Yuping Qin, Xueying Cheng, Xiangna Li, Qiangkui Leng:
An Effective Multi-label Classification Algorithm Based on Hypercube. ICIC (3) 2020: 476-483
2010 – 2019
- 2019
- [j7]Qiangkui Leng, Yuqing Liu, Xuhui Zhao, Long Zhang, Yuping Qin:
A Greedy Method for Constructing Minimal Multiconlitron. IEEE Access 7: 174662-174672 (2019) - [j6]Qiangkui Leng, Shurui Wang, Yuping Qin, Yujian Li:
An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier. Inf. Sci. 504: 435-448 (2019) - 2018
- [j5]Qiangkui Leng, Yuping Qin, Yujian Li:
A multi-class learning method for multiconlitron using hybrid binary tree architecture. Appl. Soft Comput. 64: 497-507 (2018) - [j4]Qiangkui Leng, Fude Liu, Yuping Qin:
一种基于混合二叉树结构的多类支持向量机分类算法 (Multi-class Classification Algorithm for SVM Based on Hybrid Binary Tree Structure). 计算机科学 45(5): 220-223 (2018) - 2016
- [j3]Xiaofeng Wang, Tie Zhang, Yuping Qin:
Efficient two-step derivative-free iterative methods with memory and their dynamics. Int. J. Comput. Math. 93(8): 1423-1446 (2016) - [j2]Yuping Qin, Junnan Guo, Aihua Zhang:
A novel extreme learning fault diagnosis based supervision applied to mathematical formula contrastive analysis. Neurocomputing 177: 266-273 (2016) - 2015
- [j1]Xiaofeng Wang, Yuping Qin, Wei-Yi Qian, Sheng Zhang, Xiaodong Fan:
A Family of Newton Type Iterative Methods for Solving Nonlinear Equations. Algorithms 8(3): 786-798 (2015) - 2012
- [c4]Yuping Qin, Yawei Tang, Shuxian Lun, Yandong Guo:
A multi-label incremental learning algorithm. FSKD 2012: 851-854 - 2011
- [c3]Yuping Qin, Shuxian Lun, Qiangkui Leng, Yandong Guo:
A hyper ellipsoidal incremental learning algorithm. FSKD 2011: 1500-1503 - 2010
- [c2]Yuping Qin, Qiangkui Leng, Xiangna Meng, Qian Luo:
A new incremental learning algorithm based on hyper-sphere SVM. FSKD 2010: 2340-2343
2000 – 2009
- 2007
- [c1]Yuping Qin, Qing Ai, Xiukun Wang, Xiangna Li:
Study on Classification Algorithm of Multi-subject Text. SNPD (2) 2007: 435-438
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
