Shuai Zhao

Beijing University of Posts and Telecommunications

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Bo Cheng

Nanjing University

Junliang Chen

Henan University of Science and Technology

Shoulu Hou

Beijing University of Posts and Telecommunications

Le Yu

Tsinghua University

Shengjie Li

Beijing University of Posts and Telecommunications

Tongguang Zhang

Beijing University of Posts and Telecommunications

Cheng Bo

Zhejiang Normal University

Hao Yang

Huawei Technologies (China)

Yongyang Cheng

China Telecom (China)

Xu Wang

Huazhong Agricultural University

Cooperative Institutions

Beijing University of Posts and Telecommunications

Chinese Academy of Sciences

University of Chinese Academy of Sciences

Shanghai Jiao Tong University

Tsinghua University

Guilin University of Electronic Technology

Peking University

National University of Defense Technology

Fudan University

Tianjin University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Integrating Subgraph-aware Relation and DirectionReasoning for Question Answering

arXiv (Cornell University) (2021)

Xu Wang Shuai Zhao Bo Cheng Jiale Han Yingting Li

Question Answering (QA) models over Knowledge Bases (KBs) are capable of providing more precise answers by utilizing relation information among entities. Although effective, most of these models solely rely on fixed relation representations to obtain answers for different question-related KB subgraphs. Hence, the rich structured information of these subgraphs may be overlooked by the relation representation vectors. Meanwhile, the direction information of reasoning, which has been proven effective for the answer prediction on graphs, has not been fully explored in existing work. To address these challenges, we propose a novel neural model, Relation-updated Direction-guided Answer Selector (RDAS), which converts relations in each subgraph to additional nodes to learn structure information. Additionally, we utilize direction information to enhance the reasoning ability. Experimental results show that our model yields substantial improvements on two widely used datasets.

Representation

10.48550/arxiv.2104.00218

Cite

Citations (0)

HiBERT: Detecting the illogical patterns with hierarchical BERT for multi-turn dialogue reasoning

Neurocomputing (2022)

Wang Xu Hainan Zhang Shuai Zhao Hongshen Chen Bo Cheng

Utterance

Representation

ENCODE

10.1016/j.neucom.2022.12.038

Cite

Citations (2)

High-performance chirped fiber Bragg gratings by dithering method

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE (2004)

Wei Shi Shuai Zhao Qian Lin Yanlin Zhang Yuanzhong Xu

Apodization is the key technique to improve the performance of Chirped Fiber Bragg Grating (CFBG). In this paper, the theoretical analysis on apodization by dithering method is presented. For comparison, CFBGs are manufactured respectively in dithering and scanning method, while employing the same apodization function. The result shows the former is more competent for its outstanding characteristics such as symmetrical reflection spectrum, low group delay ripple, and flexibility.

Apodization

Dither

Fiber Bragg Grating

Chirp

Side lobe

10.1117/12.521878

Cite

Citations (0)

L-WMxD: Lexical based Webmail XSS Discoverer

Zhushou Tang Haojin Zhu Zhenfu Cao Shuai Zhao

XSS (Cross-Site Scripting) is a major security threat for web applications. Due to lack of source code of web application, fuzz technique has become a popular approach to discover XSS in web application except Webmail. This paper proposes a Webmail XSS fuzzer called L-WMxD (Lexical based Webmail XSS Discoverer). L-WMxD , which works on a lexical based mutation engine, is an active defense system to discover XSS before the Webmail application is online for service. The engine is initialized by normal JavaScript code called seed. Then, rules are applied to the sensitive strings in the seed which are picked out through a lexical parser. After that, the mutation engine issues multiple test cases. Newly-generated test cases are used for XSS test. Two prototype tools are realized by us to send the newly-generated test cases to various Webmail servers to discover XSS vulnerability. Experimental results of L-WMxD are quite encouraging. We have run L-WMxD over 26 real-world Webmail applications and found vulnerabilities in 21 Webmail services, including some of the most widely used Yahoo!Mail, Mirapoint Webmail and ORACLE' Collaboration Suite Mail.

Cross-Site Scripting

Fuzz testing

Code (set theory)

10.1109/infcomw.2011.5928954

Cite

Citations (12)

GMAT-DU: Traffic Anomaly Prediction With Fine Spatiotemporal Granularity in Sparse Data

IEEE Transactions on Intelligent Transportation Systems (2023)

Shuai Zhao Daxing Zhao Ruiqiang Liu Zhen Xia Bo Chen

The fine-grained prediction of traffic anomalies is crucial for Traffic Management Bureau to alleviate congestion and avoid public safety incidents. While in practice, the fine-grained prediction is very challenging due to two issues. 1) Data sparsity . At the fine-grained setting, missing data is inevitable and widespread on spatial and temporal dimension. Existing methods have weak performance as they do not handle missing data properly. 2) Data distribution mutation . At the fine-grained setting, the traffic conditions of adjacent road segments are sometimes completely different, invalidating existing spatiotemporal smoothing-based methods. This paper proposes GMAT-DU, a novel model that aims to predict traffic anomaly from sparse data in fine-grained manner. To solve the first issue, we propose a Decay Unrolling (DU) mechanism to make the model applicable to sparse datasets. The performance will be progressively enhanced by the spatiotemporal unrolling of high-impact neighbors. For the second issue, we combine the meta-features of roads with correlations between roads, which are learnt from road semantic information and historical spatiotemporal data, and make the model focusing on the high-impact neighbors by a Graph Meta-features based ATtention (GMAT) mechanism. Extensive experiments on two real-world datasets validate the effectiveness of our method. The experiment results show the significant advantages against the state-of-the-art models.

Granularity

Smoothing

Executable

10.1109/tits.2023.3249409

Cite

Citations (7)

Accelerated Particle Filter for Real-Time Visual Tracking With Decision Fusion

IEEE Signal Processing Letters (2018)

Shengjie Li Shuai Zhao Bo Cheng Junliang Chen

Correlation-filter-based trackers, showing strong discrimination ability in challenging situations, have recently achieved superior performance in visual tracking. However, because the model treats the tracker's predictions in new frames as training data, the filter can be contaminated by small incorrect predictions, which cause model drift. Particle-filter-based trackers usually produce more accurate results due to the richer image representations used in prediction, but suffer when the environments are complex throughout an image sequence. In this letter, we propose an innovative real-time algorithm, which combines the particle filter with correlation filters in the prediction stage, enabling accurate predictions by the particle filter and alleviating model drift. Moreover, an effective decision fusion strategy is proposed to get more precise object predictions, thus further enhancing the overall tracking performance. Extensive evaluations on the OTB-2013 benchmark demonstrate that the proposed tracker is very promising compared with the state-of-the-art trackers, while operating over 85 frames/s.

BitTorrent tracker

Benchmark (surveying)

Tracking (education)

Sensor Fusion

10.1109/lsp.2018.2843524

Cite

Citations (8)

Efficient Particle Scale Space for Robust Tracking

IEEE Signal Processing Letters (2020)

Shengjie Li Shuai Zhao Bo Cheng Junliang Chen

Both siamese network and correlation filter (CF) based trackers have recently achieved superior performance in tracking scenarios with various challenging factors. For the challenging scale variations, most of these state-of-the-art trackers usually employ multiple patches with different bounding boxes to estimate the target size. However, these patches are fixedly generated by the hand-crafted bounding boxes in spatial domains, which may be suboptimal to cope with scale changes due to the lack of temporal scale information. In this letter, we tackle the problem of efficient scale estimation by presenting a generic scheme that allows the adaptive generation of bounding boxes in temporal domains and improves the tracking accuracy. Specifically, we introduce the novel particle scale space by refining the conventional particle filter and extend this space to many siamese and CF trackers for robust tracking. Extensive experiments are performed on the OTB2013, OTB50, OTB100 and UAVDT datasets. The proposed variants maintain at least almost identical frame-rates with baseline trackers and perform favorably against them, as well as other state-of-the-art trackers.

BitTorrent tracker

Minimum bounding box

Tracking (education)

Bounding overwatch

10.1109/lsp.2020.2973098

Cite

Citations (2)

Performance enhancement of multipath TCP in mobile Ad Hoc networks

Tongguang Zhang Shuai Zhao Bingfei Ren Yulong Shi Bo Cheng

In some special circumstances, e.g. tsunamis, floods, battlefields, earthquakes, etc., communication infrastructures are damaged or non-existent, as well as unmanned aerial vehicle (UAV) cluster. For the communication between people or UAVs, UAVs or mobile smart devices (MSDs) can be used to construct Mobile Ad Hoc Networks (MANETs), and Multipath TCP (MPTCP) can be used to simultaneously transmit in one TCP connection via multiple interfaces of MSDs. However the original MPTCP subpaths creating algorithm can establish multiple subpaths between two adjacent nodes, thus cannot achieve true concurrent data transmission. To solve this issue, we research and improve both the algorithm of adding routing table entries and the algorithm of establishing subpaths to offer more efficient use of multiple subpaths and better network traffic load balancing. The main works are as follows: (1) improve multi-hop routing protocol; (2) run MPTCP on UAVs or MSDs; (3) improve MPTCP subpaths establishment algorithm. The results show that our algorithms have better performance than the original MPTCP in achieving higher data throughput.

Multipath TCP

10.1109/icnp.2017.8117578

Cite

Citations (2)

Research, implementation, and improvement of MPTCP on mobile smart devices

International Journal of Computers and Applications (2018)

Tongguang Zhang Shuai Zhao Bo Cheng Bingfei Ren Junliang Chen

As more and more mobile smart devices (MSDs) are equipped with multiple wireless network interfaces (e.g. WiFi, cellular, etc.), MultiPath TCP (MPTCP) can enable MSDs to send data over several interfaces or paths and can achieve better throughput and robust data transfers. MPTCP thus attracts an increasing interest from both academia and industry. This paper systematically studies MPTCP and clearly describes the relationship between each portions of MPTCP. Up to now, MPTCP has not been widely used in the mobile Internet, one of the reasons is that it is a challenge to research, implement and test MPTCP on the actual MSDs. To overcome the shortcoming of the existing researches on MPTCP being mainly limited to network simulators, a novel approach to port MPTCP to MSDs is proposed, which includes three main steps: first, run real mobile operating system (MOS) on VirtualBox; second, port MPTCP to MOS on VirtualBox and test; third, directly copy modified files in the second step to real MOS on MSD and test. By using this method, MPTCP V0.90 is successfully ported to a real smartphone running Android-7.1.1 for the first time. The validity of the method is proved by experiments. In addition, this paper improves the subpath establishment algorithm of MPTCP and applies the improved MPTCP to Mobile Ad Hoc Network (MANET) constructed by MSDs, the test result shows that our algorithm has better performance than the original MPTCP in achieving higher data throughput.

10.1080/1206212x.2018.1455020

Cite

Citations (5)

A Novel CAN Tree Coordinate Routing in Content-Addressable Network

DOAJ (DOAJ: Directory of Open Access Journals) (2014)

Zhongtao Li Shuai Zhao Ge Chuan Shichao Gao

Content (measure theory)

Tree (set theory)

Source

Cite

Citations (3)