Fengting Yan

Dr. Fengting Yan


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
21 August 2020 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
FYFengting Yan
Fengting Yan
YHYonghao Hu
Yonghao Hu
JJJinyuan Jia
Jinyuan Jia
ZAZihao Ai
Zihao Ai
KTKai Tang
Kai Tang
XLXiang Liu
Xiang Liu

1 August 2019 in Frontiers of Information Technology & Electronic Engineering
Verified
Journal Article
Closed access
PDF file
FYFengting Yan
Fengting Yan
YHYong-Hao Hu
Yong-Hao Hu
JJJin-Yuan Jia
Jin-Yuan Jia
QGQing-Hua Guo
Qing-Hua Guo
HZHe-Hua Zhu
He-Hua Zhu
ZPZhi-Geng Pan
Zhi-Geng Pan
There are many bottlenecks that limit the computing power of the Mobile Web3D and they need to be solved before implementing a public fire evacuation syste

29 January 2020 in IEEE Access
Verified
Journal Article
Open access
JCJue Chen
Jue Chen
FYFengting Yan
Fengting Yan
DLDongmei Li
Dongmei Li
SCShanshan Chen
Shanshan Chen
XQXihe Qiu
Xihe Qiu
Multicast is an efficient tool to transfer the same data from a publisher to multiple subscribers, and its performance relies critically on the resiliency. Compared with traditional networks, the centralized control and flexible programmability of the Software Defined Network (SDN) is more beneficial for solving the failure recovery problem. This paper presents a design of an OpenFlow controller which can recover and reconstruct a multicast tree rapidly, while reducing the Ternary Content Addressable Memory (TCAM) consumption simultaneously. We choose the protection mechanism, and calculate all the backup paths after the topology information is mastered by the controller. When a failure occurs, affected switches can enable the use of backup paths to continue forwarding multicast packets. As duplicate packets may exist after the failure recovery, the reconstruction of a tree is required by modifying only a small fraction of forwarding rules. The performance evaluations demonstrate that our proposed method recovers a multicast tree with a high speed and low cost. On one hand, the maximum failure recovery time of two protection-based methods including our proposed method is less than 11 ms, while that of two restoration-based methods is 44 ms and 30 ms, respectively. On the other hand, the amount of backup forwarding entries required by another protection-based method exceed our proposed method as long as 3 or more multicast groups exist in the network. Moreover, when our proposed method is adopted, the amount of backup forwarding entries per switch is less than 30, which can be ignored when compared with the capacity of SDN switches (a switch can support a few thousand forwarding rules).

31 January 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
YZYunxiang Zhu
Yunxiang Zhu
FYFengting Yan
Fengting Yan
Jeng-Shyang PanJeng-Shyang Pan
Jeng-Shyang Pan
LYLei Yu
Lei Yu
YBYuanfei Bai
Yuanfei Bai
ZSZhicai Shi
Zhicai Shi
The Phasmatodea population evolution algorithm (PPE) is a novel metaheuristic algorithm proposed in recent years, which simulates the evolutionary trend of stick insect population. In this article, a multigroup-based Phasmatodea population evolution algorithm with mutistrategy (MPPE) is proposed to further improve the overall performance of PPE. During the initialization period, the stick insect population is divided into multiple groups, and the step factor of the flower pollen algorithm is introduced into the population growth model of no more than half of the groups. This makes the population evolution trend diversified and prevents the algorithm from falling into the local optimal solution to a certain extent. In terms of intergroup communication, two communication strategies are adopted to mutate and replace the inferior particles, respectively, which improves the convergence speed and search ability of the algorithm. In the MPPE performance test, we compared it with PPE, five standard algorithms, and other parallel algorithms in CEC 2013 Benchmark Suite. Finally, this algorithm is applied to the IoT based electric bus scheduling for urban waterlogging situation, and the excellent performance of MPPE is verified comprehensively.

23 January 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
JLJiajia Luo
Jiajia Luo
HShongtao shan
hongtao shan
GZGaoyu Zhang
Gaoyu Zhang
GYGeorge X Yuan
George X Yuan
SZShuyi Zhang
Shuyi Zhang
ZLZhiwei Li
Zhiwei Li
The textual similarity task, which measures the similarity between two text pieces, has recently received much attention in the natural language processing (NLP) domain. However, due to the vagueness and diversity of language expression, only considering semantic or syntactic features, respectively, may cause the loss of critical textual knowledge. This paper proposes a new type of structure tree for sentence representation, which exploits both syntactic (structural) and semantic information known as the weight vector dependency tree (WVD-tree). WVD-tree comprises structure trees with syntactic information along with word vectors representing semantic information of the sentences. Further, Gaussian attention weight is proposed for better capturing important semantic features of sentences. Meanwhile, we design an enhanced tree kernel to calculate the common parts between two structures for similarity judgment. Finally, WVD-tree is tested on widely used semantic textual similarity tasks. The experimental results prove that WVD-tree can effectively improve the accuracy of sentence similarity judgments.

1 March 2024 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
Shu-Chuan ChuShu-Chuan Chu
Shu-Chuan Chu
XYXu Yuan
Xu Yuan
Jeng-Shyang PanJeng-Shyang Pan
Jeng-Shyang Pan
TWTsu-Yang Wu
Tsu-Yang Wu
FYFengting Yan
Fengting Yan