Rongling Lang

Dr. Rongling Lang


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
4 March 2016 in Sensors
Verified
Journal Article
Open access
PDF file
WLWutao Li
Wutao Li
ZHZhigang Huang
Zhigang Huang
RLRongling Lang
Rongling Lang
HQHonglei Qin
Honglei Qin
KZKai Zhou
Kai Zhou
YCYongbin Cao
Yongbin Cao
Interferences can severely degrade the performance of Global Navigation Satellite System (GNSS) receivers. As the first step of GNSS any anti-interference measures, interference monitoring for GNSS is extremely essential and necessary. Since interference monitoring can be considered as a classification problem, a real-time interference monitoring technique based on Twin Support Vector Machine (TWSVM) is proposed in this paper. A TWSVM model is established, and TWSVM is solved by the Least Squares Twin Support Vector Machine (LSTWSVM) algorithm. The interference monitoring indicators are analyzed to extract features from the interfered GNSS signals. The experimental results show that the chosen observations can be used as the interference monitoring indicators. The interference monitoring performance of the proposed method is verified by using GPS L1 C/A code signal and being compared with that of standard SVM. The experimental results indicate that the TWSVM-based interference monitoring is much faster than the conventional SVM. Furthermore, the training time of TWSVM is on millisecond (ms) level and the monitoring time is on microsecond (μs) level, which make the proposed approach usable in practical interference monitoring applications.

13 July 2017 in PLOS ONE
Verified
Journal Article
Open access
PDF file
RLRongling Lang
Rongling Lang
HXHong Xiao
Hong Xiao
ZLZi Li
Zi Li
LYLihong Yu
Lihong Yu
In this paper, an anti-jamming method, which turns the single objective optimization problem into a multi-objective optimization problem by utilizing 2-norm, is proposed. The proposed jamming suppression method can reduce the wide nulls and wrong nulls problems, which are generated by the common adaptive nulling methods. Therefore a better signal-noise-ratio (SNR) can be achieved, especially when the jammers are close to satellite signals. It can also improve the robustness of the algorithm. The effectiveness of the proposed method is evaluated by simulation and practical outdoor experiments with the GPS L1 band C/A signals. The experimental results show that with the dedicated method, the nulls targeting at the corresponding jammers become narrower and the wrong nulls can be eliminated.

13 January 2023 in Entropy
Verified
Journal Article
Open access
PDF file
ZWZiyuan Wang
Ziyuan Wang
JTJianhua Tu
Jianhua Tu
RLRongling Lang
Rongling Lang
Given two graphs G and H, the mapping of f:V(G)→V(H) is called a graph homomorphism from G to H if it maps the adjacent vertices of G to the adjacent vertices of H. For the graph G, a subset of vertices is called a dissociation set of G if it induces a subgraph of G containing no paths of order three, i.e., a subgraph of a maximum degree, which is at most one. Graph homomorphisms and dissociation sets are two generalizations of the concept of independent sets. In this paper, by utilizing an entropy approach, we provide upper bounds on the number of graph homomorphisms from the bipartite graph G to the graph H and the number of dissociation sets in a bipartite graph G.

1 March 2018 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
RLRongling Lang
Rongling Lang
ZSZhen Su
Zhen Su
KZKai Zhou
Kai Zhou
SMShouxian Mou
Shouxian Mou
Interference can severely degrade the performance of the Global navigation satellite system (GNSS) receivers. Therefore it is important to detect the interference accurately and efficiently. Both the pre-correlation method and post-correlation method currently in use require certain strict pre-conditions, which limit their application. A new pre-correlation method that could be applied in most cases, called GNSS signal driven (GSD) method is proposed. The essence of the GSD method is to use classification techniques to detect the interference, based on the feature parameters extracted directly from the GNSS signals. The Support vector machine (SVM) and the Competitive agglomeration (CA) are adopted as the classification algorithms. When a classifier can be trained in advance, the SVM method is used, otherwise the CA method is adopted. Both methods show satisfying detection accuracy, especially the SVM method, whereas the robust CA method has an even wider application. The effectiveness of the proposed method is verified properly by experiments with the GPS L1 band Coarse/acquisition (C/A) signals.

1 January 2021 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
JTJianhua Tu
Jianhua Tu
LZLei Zhang
Lei Zhang
JDJunfeng Du
Junfeng Du
RLRongling Lang
Rongling Lang
QTQinghai Province Key Laboratory of Tibetan Information Processing and Machine Translation
Qinghai Province Key Laboratory of Tibetan Information Processing and Machine Translation
MPMinistry of Education Key Laboratory of Tibetan Information Processing
Ministry of Education Key Laboratory of Tibetan Information Processing
In a graph $ G $, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-hard even for bipartite graphs and is called the maximum dissociation set problem. The complexity of the maximum dissociation set problem in various sub-classes of graphs has been extensively studied in the literature. In this paper, we study the maximum dissociation problem from different perspectives and characterize the vertices belonging to all maximum dissociation sets, and no maximum dissociation set of a tree. We present a linear time recognition algorithm which can determine whether a given vertex in a tree is contained in all (or no) maximum dissociation sets of the tree. Thus for a tree with $ n $ vertices, we can find all vertices belonging to all (or no) maximum dissociation sets of the tree in $ O(n^2) $ time.

30 July 2021 in arXiv
Verified
Preprint
Open access
PDF file
JTJianhua Tu
Jianhua Tu
LZLei Zhang
Lei Zhang
JDJunfeng Du
Junfeng Du
RLRongling Lang
Rongling Lang
In a graph G, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-hard even for bipartite graphs and is called the maximum dissociation set problem. The complexity of maximum dissociation set problem in various subclasses of graphs has been extensively studied in the literature. In this paper, we study the maximum dissociation problem from different perspectives and characterize the vertices belonging to all maximum dissociation sets, and to no maximum dissociation set of a tree. We present a linear time recognition algorithm which can determine whether a given vertex in a tree is contained in all (or no) maximum dissociation sets of the tree. Thus for a tree with n vertices, we can find all vertices belonging to all (or no) maximum dissociation sets of the tree in O(n^2) time.