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

arXiv 2024年

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

In this paper, we investigate a transmission eigenvalue problem that couples the principles of acoustics and elasticity. This problem naturally arises when studying fluid-solid interactions and constructing bubbly-elastic structures to create metamaterials. We uncover intriguing local geometric structures of the transmission eigenfunctions near the corners of the domains, under typical regularity conditions. As applications, we present novel unique identifiability and visibility results for an inverse problem associated with an acoustoelastic system, which hold practical significance. © 2024, CC BY.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Positive and unlabeled learning with controlled probability boundary fence 24

Positive and unlabeled learning with controlled probability ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Changchun Li Yuanchao Dai Lei Feng Ximing Li Bing Wang Jihong Ouyang College of Computer Science and Technology and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

Positive and Unlabeled (PU) learning refers to a special case of binary classification, and technically, it aims to induce a binary classifier from a few labeled positive training instances and loads of unlabeled instances. In this paper, we derive a theorem indicating that the probability boundary of the asymmetric disambiguation-free expected risk of PU learning is controlled by its asymmetric penalty, and we further empirically evaluated this theorem. Inspired by the theorem and its empirical evaluations, we propose an easy-to-implement two-stage PU learning method, namely Positive and Unlabeled Learning with Controlled Probability Boundary Fence (PUL-CPBF). In the first stage, we train a set of weak binary classifiers concerning different probability boundaries by minimizing the asymmetric disambiguation-free empirical risks with specific asymmetric penalty values. We can interpret these induced weak binary classifiers as a probability boundary fence. For each unlabeled instance, we can use the predictions to locate its class posterior probability and generate a stochastic label. In the second stage, we train a strong binary classifier over labeled positive training instances and all unlabeled instances with stochastic labels in a self-training manner. Extensive empirical results demonstrate that PUL-CPBF can achieve competitive performance compared with the existing PU learning baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AAV-Assisted Joint Mobile Edge Computing and Data Collection via Matching-Enabled Deep Reinforcement Learning

引用

IEEE Internet of Things Journal 2025年第12期12卷 19782-19800页

作者： Boxiong Wang Hui Kang Jiahui Li Geng Sun Zemin Sun Jiacheng Wang Dusit Niyato College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology and the Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computing and Data Science Nanyang Technological University Jurong West Singapore

Autonomous aerial vehicle (AAV)-assisted mobile edge computing (MEC) and data collection (DC) have been popular research issues. Different from existing works that consider MEC and DC scenarios separately, this article investigates a multi-AAV-assisted joint MEC-DC system. Specifically, we formulate a joint optimization problem to minimize the MEC latency and maximize the collected data volume. This problem can be classified as a nonconvex mixed integer programming problem that exhibits long-term optimization and dynamics. Thus, we propose a deep reinforcement learning-based approach that jointly optimizes the AAV movement, user transmit power, and user association in real time to solve the problem efficiently. Specifically, we reformulate the optimization problem into an action space-reduced Markov decision process (MDP) and optimize the user association by using a two-phase matching-based association (TMA) strategy. Subsequently, we propose a soft actor-critic (SAC)-based approach that integrates the proposed TMA strategy (SAC-TMA) to solve the formulated joint optimization problem collaboratively. Simulation results demonstrate that the proposed SAC-TMA is able to coordinate the two subsystems and can effectively reduce the system latency and improve the DC volume compared with other benchmark algorithms.

关键词： Internet of Things Optimization Autonomous aerial vehicles Interference Wireless networks Sun Data collection Real-time systems Production facilities Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Visual Analysis of the National Characteristics of the COVID-19 Vaccine Based on knowledge Graph

Visual Analysis of the National Characteristics of the COVID...

引用

作者： Yong Feng Ning Zhang Hongyan Xu Rongbing Wang Yonggang Zhang College of Information Liaoning University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

The aim is to construct a country-dimension knowledge graph of COVID-19 vaccines from the information of COVID-19 vaccines and to analyze the leading countries of vaccine R&D by combining the advantages of easy operation and intuitive feeling of knowledge graph visualization,to provide a reference for Chinese vaccine R&D departments and international *** this paper,through data collection,based on entity extraction and relationship construction,a knowledge graph of country dimensions was established by specifying the central vaccine R&D countries and vaccine distribution,and multidimensional microdata such as word frequency and betweenness centrality were combined to analyze the national characteristics of the COVID-19 *** analysis of the knowledge graph of the country dimension of the COVID-19 vaccine shows that countries with robust technology and economies,such as the US and China,choose to develop vaccine distribution independently,countries with advanced economies,such as Saudi Arabia,decide to purchase vaccine distribution,and less developed countries,such as South Africa and Latin America,need international aid for vaccines or purchase low-cost *** paper constructs the correlation between nodes and nodes of the COVID-19 vaccine with the help of a knowledge graph,systematically and comprehensively reveals the research mainstay and distribution model of the COVID-19 vaccine from the national level,and provides rationalized suggestions for international cooperation in vaccine R&D in China.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GraCEImpute: A novel graph clustering autoencoder approach for imputation of single-cell RNA-seq data

引用

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

作者： Wang, Yueying Li, Kewei Zhang, Ruochi Fan, Yusi Huang, Lan Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Artificial Intelligence Jilin University Changchun130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang550025 China

Single-cell RNA sequencing (scRNA-seq) technology establishes a unique view for elucidating cellular heterogeneity in various biological systems. Yet the scRNA-seq data is compromised by a high dropout rate due to the technological limitation, and the substantial data loss poses computational challenges on subsequent analyses. This study introduces a novel graph clustering autoencoder (GCAE)-based imputation approach (GraCEImpute) to address the challenge of missing data in scRNA-seq data. Our comprehensive evaluation demonstrates that the GraCEImpute model outperforms existing approaches in accurately imputing dropout zeros within scRNA-seq data. The proposed GraCEImpute model also demonstrates the significantly enhanced quality of downstream scRNA-seq data analyses, including clustering, differential gene expression (DEG) analysis, and cell trajectory inference. These improvements underscore the GraCEImpute model's potential to facilitate a deeper understanding of cellular processes and heterogeneity through the scRNA-seq data analyses. The source code is released at https://***/supp/. © 2024 Elsevier Ltd

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Skeleton-based Action Recognition with Non-linear Dependency Modeling and Hilbert-Schmidt Independence Criterion

arXiv

引用

arXiv 2024年

作者： Chen, Haipeng Yang, Yuheng Lyu, Yingda College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Public Computer Education and Research Center Jilin University China

Human skeleton-based action recognition has long been an indispensable aspect of artificial intelligence. Current state-of-the-art methods tend to consider only the dependencies between connected skeletal joints, limiting their ability to capture non-linear dependencies between physically distant joints. Moreover, most existing approaches distinguish action classes by estimating the probability density of motion representations, yet the high-dimensional nature of human motions invokes inherent difficulties in accomplishing such measurements. In this paper, we seek to tackle these challenges from two directions: (1) We propose a novel dependency refinement approach that explicitly models dependencies between any pair of joints, effectively transcending the limitations imposed by joint distance. (2) We further propose a framework that utilizes the Hilbert-Schmidt Independence Criterion to differentiate action classes without being affected by data dimensionality, and mathematically derive learning objectives guaranteeing precise recognition. Empirically, our approach sets the state-of-the-art performance on NTU RGB+D, NTU RGB+D 120, and Northwestern-UCLA datasets. © 2024, CC BY-SA.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

SS-MAF: Semi-Supervised Echocardiographic Segmentation Using Multi-Atlas Fusion

SS-MAF: Semi-Supervised Echocardiographic Segmentation Using...

引用

Communication, Image and Signal Processing (CCISP), International Conference on

作者： Shuaihua Yang Caixia Zheng College of Information Science and Technology Northeast Normal University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Left ventricle (LV) segmentation in echocardiography is of paramount significance in cardiac function analysis. Recently, semi-supervised segmentation has garnered considerable attention due to its potential mitigation of labeling costs. Despite this, most semi-supervised methodologies tend to overlook the specialized anatomical priors specific to echocardiography, often yielding suboptimal outcomes. Simultaneously, atlas priors have been validated on other organs and imaging modalities. However, their direct application in echocardiography is fraught with challenges, primarily attributed to the indistinct boundaries of the LV and the presence of fan-shaped image edges, which impede atlas image registration. This paper presents a new method of semi-supervised segmentation using multi-atlas fusion, named SS- MAF, which is designed to incorporate atlas priors tailored for echocardiography while circumventing the intricate image registration process in traditional atlas-based methods. The SS-MAF comprises two components: a Multi-Task Learning (MTL) module and a Multi-Atlas Fusion (MAF) module. The MTL module serves precise landmark localization and segmentation estimation. The MAF module is primarily focused on the generation of probabilistic atlases, utilizing annotated atlas data with the guidance of key landmarks to facilitate the automatic annotation of unlabeled data, avoiding the traditional image-level registration, thus enhancing the performance of the MTL module. Our SS- MAF is rigorously evaluated on the publicly available CAMUS dataset, with results demonstrating its superiority over other state-of-the-art semi-supervised segmentation techniques in echocardiography.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Troublemaker Learning for Low-Light Image Enhancement

arXiv

引用

arXiv 2024年

作者： Song, Yinghao Cao, Zhiyuan Xiang, Wanhong Long, Sifan Ge, Hongwei Liang, Yanchun Yang, Bo Wu, Chunguo College of Computer Science and Technology Jilin University Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin China YGSOFT INC Dalian University of Technology China

Low-light image enhancement (LLIE) restores the color and brightness of underexposed images. Supervised methods suffer from high costs in collecting low/normal-light image pairs. Unsupervised methods invest substantial effort in crafting complex loss functions. We address these two challenges through the proposed TroubleMaker Learning (TML) strategy, which employs normal-light images as inputs for training. TML is simple: we first dim the input and then increase its brightness. TML is based on two core components. First, the troublemaker model (TM) constructs pseudo low-light images from normal images to relieve the cost of pairwise data. Second, the predicting model (PM) enhances the brightness of pseudo low-light images. Additionally, we incorporate an enhancing model (EM) to further improve the visual performance of PM outputs. Moreover, in LLIE tasks, characterizing global element correlations is important because more information on the same object can be captured. CNN cannot achieve this well, and self-attention has high time complexity. Accordingly, we propose Global Dynamic Convolution (GDC) with O(n) time complexity, which essentially imitates the partial calculation process of self-attention to formulate elementwise correlations. Based on the GDC module, we build the UGDC model. Extensive quantitative and qualitative experiments demonstrate that UGDC trained with TML can achieve competitive performance against state-of-the-art approaches on public datasets. The code is available at https://***/Rainbowman0/TML LLIE. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Deep Feature-Based Text Clustering and Its Explanation

Deep Feature-Based Text Clustering and Its Explanation

引用

International Conference on Data engineering

作者： Renchu Guan Hao Zhang Yanchun Liang Fausto Giunchiglia Lan Huang Xiaoyue Feng Key Laboratory for Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China DISI University of Trento Trento Italy

Text clustering is a critical step in text data analysis and has been extensively studied by the text mining community. Most existing text clustering algorithms are based on the bag-of-words model, which faces the high-dimensional and sparsity problems and ignores text structural and sequence information. Deep learning-based models such as convolutional neural networks and recurrent neural networks regard texts as sequences but lack supervised signals and explainable results. In this paper, we propose a deep feature-based text clustering (DFTC) framework that incorporates pretrained text encoders into text clustering tasks. This model, which is based on sequence representations, breaks the dependency on supervision. The experimental results show that our model outperforms classic text clustering algorithms on almost all the considered datasets. In addition, the explanation of the clustering results is significant for understanding the principles of the deep learning approach. Our proposed clustering framework includes an explanation module that can help users understand the meaning and quality of the clustering results. Our code is available at https://***/KEAML-JLU/DeepTextClustering.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Community discovery algorithm and its technical improvement based on link structure–taking web community algorithm as an example

Community discovery algorithm and its technical improvement ...

引用

International Conference on Applications and Techniques in Cyber Intelligence, ATCI 2020

作者： Gao, Rui Yang, Wenzhe Shi, Xiaohu Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University 2699 Qianjin Street Changchun130012 China

ISBN: (纸本)9783030539795

Link analysis is an important way to discover potential web communities. This paper analyzes the characteristics of the Web link structure, and studies the traditional maximum flow algorithm and the maximum flow algorithm based on HITS algorithm for edge capacity allocation. The traditional maximum flow problem, but there are still shortcomings. Based on the analysis of existing link similarity definitions, this paper proposes a new definition of link similarity and topic dissimilarity to better describe the relationship between linked pages, and to measure based on link similarity and topic dissimilarity. The similarity of the pages gives a more reasonable and efficient maximum flow-side capacity allocation scheme. The community discovery of 6 topics shows that the maximum flow algorithm proposed in this paper using the link similarity and topic dissimilarity model to allocate edge capacity can better solve the problems of existing algorithms and significantly improve the quality of the Web community. This paper proposes new methods and ideas for page similarity measurement, and provides new strategies for improving the Web community discovery algorithm based on link analysis. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：