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

Dual-proxies contrast-focused loss in domain generalization

学校读者我要写书评

暂无评论

Expert Systems with Applications 2025年 291卷

作者： Shihao Liu Pingping Liu Qiuzhan Zhou College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Mechanical Science and Engineering Jilin University Changchun China College of Communication Engineering Jilin University Changchun China

Domain generalization aims to train a model that can directly generalize to unseen domains after learning from different source domains. Due to the significant distribution discrepancy between training domains and the unseen target domain, model performance can be significantly affected. To address the issue, one current trend is to develop contrastive learning frameworks that achieve clustering effects by aligning features in the embedding space. Among existing solutions under contrastive learning frameworks, contrastive-based methods interact with intra-class and inter-class samples indiscriminately with equal intensity. Such indiscriminate interaction can be insufficient for effectively clustering domains with large gaps due to the influence of domain discrepancy. In contrast, metric learning frameworks, as traditional approaches for embedding space optimization, widely implement constructing class proxies as their central technique. However, when applied in domain generalization, proxy-based methods tend to neglect the rich semantic relationships between samples and fail to account for the domain-specific distributional relationships among classes. To resolve these limitations, we integrate contrastive-based methods with proxy-based methods, proposing a dual-proxy contrastive learning framework. Focusing on sample relations, we pay special attention to same-class cross-domain samples and assign greater interaction intensity to reduce feature discrepancy across domains. For class relations, we build two groups of centroid proxies: random proxy groups that adjust class-internal distributions along model optimization and mean proxy groups that represent statistical information to calibrate class-external distributions. Ultimately, we integrate the explorations from both the sample and class perspectives. We evaluate our method on five benchmark datasets, including PACS, VLCS, OfficeHome, TerraIncognita, and DomainNet, and the results validate its effectiveness with

关键词：

Multi-objective Aerial Collaborative Secure Communication Optimization via Generative Diffusion Model-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wu, Qingqing Wang, Jiacheng Niyato, Dusit Liu, Yuanwei The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The College of Computer Science and Technology Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

Due to flexibility and low-cost, unmanned aerial vehicles (UAVs) are increasingly crucial for enhancing coverage and functionality of wireless networks. However, incorporating UAVs into next-generation wireless communication systems poses significant challenges, particularly in sustaining high-rate and long-range secure communications against eavesdropping attacks. In this work, we consider a UAV swarm-enabled secure surveillance network system, where a UAV swarm forms a virtual antenna array to transmit sensitive surveillance data to a remote base station (RBS) via collaborative beamforming (CB) so as to resist mobile eavesdroppers. Specifically, we formulate an aerial secure communication and energy efficiency multi-objective optimization problem (ASCEE-MOP) to maximize the secrecy rate of the system and to minimize the flight energy consumption of the UAV swarm. To address the non-convex, NP-hard and dynamic ASCEE-MOP, we propose a generative diffusion model-enabled twin delayed deep deterministic policy gradient (GDMTD3) method. Specifically, GDMTD3 leverages an innovative application of diffusion models to determine optimal excitation current weights and position decisions of UAVs. The diffusion models can better capture the complex dynamics and the trade-off of the ASCEE-MOP, thereby yielding promising solutions. Simulation results highlight the superior performance of the proposed approach compared with traditional deployment strategies and some other deep reinforcement learning (DRL) benchmarks. Moreover, performance analysis under various parameter settings of GDMTD3 and different numbers of UAVs verifies the robustness of the proposed approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Energy efficiency

Parallel generated method of transcriptional regulatory networks

学校读者我要写书评

暂无评论

Parallel generated method of transcriptional regulatory netw...

作者： Liu, Shuai Ta, Na Lu, Mengye Liu, Gaocheng Bai, Weiling Li, Wenhui College of Computer Science Inner Mongolia University Hohhot010012 China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot010012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Generated method of transcriptional regulatory networks remains an important research in biology. Many approaches have been proposed to construct transcriptional regulatory networks. However, with the increase of ChIP-seq and RNA-seq data, the speed of constructing transcriptional regulation networks is still a challenge. Moreover, parallel computing lacks application in constructing gene regulatory networks through the analysis of the relationships between transcription factors (TFs) and target genes (TGs). Therefore, in this paper, a parallel generated method of transcriptional regulatory networks was proposed. First, two datasets, Michigan Cancer Foundation – 7 (MCF-7) and Cardiomyocytes (CM) were applied. Then, a parallel method was used to generate transcriptional regulatory network with their transcription factors (TFs) and target genes (TGs). Finally, experimental results showed that 61% regulatory relations in MCF-7 were validated in the Gene Expression Omnibus (GEO), while 29% results needed further experimental verification. Besides, 56% regulatory relations in CM were consistent with GEO, while 33% results were not yet verified. Furthermore, speed of parallel algorithm was faster than traditional serial algorithm in generating transcriptional regulatory networks. © 2018 John Wiley & Sons, Ltd.

关键词： Transcription factors

Semantics-Assisted Wasserstein Learning for Topic and Word Embeddings

学校读者我要写书评

暂无评论

Semantics-Assisted Wasserstein Learning for Topic and Word E...

IEEE International Conference on Data Mining (ICDM)

作者： Changchun Li Ximing Li Jihong Ouyang Yiming Wang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Wasserstein distance, defined as the cost (measured by word embeddings) of optimal transport plan for moving between two histograms, has been proven effective in tasks of natural language processing. In this paper, we extend Nonnegative Matrix Factorization (NMF) to a novel Wasserstein topic model, namely Semantics-Assisted Wasserstein Learning (SAWL), with simultaneous learning of topics and word embeddings. In Sawl, we formulate an NMF-like unified objective that integrates the regularized Wasserstein distance loss with a context factorization of word context information. Therefore, Sawl can refine the word embeddings for capturing corpus-specific semantics, enabling to boost topics and word embeddings each other. We analyze Sawl, and provide its dimensionality-dependent generalization bounds of reconstruction errors. Experimental results indicate that Sawl outperforms the state-of-the-art baseline models.

关键词： Histograms Conferences Semantics Natural language processing Data models Data mining Task analysis

Generative Classifier for Domain Generalization

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Long, Shaocong Zhou, Qianyu Li, Xiangtai Ying, Chenhao Tong, Yunhai Ma, Lizhuang Luo, Yuan Tao, Dacheng Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Nanyang Technological University Singapore Peking University Beijing China

Domain generalization (DG) aims to improve the generalizability of computer vision models toward distribution shifts. The mainstream DG methods predominantly focus on learning domain invariance across domains, however, such methods overlook the untapped potential inherent in domain-specific information. While the prevailing practice of discriminative linear classifier has been tailored to domain-invariant features, it struggles when confronted with diverse domain-specific information, e.g., intra-class shifts, that exhibits multi-modality. To address these issues, we explore the theoretical implications of relying on domain-invariant features, revealing the crucial role of domain-specific information in mitigating the target risk for DG. Drawing from these insights, we propose Generative Classifier-driven Domain Generalization (GCDG), introducing a generative paradigm for the DG classifier based on Gaussian Mixture Models (GMMs) for each class across domains. GCDG consists of three key modules: Heterogeneity Learning Classifier (HLC), Spurious Correlation Blocking (SCB), and Diverse Component Balancing (DCB). Concretely, HLC attempts to model the feature distributions and thereby capture valuable domain-specific information via GMMs. SCB identifies the neural units containing spurious correlations and perturbs them, mitigating the risk of HLC learning irrelevant spurious patterns. Meanwhile, DCB ensures a balanced contribution of components within HLC, preventing the underestimation or neglect of critical components. In this way, GCDG excels in capturing the nuances of domain-specific information characterized by diverse distributions. GCDG demonstrates the potential to reduce the target risk and encourage flat minima, improving the model’s generalizability. Extensive experiments show GCDG’s comparable performance on five DG benchmarks and one face anti-spoofing dataset, seamlessly integrating into existing DG methods with consistent improvements. Code will be avail

关键词： Discriminant analysis

ON QUASI-MINNAERT RESONANCES IN ELASTICITY AND THEIR APPLICATIONS TO STRESS CONCENTRATIONS

学校读者我要写书评

暂无评论

arXiv 2025年

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

This paper unveils and investigates a novel quasi-Minnaert resonance for an elastic hard inclusion embedded in a soft homogeneous medium in the sub-wavelength regime. The quasi-Minnaert resonance consists of boundary localization and surface resonance for the generated internal total and external scattered wave fields associated with the hard inclusion. It possesses similar quantitative behaviours as those for the classical Minnaert resonance due to high-contrast material structures, but occurs for a continuous spectrum of frequencies instead of certain discrete Minnaert resonant frequencies. We present a comprehensive analysis to uncover the physical origin and the mechanism of this new physical phenomenon. It is shown that the delicate high-contrast material structures and the properly tailored incident waves which are coupled together in a subtle manner play a crucial role in ensuring such phenomena. The stress concentration phenomena in both the internal total field and the scattered field components are also rigorously established. The analysis in this paper is deeply rooted in layer potential theory and intricate asymptotic analysis. We believe that our findings can have a significant impact on the theory of composite materials and *** Codes 35P20, 35B34, 74E99, 74J20 © 2025, CC BY.

关键词： Stress concentration

TJCCT: A Two-timescale Approach for UAV-assisted Mobile Edge Computing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Zemin Sun, Geng Wu, Qingqing He, Long Liang, Shuang Pan, Hongyang Niyato, Dusit Yuen, Chau Leung, Victor C.M. The 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 Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The School of Information Science and Technology Northeast Normal University Changchun130024 China The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) is emerging as a promising paradigm to provide aerial-terrestrial computing services in close proximity to mobile devices (MDs). However, meeting the demands of computation-intensive and delay-sensitive tasks for MDs poses several challenges, including the demand-supply contradiction between MDs and MEC servers, the demand-supply heterogeneity between MDs and MEC servers, the trajectory control requirements on energy efficiency and timeliness, and the different time-scale dynamics of the network. To address these issues, we first present a hierarchical architecture by incorporating terrestrial-aerial computing capabilities and leveraging UAV flexibility. Furthermore, we formulate a joint computing resource allocation, computation offloading, and trajectory control problem to maximize the system utility. Since the problem is a non-convex and NP-hard mixed integer nonlinear programming (MINLP), we propose a two-timescale joint computing resource allocation, computation offloading, and trajectory control (TJCCT) approach for solving the problem. In the short timescale, we propose a price-incentive model for on-demand computing resource allocation and a matching mechanism-based method for computation offloading. In the long timescale, we propose a convex optimization-based method for UAV trajectory control. Besides, we theoretically prove the stability, optimality, and polynomial complexity of TJCCT. Extended simulation results demonstrate that the proposed TJCCT outperforms the comparative algorithms in terms of the system utility, average processing rate, average completion delay, and average completion ratio. Copyright © 2024, The Authors. All rights reserved.

关键词： computation offloading

Schgt-Im: Influence Maximization for Heterogeneous Networks Based on a Self-Supervised Clustered Heterogeneous Graph Transformer

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Li, Ying Li, Linlin Liu, Xiangyu Liu, Yijun Li, Qianqian Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Jilin Province Changchun130013 China The Faculty of Science and Engineering University of Nottingham NottinghamNG7 2RD United Kingdom Institutes of Science and Development Chinese Academy of Sciences Beijing100190 China School of Public Policy and Management University of Chinese Academy of Sciences Beijing100190 China

Influence maximization (IM) has drawn considerable attention in recent years. Most existing IM methods focus on homogeneous networks, and do not consider the heterogeneity and the attributes of different types of nodes in heterogeneous networks. However, heterogeneous networks are ubiquitous in real-world and encompass rich semantics and complex structural information. Additionally, the clustering characteristics embedded in a network have a critical and significant impact on the process of information diffusion, which has not been considered in IM models based on heterogeneous networks. To address the challenges posed by the heterogeneity and clustering structure in heterogeneous networks, we propose a novel deep learning framework based on a self-supervised clustered heterogeneous graph transformer for IM in heterogeneous networks, named SCHGT-IM. SCHGT-IM aggregates the heterogeneity and clustering information in heterogeneous networks and includes a clustered cascade (CC) model as an information diffusion model to improve the realism of simulations. We evaluate the performance of SCHGT-IM in comparison with that of state-of-the-art IM models on three academic heterogeneous networks extracted from DBLP dataset. The experimental influence spread results show that SCHGT-IM is superior to five state-of-the-art algorithms and performs effectively in terms of selecting influential seed nodes of different types from heterogeneous networks. © 2022, The Authors. All rights reserved.

关键词： Heterogeneous networks

PepHarmony: A Multi-View Contrastive Learning Framework for Integrated Sequence and Structure-Based Peptide Encoding

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Ruochi Wu, Haoran Liu, Chang Li, Huaping Wu, Yuqian Li, Kewei Wang, Yifan Deng, Yifan Chen, Jiahui Zhou, Fengfeng Gao, Xin Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China School of Artificial Intelligence Jilin University Jilin Changchun130012 China Syneron Technology Guangzhou510700 China Beijing Life Science Academy Beijing102209 China School of Biomedical Sciences LKS Faculty of Medicine The University of Hong Kong Hong Kong Thuwal23955 Saudi Arabia Thuwal23955 Saudi Arabia College of Software Jilin University Jilin Changchun130012 China College of Computer Science and Technology Jilin University Jilin Changchun130012 China

Recent advances in protein language models have catalyzed significant progress in peptide sequence representation. Despite extensive exploration in this field, pre-trained models tailored for peptide-specific needs remain largely unaddressed due to the difficulty in capturing the complex and sometimes unstable structures of peptides. This study introduces a novel multi-view contrastive learning framework PepHarmony for the sequence-based peptide encoding task. PepHarmony innovatively combines both sequence- and structure-level information into a sequence-level encoding module through contrastive learning. We carefully select datasets from the Protein Data Bank (PDB) and AlphaFold database to encompass a broad spectrum of peptide sequences and structures. The experimental data highlights PepHarmony's exceptional capability in capturing the intricate relationship between peptide sequences and structures compared with the baseline and fine-tuned models. The robustness of our model is confirmed through extensive ablation studies, which emphasize the crucial roles of contrastive loss and strategic data sorting in enhancing predictive performance. The proposed PepHarmony framework serves as a notable contribution to peptide representations, and offers valuable insights for future applications in peptide drug discovery and peptide engineering. We have made all the source code utilized in this study publicly accessible via GitHub at https://***/zhangruochi/PepHarmony or http://***/supp/. © 2024, CC BY-NC-ND.

关键词： Peptides