default search action
Xinmin Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j10]Rui Zhou
, Deming Lei, Xinmin Zhou:
Multi-Objective Energy-Efficient Interval Scheduling in Hybrid Flow Shop Using Imperialist Competitive Algorithm. IEEE Access 7: 85029-85041 (2019) - [j9]Shan Zhong, Xinmin Zhou:
University-Enterprise Cooperative Education Mode in the Context of Emerging Engineering Disciplines. Int. J. Emerg. Technol. Learn. 14(8): 82-96 (2019) - [j8]Lina Tan, Kai Hu, Xinmin Zhou, Rongyuan Chen, Weijin Jiang:
Print-scan invariant text image watermarking for hardcopy document authentication. Multim. Tools Appl. 78(10): 13189-13211 (2019) - 2018
- [j7]Xiaolong Li
Plils: A Practical Indoor Localization System through Less Expensive Wireless Chips via Subregion Clustering. Sensors 18(1): 205 (2018) - 2017
- [c5]Xinmin Zhou, Wei Chen, Qingyong Zhang, Tao Zeng:
Central Air-conditioning Control System Based on Fuzzy PID Controller. ICMSS 2017: 326-329 - 2011
- [j6]Jian Fu, Haibo He, Xinmin Zhou:
Adaptive Learning and Control for MIMO System Based on Adaptive Dynamic Programming. IEEE Trans. Neural Networks 22(7): 1133-1148 (2011) - 2010
- [j5]Xinmin Zhou, Sichun Wang, Shuchu Xiong, Jianping Yu:
Attack Model and Performance Evaluation of Text Digital Watermarking. J. Comput. 5(12): 1933-1941 (2010)
2000 – 2009
- 2009
- [j4]Ying Zheng, Guangyao Li, Xiehua Sun, Xinmin Zhou:
Fast edge integration based active contours for color images. Comput. Electr. Eng. 35(1): 141-149 (2009) - [j3]Ying Zheng, Guangyao Li, Xiehua Sun, Xinmin Zhou:
A geometric active contour model without re-initialization for color images. Image Vis. Comput. 27(9): 1411-1417 (2009) - [j2]Ying Zheng, Guangyao Li, Xiehua Sun, Xinmin Zhou:
Geometric active contours without re-initialization for image segmentation. Pattern Recognit. 42(9): 1970-1976 (2009) - 2008
- [j1]Caiming Zhong, Duoqian Miao, Ruizhi Wang, Xinmin Zhou:
DIVFRP: An automatic divisive hierarchical clustering method based on the furthest reference points. Pattern Recognit. Lett. 29(16): 2067-2077 (2008) - [c4]Jian Fu, Qing Liu, Xinmin Zhou, Kui Xiang, Zhigang Zeng:
An adaptive variable strategy pareto differential evolution algorithm for multi-objective optimization. IEEE Congress on Evolutionary Computation 2008: 648-652 - [c3]Li Pan, Weidong Zhao, Zhicheng Wang, Xinmin Zhou:
A State Class Approach to Time Petri Nets with Weak Semantics. CSSE (2) 2008: 772-775 - [c2]Huayun Yan, Yunliang Jiang, Xinmin Zhou:
A Bidirectional Chord System Based on Base-k Finger Table. ISCSCT (1) 2008: 384-388
1990 – 1999
- 1993
- [c1]Yibing Yang, Tao Luo, Zhenya He, Xinmin Zhou:
Statistical model of the noise in speckle pattern and suboptimal digital image filtering method. Visual Information Processing 1993: 73-80
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-04-25 05:43 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: