default search action
Nan Qu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Zhaoyang Qu, Zhenming Zhang, Nan Qu, Yuguang Zhou, Yang Li, Tao Jiang, Min Li, Chao Long:
Extraction of Typical Operating Scenarios of New Power System Based on Deep Time Series Aggregation. CoRR abs/2408.14493 (2024) - 2023
- [j12]Jie Cao, Bowen He, Nan Qu, Jiaxin Zhang, Chaoqiang Liu, Yaowei Liu, Chin-Ling Chen
:
Benefits Evaluation Method of an Integrated Energy System Based on a Fuzzy Comprehensive Evaluation Method. Symmetry 15(1): 84 (2023) - 2022
- [j11]Mingqing Liao
A high-efficient strain-stress method for calculating higher-order elastic constants from first-principles. Comput. Phys. Commun. 280: 108478 (2022) - [j10]Nan Qu, Bingbing Li, Rubayet Shafin Bradley Shafin
Angle-Based Downlink Beam Selection and User Scheduling for Massive MIMO Systems. IEEE Trans. Wirel. Commun. 21(10): 8077-8089 (2022) - 2021
- [j9]Meijiao Liu
Corrections to "A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem". IEEE Access 9: 18549 (2021) - [j8]Mingqing Liao
Elastic3rd: A tool for calculating third-order elastic constants from first-principles calculations. Comput. Phys. Commun. 261: 107777 (2021) - [j7]Mingqian Liu
Energy and Spectrum Efficient Blind Equalization With Unknown Constellation for Air-to-Ground Multipath UAV Communications. IEEE Trans. Green Commun. Netw. 5(3): 1357-1368 (2021) - [j6]Mingqian Liu
Signal Estimation in Cognitive Satellite Networks for Satellite-Based Industrial Internet of Things. IEEE Trans. Ind. Informatics 17(3): 2062-2071 (2021) - [j5]Nan Qu, Lingjia Liu
Interference Alignment Meets Multi-Cell Multi-User Massive FD-MIMO Systems in DoA-Based Precoding. IEEE Trans. Wirel. Commun. 20(11): 7460-7474 (2021) - [c4]Mingqian Liu, Nan Qu, Bingbing Li:
Blind Constellation Identification for MQAM in Hybrid Satellite-Terrestrial Networks. IWCMC 2021: 212-216 - 2020
- [j4]Meijiao Liu
A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem. IEEE Access 8: 202508-202521 (2020)
2010 – 2019
- 2018
- [j3]Zhaoyang Qu, Yu Zhang
Method for Quantitative Estimation of the Risk Propagation Threshold in Electric Power CPS Based on Seepage Probability. IEEE Access 6: 68813-68823 (2018) - 2016
- [j2]Wei An, Nan Qu, Fang-Ming Shao, Xiangjun Xiong, Song Ci:
Coverage hole problem under sensing topology in flat wireless sensor networks. Wirel. Commun. Mob. Comput. 16(5): 578-589 (2016) - [c3]Zhaoyang Qu, Wei Ding, Nan Qu, Jia Yan, Ling Wang:
A Novel Clustering Algorithm for Large-Scale Graph Processing. ICIC (3) 2016: 349-358 - 2012
- [c2]Nan Qu:
On model construction for modal mu-calculus. TASE 2012: 257-260 - 2010
- [j1]Nan Qu, Shingo Yamaguchi, Qi-Wei Ge:
Parallel Degree of Well-Structured Workflow Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(12): 2730-2739 (2010)
2000 – 2009
- 2008
- [c1]Mingren Chai, Nan Qu, Ying Jiang:
Tree Process Calculus. FICS 2008: 269-284
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-09-30 00:07 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: