检索结果-内蒙古大学图书馆

Structural Optimization of Causal Driven Model Based on Bayesian Network in High-dimensional Data Classification

学校读者我要写书评

暂无评论

Applied Mathematics and Nonlinear Sciences 2025年第1期10卷

作者： Li, Kuo Wang, Aimin Wang, Limin Zhao, Yuetan Zhu, Xinyu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Software Jilin University Changchun130012 China

The Bayesian network (BN) model, as a big data graph model that integrates causal inference and probabilistic representation, has received widespread attention and research in both academia and industry. However, with the advent of the big data era, traditional BN structure learning algorithms have encountered unprecedented challenges in processing high-dimensional data, mainly manifested as a sharp increase in computational complexity and difficulty in achieving ideal accuracy requirements within an acceptable time range, which greatly limits their breadth and depth in practical applications. In response to this bottleneck problem, this article innovatively proposes a new approach that combines width learning theory with BN, referred to as Broad Bayesian Neural Network (Broad-BNN). This model effectively reduces the dimensionality of the original high-dimensional data by introducing a feature mapping layer and gradually expanding it, while achieving non-linear transformation of information and effective feature extraction. The experimental results show that the model proposed in this paper has achieved significant performance improvement in high-dimensional data classification problems, not only accelerating training speed but also significantly improving classification accuracy, providing a new perspective and solution for solving the difficulties of high-dimensional data processing. © 2025 Kuo Li et al., published by Sciendo.

关键词： Bayesian networks

SMT(LIA) Sampling with High Diversity

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lai, Yong Li, Junjie Luo, Chuan College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Software Beihang University Beijing100191 China

Satisfiability Modulo Linear Integer Arithmetic, SMT(LIA) for short, is pivotal across various critical domains. Previous research has primarily focused on SMT solving techniques. However, in practical applications such as software and hardware testing, there is a need to generate a diverse set of solutions for use as test inputs. We have developed the first sampling framework that integrates local search with CDCL(T) techniques, named HighDiv, capable of generating a highly diverse set of solutions for constraints under linear integer theory. Initially, in the local search phase, we introduced a novel operator called boundary-aware movement. This operator performs random moves by considering the current state’s constraints on variables, thereby enhancing the diversity of variables during the search process. Furthermore, we have conducted an in-depth study of the preprocessing and variable initialization mechanisms within the framework, which significantly enhances the efficiency of subsequent local searches. Lastly, we use the solutions obtained from local search sampling as additional constraints to further explore the solution space using the stochastic CDCL(T) method. Experimental results demonstrate that HighDiv generates solutions with greater diversity compared to the state-of-the-art SMT(LIA) sampling tool, MeGASampler. Copyright © 2025, The Authors. All rights reserved.

关键词： Software testing

NON-RADIATING ELASTIC SOURCES IN INHOMOGENEOUS ELASTIC MEDIA AT CORNERS WITH APPLICATIONS

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Diao, Huaian Geng, Yueran Tang, Ruixiang School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Mathematics Jilin University Changchun130012 China Department of Mathematics City University of Hong Kong Kowloon Hong Kong

This paper is concerned with non-radiating elastic sources in inhomogeneous elastic media. We demonstrate that the value of non-radiating elastic sources must vanish at convex corners of their support, provided the sources exhibit Hölder continuous regularity near the corner. Additionally, their gradient must satisfy intricate algebraic relationships with the angles defining the underlying corners, assuming the sources have C1,α regularity with α ∈ (0, 1) in the neighborhood of the corners. To perform microlocal analysis around the corners, we employ the so-called complex geometrical optics (CGO) solutions as test functions within a partial differential system. These characterizations of non-radiating elastic sources in inhomogeneous elastic media at corners enable us to establish the unique identifiability results for determining the position and shape of radiating elastic sources by a single far-field measurement, both locally and globally. The uniqueness result by a single far-field measurement is a challenging problem with a colorful history in inverse scattering. Indeed, when the support of a radiating elastic source is a convex polygon, we can simultaneously determine the shape of the elastic source and its values at the corners, provided the source is Hölder continuous at the corner. Furthermore, when the source function exhibits C1,α regularity in the neighborhood of a corner, the gradient of the source function at that corner can also be generically *** Codes 35Q74, 35R30, 74B05, 86A22 © 2025, CC BY.

关键词： Geometrical optics

IEEE Transactions on Computational Biology and Bioinformatic...

学校读者我要写书评

暂无评论

IEEE Transactions on computational Biology and Bioinformatics 2025年第1期22卷 203-215页

作者： Ruijie Li Qiao Ning Yaomiao Zhao Shikai Guo Hui Li Department of Information Science and Technology Dalian Maritime University Dalian China DUT Artificial Intelligence Institute Dalian China Dalian Key Laboratory of Artificial Intelligence Dalian China School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Computer Science and Engineering Northeastern University Shenyang China

In recent years, microRNA (miRNA) has been recognized as crucial in the progression of human diseases. However, existing computational methods for identifying miRNA-disease associations often overlook the rich association information contained in specific long-distance pathways and lack effective exploration of potential associations. In this study, we propose a biologically interpretable “similarity-association-similarity” metapath and heterogeneous-hyper network (HeteroHyperNet) learning approach for miRNA-disease association prediction (MHMDA). In MHMDA, a “similarity-association-similarity” multi-hop metapaths learning method based on hierarchical attention perception is proposed to explore specific long-distance associated pathway information connecting potentially associated miRNAs and diseases. In addition, a HeteroHyperNet learning approach integrating heterogeneous network and hyper network is designed to progressively learn direct association information and potential association information between miRNA and disease. The “similarity-association-similarity” metapath with hierarchical attention significantly enhances the learning of long-distance biological associations, while the HeteroHyperNet comprehensively learns the known and potential associations of miRNA-disease, greatly improving the richness and accuracy of information. A large number of experimental results show that MHMDA has demonstrated excellent performance in the prediction of miRNA-disease association. In addition, cross independent dataset experiment and cold start experiment on miRNA and disease prove the effectiveness of MHMDA on sparse association points, and its stability and reliability in predicting potential miRNA-disease association are further confirmed.

关键词： Diseases Predictive models Autoencoders Feature extraction Biological system modeling Bioinformatics Kernel computational biology Heterogeneous networks Accuracy

Incomplete Graph Learning: A Comprehensive Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xia, Riting Liu, Huibo Li, Anchen Liu, Xueyan Zhang, Yan Zhang, Chunxu Yang, Bo College of Computer Science Inner Mongolia University Hohhot010021 China School of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

Graph learning is a prevalent field that operates on ubiquitous graph data. Effective graph learning methods can extract valuable information from graphs. However, these methods are non-robust and affected by missing attributes in graphs, resulting in sub-optimal outcomes. This has led to the emergence of incomplete graph learning, which aims to process and learn from incomplete graphs to achieve more accurate and representative results. In this paper, we conducted a comprehensive review of the literature on incomplete graph learning. Initially, we categorize incomplete graphs and provide precise definitions of relevant concepts, terminologies, and techniques, thereby establishing a solid understanding for readers. Subsequently, we classify incomplete graph learning methods according to the types of incompleteness: (1) attribute-incomplete graph learning methods, (2) attribute-missing graph learning methods, and (3) hybrid-absent graph learning methods. By systematically classifying and summarizing incomplete graph learning methods, we highlight the commonalities and differences among existing approaches, aiding readers in selecting methods and laying the groundwork for further advancements. In addition, we summarize the datasets, incomplete processing modes, evaluation metrics, and application domains used by the current methods. Lastly, we discuss the current challenges and propose future directions for incomplete graph learning, with the aim of stimulating further innovations in this crucial field. To our knowledge, this is the first review dedicated to incomplete graph learning, aiming to offer valuable insights for researchers in related fields.1 Copyright © 2025, The Authors. All rights reserved.

关键词： knowledge graph

WGAN-GP_Glu: A semi-supervised model based on double generator-Wasserstein GAN with gradient penalty algorithm for glutarylation site identification

学校读者我要写书评

暂无评论

Computers in Biology and Medicine 2025年 184卷 109328-109328页

作者： Ning, Qiao Qi, Zedong Information Science and Technology Dalian Maritime University Liaoning Dalian China The School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Neusoft Education Technology Group Dalian China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

As an important post-translational modification, glutarylation plays a crucial role in a variety of cellular functions. Recently, diverse computational methods for glutarylation site identification have been proposed. However, the class imbalance problem due to data noise and uncertainty of non-glutarylation sites remains a great challenge. In this article, we propose a novel semi-supervised learning algorithm, called WGAN-GP_Glu, for identifying reliable non-glutarylation lysine sites from those without glutarylation annotation. WGAN-GP_Glu method is a multi-module framework algorithm, which mainly includes a reliable negative sample selection module, a deep feature extraction module, and a glutarylation site prediction module. In reliable negative sample selection module, we design an improved method of Wasserstein GAN with Gradient Penalty (WGAN-GP), named ReliableWGAN-GP, including three parts, two generators G1, G2 and a discriminator D, which can select reliable non-glutarylation samples from a great number of unlabeled samples. Generator G1 is utilized to generate noise data from unlabeled samples. For generator G2, both the positive sample and the noise data are used as inputs to improve the discriminant capability of discriminator D. Then, convolutional neural network and bidirectional long short-term memory network combined with attention mechanism are utilized to extract deep features for glutarylation samples and reliable non-glutarylation samples. Finally, a glutarylation site prediction module based on the three-layer fully connected layer is designed to make class predictions for samples. The sensitivity, specificity, accuracy and Matthew correlation coefficient of WGAN-GP_Glu on the independent test data set reach 90.58 %, 95.82 %, 94.44 % and 0.8645, respectively, which surpassed the existing methods for glutarylation sites prediction. Therefore, WGAN-GP_Glu can serve as a powerful tool in identifying glutarylation sites and the ReliableWGAN-GP algo

关键词： Gallium nitride

Scalable Precise computation of Shannon Entropy

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lai, Yong Tong, Haolong Xu, Zhenghang Yin, Minghao College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Computer Science and Information Technology Northeast Normal University Changchun130017 China

Quantitative information flow analyses (QIF) are a class of techniques for measuring the amount of confidential information leaked by a program to its public outputs. Shannon entropy is an important method to quantify the amount of leakage in QIF. This paper focuses on the programs modeled in Boolean constraints and optimizes the two stages of the Shannon entropy computation to implement a scalable precise tool PSE. In the first stage, we design a knowledge compilation language called ADD[∧] that combines Algebraic Decision Diagrams and conjunctive decomposition. ADD[∧] avoids enumerating possible outputs of a program and supports tractable entropy computation. In the second stage, we optimize the model counting queries that are used to compute the probabilities of outputs. We compare PSE with the state-of-the-art probably approximately correct tool EntropyEstimation, which was shown to significantly outperform the existing precise tools. The experimental results demonstrate that PSE solved 55 more benchmarks compared to EntropyEstimation in a total of 441. For 98% of the benchmarks that both PSE and EntropyEstimation solved, PSE is at least 10× as efficient as EntropyEstimation. Copyright © 2025, The Authors. All rights reserved.

关键词： Information leakage

Sfmfold: A Multi-Modal Contrast Learning Model for Rna Secondary Structure Prediction

学校读者我要写书评

暂无评论

SSRN

SSRN 2025年

作者： Li, Ang Liu, Yuanning Zhang, Zhaoyang Li, Shuwang Dong, Hao Lv, Meng College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Software Jilin University Changchun130012 China College of Information Engineering Chang’an University Xi’an710064 China

The secondary structure of RNA can regulate the interaction between RNA and protein and perform various biological tasks through specific folding shapes, which plays an important role in revealing biomolecular mechanisms and developing new vaccines and therapeutic drugs. However, existing RNA secondary structure prediction methods based on thermodynamics and traditional neural network models usually lack the ability to model long-distance dependencies of RNA molecules and cannot handle complex non-nested structures in RNA molecules. In this paper, we propose a multi-modal contrastive learning method SFMFold based on state space model, which captures long-distance interactions in RNA sequences through RNA sequence representation learning part, and models the structure of RNA molecules through RNA structure representation learning part. Finally, the features of the two modalities are aligned and deeply fused to obtain the final RNA molecule prediction map. We test SFMFold on several datasets, and the experiments show that our proposed model shows excellent performance in cross-family prediction and long sequence prediction tasks. In addition, SFMFold can also effectively predict non-nested structures such as pseudoknot with better accuracy than the SOTA methods. © 2025, The Authors. All rights reserved.

关键词： Prediction models

AAV Virtual Antenna Array Deployment for Uplink Interference Mitigation in Data Collection Networks

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年第8期12卷 10834-10850页

作者： Li, Hongjuan Kang, Hui Sun, Geng Li, Jiahui Wang, Jiacheng Wang, Xue Niyato, Dusit Leung, Victor C. M. Jilin University College of Computer Science and Technology Changchun 130012 China Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China Nanyang Technological University College of Computing and Data Science Jurong West Singapore Jilin University Department of Communication Engineering Changchun 130012 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen 518115 China Shenzhen University College of Computer Science and Software Engineering Shenzhen 518060 China The University of British Columbia Department of Electrical and Computer Engineering Vancouver V6T 1Z4 BC Canada

Autonomous aerial vehicles (AAVs) have gained considerable attention as a platform for establishing aerial wireless networks and communications. However, the Line of Sight (LoS) dominance in air-to-ground (A2G) communications often leads to significant interference with terrestrial networks, reducing communication efficiency among terrestrial terminals. This article explores a novel uplink interference mitigation approach based on the collaborative beamforming (CB) method in multi-AAV network systems. Specifically, the AAV swarm forms an AAV-enabled virtual antenna array (VAA) to achieve the transmissions of gathered data to multiple base stations (BSs) for data backup and distributed processing. However, there is a tradeoff tradeoff between the effectiveness of CB-based interference mitigation and the energy conservation of AAVs. Thus, by optimizing the excitation current weights and hover position of AAVs as well as the sequence of data transmission to various BSs, we formulate an uplink interference mitigation multiobjective optimization problem (MOOP) to decrease interference affection, enhance transmission efficiency, and improve energy efficiency, simultaneously. In response to the computational demands of the formulated problem, we introduce an evolutionary computation method, namely chaotic nondominated sorting genetic algorithm II (CNSGA-II) with multiple improved operators. The proposed CNSGA-II efficiently addresses the formulated MOOP, outperforming several other comparative algorithms, as evidenced by the outcomes of the simulations. Moreover, the proposed CB-based uplink interference mitigation approach can significantly reduce the interference caused by AAVs to nonreceiving BSs. © 2014 IEEE.

关键词： autonomous aerial vehicle (AAV) network Collaborative beamforming (CB) evolutionary computation interference mitigation multiobjective optimization