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

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

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Drive: An Adjustable Parallel Architecture Based on Evidence Awareness for Fake News Detection

SSRN

引用

SSRN 2024年

作者： Cong, Mou Liu, Lu Han, Jiayu Zhu, Beibei Yuan, Xiaosong Peng, Tao College of Computer Science and Technology Jilin University 2699 Qianjin Street Jilin Changchun130012 China College of Software Jilin University 2699 Qianjin Street Jilin Changchun130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University 2699 Qianjin Street Jilin Changchun130012 China Department of Linguistics University of Washington SeattleWA98195 United States

Fake news detection becomes a critical challenge in NLP. Batch processing with attention-derivative models is a popular solution for fake news detection. Models with attention mechanisms could mitigate the long-distance dependence problem. However, we find that extracting local dependencies using convolutional networks is as important as extracting global dependencies using attention mechanisms. Besides, fake news datasets often suffer from problems such as imbalance and are hard to understand by current models. To address these problems, we propose DRIVE, which is short for an adjustable parallel architecture based on evidence awareness for fake news detection to alleviate the above problems, in which we introduce Claim as a supporting clue to enhance the model’s comprehension ability. Specifically, we propose a novel method for unbalanced datasets and design adjustable parallel branches, using Claim Additives Network (ClaimAddNet) and the MLP with convolutional gating mechanism (CPMLP) to capture global and local information in distinct branches, respectively. Experiments conducted on 5 public datasets demonstrate that DRIVE outperforms all baselines, improving accuracy by approximately 1.7 %. Furthermore, we implement an anti-noise interference test and evaluate the weighted average of the two branches along with ablation studies. © 2024, The Authors. All rights reserved.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Contrastive Fusion of Generative and Discriminative Lesion Maps for Weakly Supervised Medical Image Segmentation

SSRN

引用

SSRN 2023年

作者： Du, Wei Huo, Yongkang Tang, Shiyi Chen, Liang Li, Ying Li, Gaoyang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China College of Engineering Shantou University Shantou515063 China Translational Medical Center for Stem Cell Therapy Institute for Regenerative Medicine Shanghai East Hospital Bioinformatics Department School of Life Sciences and Technology Tongji University Shanghai200092 China

Medical image segmentation is a crucial computer-aided diagnosis (CAD) procedure in various clinical applications. However, most existing methods rely on pixel-level annotations, which are costly and time-consuming. We propose a novel contrastive fusion model of generative and discriminative lesion maps for weakly supervised medical image segmentation to address this limitation. The generative lesion map is generated by a lesion region-guided cycle-consistent adversarial network (CCANet), and the discriminative lesion map is produced by a class-aware-based discriminative lesion localization network (DLLNet). CCANet and DLLNet share weights at the encoder layer, which contains skip connections and channel attention modules to enhance feature embedding. In order to fully utilize and integrate the generative and discriminative lesion maps, and improve the segmentation accuracy, we design a fusion method based on contrastive loss to jointly train CCANet and DLLNet. The final lesion segmentation result is obtained by applying dense conditional random fields (Dense CRF) to the fused lesion map. Extensive experiments on three benchmark medical image datasets show that our model outperforms the state-of-the-art methods on weakly supervised medical image segmentation, especially in datasets with few samples, validating the proposed model's good generalization ability and robustness in various medical image segmentation scenarios. The source code and experiment datasets are available on GitHub: https://***/mlcb-jlu/GDC4MedSeg. © 2023, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Model LGCSPNet for Sitting Posture Risk Management Applications

引用

Expert Systems with Applications 2025年

作者： Dapeng Wang Wei Pang Zheng Cao Lei Song Liying An Xuan Wu Peng Zhao Liupu Wang You Zhou The College of Computer Science and Technology Jilin University Qianjin Street Changchun 130012 Jilin China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun Jilin China The School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh United Kingdom

Current methods for sitting posture recognition typically follow a pipeline involving keypoint extraction and skeleton graph construction, followed by pose classification using Convolutional Neural Networks (CNNs) or Vision Transformers (ViTs). However, CNNs struggle to model long-range dependencies among keypoints, whereas ViTs suffer from high computational costs. Moreover, both approaches tend to introduce redundancy during feature modeling. To improve efficiency, some studies have explored direct classification using keypoint coordinates, but these methods often fail to balance high accuracy with computational efficiency. To this end, this paper proposes a new model LGCSPNet with lightweight graph convolution modules (LGC) and a contrastive learning module. Firstly, LGC enables efficient full-keypoint communication by shifting features across keypoint channels, allowing each keypoint to access global context at minimal computational cost. Building on this, LGC enhances sitting posture detection by computing 3D attention weights via a parameter-free energy function with a closed-form solution, enhancing feature learning for posturally significant keypoints. The contrastive learning module enhances differentiation between similar postures in different categories by strategically selecting feature samples. Experiments on public human posture datasets and our custom sitting posture dataset show that LGCSPNet has only 0.097M parameters while achieving a 99% recognition rate. It surpasses existing models in terms of parameter quantity and accuracy. Guided by ergonomic metrics, our model enables posture correction and mitigates long-term sitting-related injuries.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Self-Ensembling Semi-Supervised Model for Bone X-ray Images Landmark Detection

Self-Ensembling Semi-Supervised Model for Bone X-ray Images ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Tian Bai Shenyao Liu Yuzhao Wang Yu Wang Dong Dong College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China College of Software Jilin University Changchun China First hospital of Jilin University Changchun China

ISBN: (纸本)9781665429825

Bone image landmark detection plays a vital role in orthopedic diseases diagnosis and analysis. As a promising approach, the data-driven convolutional neural network has been widely applied in landmarks detection. However, the model’s performance relies heavily on numerous high-quality labeled data, which are difficult to access. A practical solution for this issue in bone images landmark detection has not been provided, so we propose a framework of semi-supervised bone images landmark detection encouraged by the recent success of the self-ensembling method. The student and teacher networks share the same structure in our framework, where unlabeled data are utilized by enforcing the prediction consistency of two networks under different perturbations to enhance the network’s performance. The two networks use a mutual learning approach to improve the efficiency of using unlabeled data. In addition, we also propose a transformative perturbation scheme to prevent model overfitting during training and enhance the generalization capability of the model on unseen data. Experimental results on an in-house hip dataset collected from the actual process of clinical diagnosis and a publicly available dataset demonstrate that our framework has excellent performance compared with other semi-supervised methods.

关键词： Training Perturbation methods Biological system modeling Predictive models Bones Reliability engineering Data models

来源：评论

学校读者我要写书评

暂无评论

Grid Partition and Agglomeration for Bidirectional Hierarchical Clustering 2nd

Grid Partition and Agglomeration for Bidirectional Hierarchi...

引用

2nd EAI International Conference on Security and Privacy in New Computing Environments, SPNCE 2019

作者： Wu, Lei Chen, Hechang Yu, Xiangchun Chao, Sun Yu, Zhezhou Dou, RuiTing College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

ISBN: (纸本)9783030213725

Clustering is an important data processing tool, which can be used to reveal the distribution structure of unfamiliar domain data, or as preprocess methods to magnify data object to accelerate subsequent processing or simplify models. However, the distribution of many real-world data in feature space is very complex or uneven. Besides, the similarity/distance is not easy to be properly defined in feature space with different dimensional quantity. Therefore, many existing clustering algorithms are not stable in real datasets, and better performance of different datasets relies on artificial special design, such as scale normalization. In this paper, we propose a bidirectional hierarchical clustering (BHC) algorithm with two phases. In the first phase (Top-down), based on the probability density function of data in different dimensions, the feature space is divided into over-segmented grids to adapt to the complex distribution of data. In the second phase (Bottom-up), based on statistical information, a robust distance instead of geometrical distance is defined to agglomerate the grids into a dendrogram. Compared with the individual data points, grids created in the first phase can carry more statistical information, and the magnified processing objects can accelerate the clustering process. The second phase enhances the algorithm’s ability by the ability of recognize arbitrary shape data clusters. The effectiveness of BHC is compared with 20 popular or recent clustering algorithms on 8 artificial datasets and 6 real-world datasets. And the results show that our algorithm can achieve good results on most datasets. In particular, BHC surpasses all the comparison algorithms involved in the experiment on all real-world datasets. In addition, in order to test the efficiency of the algorithm, we design an experiment which can test the influence of dimension and data size on the operation time. © 2019, ICST Institute for Computer Sciences, Social Informatics and Telecommuni

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on the Task Scheduling System for Agricultural Plant Protection UAV 19

Research on the Task Scheduling System for Agricultural Plan...

引用

Proceedings of the 2019 2nd International Conference on Robot Systems and Applications

作者： Sun Fengjie Wang Xianchang Zhang Rui Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering Ministry of Education China Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering Ministry of Education Chengdu Kestrel Artificial Intelligence Institute China

ISBN: (纸本)9781450365130

Unmanned Aerial Vehicle (UAV) can greatly reduce manpower in agricultural plant protection such as watering, sowing, pesticide spraying. It helps in creating an autonomous manufacturing sys- tem by executing tasks with less human intervention in time-efficient manner. Consequently, a scheduler is one essential component to be focused on; yet to the best of our knowledge, there are few re- search on practical UAV scheduling. This work proposes an algorithm to schedule the UAV actions in practice such as pesticide spraying, flying and charging. During the execution of the algorithm, the tasks are put into a queue then each task is assigned to the UAV that can complete it in the shortest amount of time, and then the UAVs perform tasks in the order in which they are as- signed. This proposed method is implemented into a scheduler and tested on datasets generated based on a real flight demonstration. Performance evaluation of the scheduler is discussed in details.

关键词： task Assignment UAV swarm scheduling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：