Yong Lai

Dr. Yong Lai

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
30 August 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
Yirui WuYirui Wu
Yirui Wu
HCHao Cao
Hao Cao
YLYong Lai
Yong Lai
LZLiang Zhao
Liang Zhao
XDXiaoheng Deng
Xiaoheng Deng
Shaohua WanShaohua Wan
Shaohua Wan
Digital twins (DT) and mobile networks have evolved forms of intelligence in Internet of Things (IoT). In this work, we consider a Digital Twin Mobile Network (DTMN) scenario with few multimedia samples. Facing challenges of knowledge extraction with few samples, stable interaction with dynamic changes of multimedia data, time and privacy saving in low-resource mobile network, we propose an edge computing and few-shot learning featured intelligent framework. Considering time-sensitive property of transmission and privacy risks of directly uploads in mobile network, we deploy edge computing to locally run networks for analysis, thus saving time to offload computing request and enhancing privacy by encrypting original data. Inspired by remarkable relationship representation of graphs, we build Graph Neural Network (GNN) in cloud to map physical mobile systems to virtual entities with DT, thus performing semantic inferences in cloud with few samples uploaded by edges. Occasionally, node features in GNN could converge to similar, non-discriminative embeddings, causing catastrophic unstable phenomena. An iterative reweight and drop structure (IRDS) is thus constructed in cloud, which nonetheless contributes stability with respect to edge uncertainty. As part of IRDS, a drop Edge&Node scheme is proposed to randomly remove certain nodes and edges, which not only enhances distinguished capability of graph neighbor patterns, but also offers data encryption with random strategy. We show one implementation case of image classification in social network, where experiments on public datasets show that our framework is effective with user-friendly advantages and significant intelligence.

15 July 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
YZYupeng Zhou
Yupeng Zhou
JLJinshu Li
Jinshu Li
YLyang liu
yang liu
SLShuai Lv
Shuai Lv
YLYong Lai
Yong Lai
JWJianan Wang
Jianan Wang
The minimum weight vertex independent dominating set (MWVIDS) problem is an important version of the minimum independent dominating set. The MWVIDS problem has a number of applications in many fields. However, the MWVIDS problem is known to be NP-hard and thus computationally challenging. In this work, we present the improved memetic algorithm called MSSAS for solving the MWVIDS problem. The proposed MSSAS algorithm combines probability-based dynamic optimization (PDO) (to generate good and diverse offspring solutions by assembling elements of existing good solutions) as well as a local search phase named C_LS (to seek high-quality local optima by combining the idea of constrained-based two-level configuration checking strategy and tabu mechanism). The extensive results on popular DIMACS and BHOLIB benchmarks demonstrate that MSSAS competes favorably with the state-of-the-art algorithms. In addition, we analyze the benefits of the newly raised components including two above proposed ideas with our memetic framework. It is worth mentioning that the combination of both components has excellent effects for the MWVIDS problem.

14 August 2012 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
YLYong Lai
Yong Lai
DLDayou Liu
Dayou Liu
Shengsheng WangShengsheng Wang
Shengsheng Wang

23 July 2025
Verified
Book Chapter
Open access
PDF file
YLYong Lai
Yong Lai
KMKuldeep S Meel
Kuldeep S Meel
RYRoland H. C. Yap
Roland H. C. Yap
Knowledge compilation (KC) involves compiling propositional constraints into tractable target languages which in turn efficiently support multiple analyses or queries of the constraints. Solving these queries plays a crucial role in the synthesis and verification of hardware and software systems. Recently, we proposed the target language, Constrained Conjunction & Decision Diagrams (CCDD), experimentally shown to be promising for individual model counting queries. Here, we present the compiler, $$\textsf{Panini}$$ Panini , which compiles CNF into CCDD. $$\textsf{Panini}$$ Panini supports a range of queries. We present an empirical evaluation focusing on two fundamental queries, uniform sampling and (multiple) model counting, with a wide range of applications. While counting and sampling have witnessed significant performance improvements over the years, scalability still remains the primary challenge. Our evaluation over 600 instances from model counting competitions 2022–2024 show that $$\textsf{Panini}$$ Panini achieves state of art compilation by solving 322 instances, which is 183, 148, and 38 more than Dsharp, miniC2D, and D4 respectively. Secondly, on repetitive tasks, $$\textsf{Panini}$$ Panini solves 53 and 50 more instances than ExactMC and SharpSAT-TD for model counting, and 175 and 132 more instances than SPUR and KUS for uniform sampling, respectively.

20 September 2022 in Journal of Experimental & Theoretical Artificial Intelligence
Verified
Journal Article
Closed access
SLShuai Lü
Shuai Lü
TZTongbo Zhang
Tongbo Zhang
YXYue Xu
Yue Xu
WZWenbo Zhou
Wenbo Zhou
YLYong Lai
Yong Lai
Propositional model counting is the problem of computing the satisfying assignments count of a given CNF formula. Due to the weak solving ability of the existing exact model counters in large-scale problems, approximate model counting has been proposed as a practical alternative to exact model counting. Most of the best current approaches are based on XOR constraints for approximate model counting, also known as the hashing-based method. In this paper, a new approximate model counter using short XOR constraints is proposed, which integrates bounded solving and controllable randomisation. By constantly adding short XOR constants, the solution space has been reduced to a smaller one. However, a smaller scale of solution space may result in worse result accuracy. Therefore, by limiting the scale of solution space that applies XOR constraints, bounded solving effectively increases the accuracy of a model counter. Controllable randomisation makes use of backbone variables and the constraint level among variables, such that the short XOR constraints can reach the same reduction effect on solution space as the long ones. It improves the quality of XOR constraints as well as the SAT solving efficiency. Experimentally, we demonstrate that in almost every benchmark used in well-known ApproxMC2 and STAC_CNF, our approach outperforms the existing approximate model counters in both accuracy and efficiency.