default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanling Shao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j27]Yanling Shao
, Yuzhi Zhang, Wenyong Dong, Qikun Zhang, Pingping Shan, Junying Guo, Hairui Xu:
Enhancing adversarial attacks with resize-invariant and logical ensemble. Neural Networks 173: 106194 (2024)- 2023
- [j26]Yanling Shao, Wei Gao:
Complete Characterization of Chemical Trees with Maximal Augmented Zagreb Index. J. Appl. Math. Comput. 69(5): 3851-3870 (2023) - 2021
- [j25]Yubin Gao, Wei Gao, Yanling Shao:
The minimal Randić energy of trees with given diameter. Appl. Math. Comput. 411: 126489 (2021) - [j24]Wei Gao, Yanling Shao:
Oriented unicyclic graphs with minimal skew Randić energy. Contributions Discret. Math. 16(3): 93-110 (2021) - 2019
- [j23]Wenbin Chen, Yanling Shao, Lina Jia, Yanling Wang, Quan Zhang, Yu Shang, Yi Liu, Yan Chen, Yanli Liu, Zhiguo Gui:
Low-Dose CT Image Denoising Model Based on Sparse Representation by Stationarily Classified Sub-Dictionaries. IEEE Access 7: 116859-116874 (2019) - [j22]Yanling Shao, Yubin Gao:
The maximal geometric-arithmetic energy of trees with at most two branched vertices. Appl. Math. Comput. 362 (2019) - [j21]Yanling Shao, Wenyong Dong, Shanpo Ma, Xuejian Sun:
Enriching Classroom Teaching means by utilizing E-Learning Resources in Collaborative Edge and Core Cloud. Mechatron. Syst. Control. 47(2) (2019) - [j20]Yanling Shao, Chunlin Li, Hengliang Tang:
A data replica placement strategy for IoT workflows in collaborative edge and cloud environments. Comput. Networks 148: 46-59 (2019) - [j19]Yanling Shao, Chunlin Li, Zhao Fu, Leyue Jia, Youlong Luo:
Cost-effective replication management and scheduling in edge computing. J. Netw. Comput. Appl. 129: 46-61 (2019) - 2018
- [j18]Wenbin Chen, Yanling Shao, Yanling Wang, Quan Zhang, Yi Liu, Linhong Yao, Yan Chen, Guanru Yang, Zhiguo Gui:
A Novel Total Variation Model for Low-Dose CT Image Denoising. IEEE Access 6: 78892-78903 (2018) - [j17]Yanling Shao, Chunlin Li, Jinguang Gu, Jing Zhang, Youlong Luo:
Efficient jobs scheduling approach for big data applications. Comput. Ind. Eng. 117: 249-261 (2018) - [j16]Yunchang Liu, Chunlin Li, Youlong Luo, Yanling Shao, Jing Zhang:
Scheduling multimedia services in cloud computing environment. Enterp. Inf. Syst. 12(2): 218-235 (2018) - 2017
- [j15]Yanling Wang, Yanling Shao, Quan Zhang, Yi Liu, Yan Chen, Wenbin Chen, Zhiguo Gui:
Noise Removal of Low-Dose CT Images Using Modified Smooth Patch Ordering. IEEE Access 5: 26092-26103 (2017) - 2016
- [j14]Yanling Wang, Yanling Shao, Zhiguo Gui, Quan Zhang, Linhong Yao, Yi Liu:
A Novel Fractional-Order Differentiation Model for Low-Dose CT Image Processing. IEEE Access 4: 8487-8499 (2016) - 2014
- [j13]Yanling Shao, Yubin Gao:
On the second largest scrambling index of primitive matrices. Ars Comb. 113: 457-462 (2014) - 2013
- [j12]Yanling Shao, Yubin Gao:
The m-competition indices of symmetric primitive digraphs with loop. Ars Comb. 108: 217-223 (2013) - [j11]Yubin Gao, Yanling Shao:
The scrambling indices of primitive digraphs with exactly two cycles. Ars Comb. 108: 505-513 (2013) - 2012
- [j10]Xi Li, Yanling Shao, Yubin Gao:
A class of minimally spectrally arbitrary sign patterns. Ars Comb. 103: 311-319 (2012) - 2009
- [j9]Yubin Gao, Yihua Huang, Yanling Shao:
Bases of primitive non-powerful signed symmetric digraphs with loops. Ars Comb. 90 (2009) - [j8]Yubin Gao, Yanling Shao:
Bound on the exponents of a class of two-colored digraphs. Ars Comb. 90 (2009) - [j7]Yanling Shao, Yubin Gao:
The exponents of double vertex graphs. Ars Comb. 90 (2009) - [j6]Yanling Shao, Yubin Gao:
The local bases of primitive non-powerfull signed symmetric digraphs with loops. Ars Comb. 90 (2009) - [j5]Yubin Gao, Yanling Shao:
Double vertex digraphs of digraphs. Discret. Math. 309(8): 2432-2444 (2009) - [j4]Yanling Shao, Jian Shen, Yubin Gao:
The kth upper bases of primitive non-powerful signed digraphs. Discret. Math. 309(9): 2682-2686 (2009) - 2004
- [j3]Yubin Gao, Yanling Shao:
The Number of Negative Entries in a Sign Pattern Allowing Orthogonality. Graphs Comb. 20(3): 311-317 (2004) - 2001
- [j2]Yanling Shao, Yubin Gao:
The kth upper generalized exponent set for primitive matrices. Australas. J Comb. 23: 19-26 (2001) - 1999
- [j1]Yubin Gao, Yanling Shao:
The kth upper generalized exponent set for the class of non-symmetric primitive matrices. Australas. J Comb. 19: 191-202 (1999)
Conference and Workshop Papers
- 2019
- [c3]Yanling Shao, Wenyong Dong:
Considering User Distribution and Cost Awareness to Optimize Server Deployment. Big Data (CCF) 2019: 135-147 - 2016
- [c2]Yanling Shao, Chunlin Li, Wenyong Dong, Yunchang Liu:
Energy-Aware Dynamic Resource Allocation on Hadoop YARN Cluster. HPCC/SmartCity/DSS 2016: 364-371 - 2012
- [c1]Bo Ge, Yanling Shao, Yunxing Shu:
Uncorrelated Discriminant Isometric Projection for Face Recognition. ICICA (1) 2012: 138-145
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-06-10 21:25 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:
