Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liqun Wang

dblp:25/141 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 since 2021Databases, data management, data science and information retrieval · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 67% Computational science and engineering · 33%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering
computational geometry
0.112005
Improving conformational searches by geometric screening · Bioinform. 2005
Bioinformatics and computational biology › computational biophysics
conformational search
0.112005
Improving conformational searches by geometric screening · Bioinform. 2005
Bioinformatics and computational biology › molecular informatics › molecular modeling
molecular docking
0.112005
Improving conformational searches by geometric screening · Bioinform. 2005

Methods — techniques the papers use, named apart from their topics

geometric screening · 0.1energy minimization · 0.1
YearPublicationVenuePosition
2021 Multi-dimensional Prediction Model for Cell Traffic in City Scale
abstract
Traffic prediction is a classical time series prediction which has been investigated in different domains, but most existing models are proposed based on limited time or spatial scale. Mobile cellular network traffic prediction is of paramount importance for quality-of-service (QoS) and power management of the cellular base stations, especially in the 5G era. Through the statistical analysis of the real historical traffic data obtained in a city scale spanning across multiple months, this paper makes an in-depth study of the temporal characteristics and behavior rules of the model data traffic. Considering that the time series data show different changing rules under the different time dimensions, spatial dimensions and independent dimensions, a multi-dimensional recurrent neural network (MDRNN) prediction model is established to predict the future cell traffic volume over various temporal and spatial dimensions. The data of this paper are trained and tested over real data of a city, and the granularity of the proposed prediction model can be drilled down to the cell level. Compared with the traditional trend fitting method, the proposed model achieves mean absolute percentage error (MAPE) reduction of 6.56%, and provides guidance for energy efficiency optimization and power consumption reduction of base stations in various temporal and spatial dimensions.
Liqun Wang, Shufang Zhao, Xiuming Yue
Int. J. Pattern Recognit. Artif. Intell.2
2020 ℓ∞-induced output-feedback controller synthesis for positive nonlinear systems via T-S fuzzy model approach
Liqun Wang, Mou Chen, Jun Shen 0001
Fuzzy Sets Syst.2
2016 The Uniqueness and Greedy Method for Quadratic Compressive Sensing
abstract
Quadratic compressive sensing, as a nonlinear extension of compressive sensing, has attracted considerable attention in optical image, X-ray crystallography, transmission electron microscopy, etc. We introduce the concept of uniform s-regularity to study the uniqueness in quadratic compressive sensing and propose a greedy algorithm for the corresponding numerical optimization. Moreover, we prove the convergence of the proposed algorithm under the uniform s-regularity condition. Finally, we present numerical results to demonstrate the efficiency of the proposed method.
Lingchen Kong, Liqun Wang, Naihua Xiu
DSAA3
2005 Improving conformational searches by geometric screening
abstract
MOTIVATION: Conformational searches in molecular docking are a time-consuming process with wide range of applications. Favorable conformations of the ligands that successfully bind with receptors are sought to form stable ligand-receptor complexes. Usually a large number of conformations are generated and their binding energies are examined. We propose adding a geometric screening phase before an energy minimization procedure so that only conformations that geometrically fit in the binding site will be prompted for energy calculation. RESULTS: Geometric screening can drastically reduce the number of conformations to be examined from millions (or higher) to thousands (or lower). The method can also handle cases when there are more variables than geometric constraints. An early-stage implementation is able to finish the geometric filtering of conformations for molecules with up to nine variables in 1 min. To the best of our knowledge, this is the first time such results are reported deterministically. CONTACT: [email protected].
R. Allen White, Liqun Wang, Ron Goldman 0002, Lydia E. Kavraki, Brendan Hassett
Bioinform.3