Mang Wang

Mang Wang

Auto-generated profile, based on publicly available information

Mang Wang

Alibaba Group

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 August 2017 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
MWMang Wang
Mang Wang
BLBin Li
Bin Li
GZGuofu Zhang
Guofu Zhang
XYXin Yao
Xin Yao
Fitness landscape analysis (FLA) is an important approach for studying how hard problems are for metaheuristic algorithms to solve. Static FLA focuses on extracting the properties of a problem and does not consider any information about the optimization algorithms; thus, it is not adequate for indicating whether a particular algorithm is suitable for solving a problem. By contrast, dynamic FLA considers the behavior of algorithms in combination with the properties of an optimization problem to determine the effectiveness of a given algorithm for solving that problem. However, previous dynamic FLA approaches are all individually based and lack statistical significance. In this paper, the concept of population evolvability is presented, as an extension of dynamic FLA, to quantify the effectiveness of population-based metaheuristic algorithms for solving a given problem. Specifically, two measures of population evolvability are defined that describe the probability that a population will obtain improved solutions to a problem and its ability to do so. Then, a combined measure is derived from these two measures to represent the overall population evolvability. Subsequently, the significance and validity of the proposed measures are investigated through analytical and experimental studies. Finally, the utility of the proposed measures is illustrated in an application of algorithm selection for black-box optimization problems. High accuracy in selecting the best algorithm is observed in a statistical analysis, with a low computational cost in terms of fitness evaluations.

13 August 2013 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
Liang ZouLiang Zou
Liang Zou
MWMang Wang
Mang Wang
YSYi Shen
Yi Shen
JLJie Liao
Jie Liao
ALAo Li
Ao Li
MWMinghui Wang
Minghui Wang
Background: Dynamic protein phosphorylation is an essential regulatory mechanism in various organisms. In this capacity, it is involved in a multitude of signal transduction pathways. Kinase-specific phosphorylation data lay the foundation for reconstruction of signal transduction networks. For this reason, precise annotation of phosphorylated proteins is the first step toward simulating cell signaling pathways. However, the vast majority of kinase-specific phosphorylation data remain undiscovered and existing experimental methods and computational phosphorylation site (P-site) prediction tools have various limitations with respect to addressing this problem.Results: To address this issue, a novel protein kinase identification web server, PKIS, is here presented for the identification of the protein kinases responsible for experimentally verified P-sites at high specificity, which incorporates the composition of monomer spectrum (CMS) encoding strategy and support vector machines (SVMs). Compared to widely used P-site prediction tools including KinasePhos 2.0, Musite, and GPS2.1, PKIS largely outperformed these tools in identifying protein kinases associated with known P-sites. In addition, PKIS was used on all the P-sites in Phospho.ELM that currently lack kinase information. It successfully identified 14 potential SYK substrates with 36 known P-sites. Further literature search showed that 5 of them were indeed phosphorylated by SYK. Finally, an enrichment analysis was performed and 6 significant SYK-related signal pathways were identified.Conclusions: In general, PKIS can identify protein kinases for experimental phosphorylation sites efficiently. It is a valuable bioinformatics tool suitable for the study of protein phosphorylation. The PKIS web server is freely available athttp://bioinformatics.ustc.edu.cn/pkis.

8 February 2011 in Inorganic Chemistry
Verified
Journal Article
Closed access
LSLe Xin Song
Le Xin Song
SPShu Zhen Pan
Shu Zhen Pan
LZLin Zhu
Lin Zhu
MWMang Wang
Mang Wang
FDFang Yun Du
Fang Yun Du
JCjie chen
jie chen

1 June 2014 in Methods
Verified
Journal Article
Closed access
MWMang Wang
Mang Wang
HXHong Xia
Hong Xia
DSDongdong Sun
Dongdong Sun
ZCZhaoxiong Chen
Zhaoxiong Chen
MWMinghui Wang
Minghui Wang
ALAo Li
Ao Li

30 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
XPXiangyu Peng
Xiangyu Peng
KWKai Wang
Kai Wang
George Zheng Hong ZhuGeorge Zheng Hong Zhu
George Zheng Hong Zhu
MWMang Wang
Mang Wang
YYYang You
Yang You
Recent self-supervised contrastive learning methods greatly benefit from the Siamese structure that aims at minimizing distances between positive pairs. For high performance Siamese representation learning, one of the keys is to design good contrastive pairs. Most previous works simply apply random sampling to make different crops of the same image, which overlooks the semantic information that may degrade the quality of views. In this work, we propose ContrastiveCrop, which could effectively generate better crops for Siamese representation learning. Firstly, a semantic-aware object localization strategy is proposed within the training process in a fully unsupervised manner. This guides us to generate contrastive views which could avoid most false positives (i.e., object vs. background). Moreover, we empirically find that views with similar appearances are trivial for the Siamese model training. Thus, a center-suppressed sampling is further designed to enlarge the variance of crops. Remarkably, our method takes a careful consideration of positive pairs for contrastive learning with negligible extra training overhead. As a plug-and-play and framework-agnostic module, ContrastiveCrop consistently improves SimCLR, MoCo, BYOL, SimSiam by 0.4% ~ 2.0% classification accuracy on CIFAR-10, CIFAR-100, Tiny ImageNet and STL-10. Superior results are also achieved on downstream detection and segmentation tasks when pre-trained on ImageNet-1K.