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

7th International Conference on Fuzzy Systems and Data Mining, FSDM 2021

作者： Cao, Cungen Hu, Lanxi Sui, Yuefei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China

ISBN: (纸本)9781643682143

R-calculus is a belief revision operator satisfying AGM postulates, and belief revision in ontology engineering is ontology revision, which based logic is description logics. In Post three-valued description logic, a tableau proof system Tt will be given such that Tt is sound and complete for t-satisfiability, and nonmonotonic, that is, a theory Δis t-satisfiable if and only if Δis deducible in Tt. Based on the tableau proof system, an R-calculus Rt will be given such that a configuration Î"|C(a) is reducible to C(a),Δif and only if C(a) is t-satisfiable with Î", if and only if reduction Î"|C(a) â‡' C(a),Δis deducible in Rt. © 2021 The authors and IOS Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Static for Dynamic: Towards a Deeper Understanding of Dynamic Facial Expressions Using Static Expression Data

arXiv

引用

arXiv 2024年

作者： Chen, Yin Li, Jia Zhang, Yu Hu, Zhenzhen Shan, Shiguang Wang, Meng Hong, Richang School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

Dynamic facial expression recognition (DFER) infers emotions from the temporal evolution of expressions, unlike static facial expression recognition (SFER), which relies solely on a single snapshot. This temporal analysis provides richer information and promises greater recognition capability. However, current DFER methods often exhibit unsatisfied performance largely due to fewer training samples compared to SFER. Given the inherent correlation between static and dynamic expressions, we hypothesize that leveraging the abundant SFER data can enhance DFER. To this end, we propose Static-for-Dynamic (S4D), a unified dual-modal learning framework that integrates SFER data as a complementary resource for DFER. Specifically, S4D employs dual-modal self-supervised pre-training on facial images and videos using a shared Vision Transformer (ViT) encoder-decoder architecture, yielding improved spatiotemporal representations. The pre-trained encoder is then fine-tuned on static and dynamic expression datasets in a multi-task learning setup to facilitate emotional information interaction. Unfortunately, vanilla multitask learning in our study results in negative transfer. To address this, we propose an innovative Mixture of Adapter Experts (MoAE) module that facilitates task-specific knowledge acquisition while effectively extracting shared knowledge from both static and dynamic expression data. Extensive experiments demonstrate that S4D achieves a deeper understanding of DFER, setting new state-of-the-art performance on FERV39K, MAFW, and DFEW benchmarks, with weighted average recall (WAR) of 53.65%, 58.44%, and 76.68%, respectively. Additionally, a systematic correlation analysis between SFER and DFER tasks is presented, which further elucidates the potential benefits of leveraging SFER. Copyright © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Deep progressive reinforcement learning-based flexible resource scheduling framework for IRS and UAV-assisted MEC system

arXiv

引用

arXiv 2024年

作者： Dong, Li Jiang, Feibo Wang, Minjie Peng, Yubo Li, Xiaolong School of Computer Science Hunan University of Technology and Business Changsha China Xiangjiang Laboratory Changsha China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China College of Information Science and Engineering Hunan Normal University Changsha China

The intelligent reflection surface (IRS) and unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system is widely used in temporary and emergency scenarios. Our goal is to minimize the energy consumption of the MEC system by jointly optimizing UAV locations, IRS phase shift, task offloading, and resource allocation with a variable number of UAVs. To this end, we propose a Flexible REsource Scheduling (FRES) framework by employing a novel deep progressive reinforcement learning which includes the following innovations: Firstly, a novel multi-task agent is presented to deal with the mixed integer nonlinear programming (MINLP) problem. The multi-task agent has two output heads designed for different tasks, in which a classified head is employed to make offloading decisions with integer variables while a fitting head is applied to solve resource allocation with continuous variables. Secondly, a progressive scheduler is introduced to adapt the agent to the varying number of UAVs by progressively adjusting a part of neurons in the agent. This structure can naturally accumulate experiences and be immune to catastrophic forgetting. Finally, a light taboo search (LTS) is introduced to enhance the global search of the FRES. The numerical results demonstrate the superiority of the FRES framework which can make real-time and optimal resource scheduling even in dynamic MEC systems. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

General Sparse Normalization and Proportionate ASE Algorithms 5

General Sparse Normalization and Proportionate ASE Algorithm...

引用

5th IEEE International Conference on Electronic information and Communication Technology, ICEICT 2022

作者： Hadi, Abdul Peng, Yan Qadir, Abdul Li, Yingsong Khan, Khushal College of Information and Communication Engineering Harbin Engineering University Harbin China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn230088 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China College of Intelligent System and Control Science Engineering Harbin Engineering University China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

Andrew's Sine Estimator (ASE) has recently been used to invent adaptive filtering, which can combat more kind of noises than conventional estimators. Inspired by the LMS and its sparse forms, normalization and proportionate ASE algorithms with Lawson constraints are constructed with the respective given names of Lawson normalization ASE (LNASE) and Lawson proportionate NASE (LPNASE). Simulations are performed to analyze the performance of these algorithms under impulsive noise. © 2022 IEEE.

关键词： Impulse noise

来源：评论

学校读者我要写书评

暂无评论

Circular Decomposition and Cross-Modal Recombination for Multimodal Sentiment Analysis

Circular Decomposition and Cross-Modal Recombination for Mul...

引用

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Haijian Liang Weicheng Xie Xilin He Siyang Song Linlin Shen School of Computer Science & Software Engineering Computer Vision Institue Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University School of Computing and Mathematical Sciences University of Leicester National Engineering Laboratory for Big Data System Computing Technology Shenzhen University

Multimodal Sentiment Analysis is a burgeoning research area, leveraging various modalities to predict the sentiment score. Nevertheless, previous studies have disregarded the impact of noise interference on specific modal sentiments during video recording, thereby compromising the accuracy of sentiment prediction. In this paper, we propose the Guided Circular Decomposition and Cross-Modal Recombination (GCD-CMR) model, which aims to eliminate contaminated sentiment features in a fine-grained way. To achieve this, we utilize tailored global information specific to each modality to guide the circular decomposing process in the GCD module, to produce a set of sentiment prototypes. Subsequently, in the CMR module, we align cross-modal sentiment prototypes and remove the contaminated prototypes for recombination. Experimental results on two publicly available datasets demonstrate that our model surpasses state-of-the-art models, confirming the effectiveness of our proposed method. We release the code at: https://***/nianhua20/GCD-CMR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ExpTopo: Explicit Topological Modeling for Bronchus Segmentation

ExpTopo: Explicit Topological Modeling for Bronchus Segmenta...

引用

IEEE International Symposium on Biomedical Imaging

作者： Mingyue Zhao Xiaolan Qiu S.Kevin Zhou Division of Life Sciences and Medicine School of Biomedical Engineering University of Science and Technology of China (USTC) China Center for Medical Imaging Robotics Analytic Computing & Learning (MIRACLE) Suzhou Institute for Advance Research USTC China Suzhou Key Laboratory of Microwave Imaging Processing and Application Technology Suzhou Aerospace Information Research Institute China Key Laboratory of Precision and Intelligent Chemistry University of Science and Technology of China (USTC) China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Airway extraction is paramount in the early diagnosis and treatment of respiratory diseases. As a tree-like structure, both topological-aware learning and voxel-wise classification are equally crucial for the airway. However, existing methods demonstrate insufficient topological learning, emphasizing only the supervision of individual key topological points. Consequently, this paper proposes a Explicit Topological Modeling (ExpTopo) approach to aid airway segmentation. It explicitly introduces topological metric space learning based on semantic segmentation, enhancing the model's structural perception by implementing global skeleton-level sparse topological learning (STL) and local voxel-level dense topological perception (DTP). Extensive experimental results demonstrate that the algorithm achieves competitive performance at both the topological and voxel levels. Code will be available in https://***/MorineZ/ExpTopo.

关键词： Codes Atmospheric modeling Semantic segmentation Pulmonary diseases Biological system modeling Extraterrestrial measurements Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

High-Fidelity Editable Portrait Synthesis with 3D GAN Inversion

High-Fidelity Editable Portrait Synthesis with 3D GAN Invers...

引用

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Jindong Xie Jiachen Liu Yupei Lin Jinbao Wang Xianxu Hou Linlin Shen Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University School of Information Engineering Guangdong University of Technology Guangzhou China Guangdong Provincial Key Laboratory of Intelligent Information Processing School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The 3D generative adversarial network (GAN) inversion converts an image into 3D representation to attain high-fidelity reconstruction and facilitate realistic image manipulation within the 3D latent space. However, previous approaches face challenges regarding the trade-off between the reconstruction ability and editability. That is, reversing a real-world image to a low-dimensional latent code would inevitably lead to information loss, and achieving a near-perfect reconstruction using high-rate triplane representation often limits the ability to manipulate the image freely in the latent space. To address these issues, we propose a novel latent conditioning encoder-based framework with the alignment between the low-dimensional latent and high-dimensional triplane. A non-semantic guided editing strategy bridges the intrinsic relation between the latent condition and triplane generation, making it possible to edit the high-dimensional representation by latent manipulation. As a result, our method can achieve high-fidelity reconstruction and editing simultaneously by directly controlling the latent code. Experimental results demonstrate that our approach excels in reconstruction and editing quality compared to previous 3D inversion methods. Furthermore, our method can also edit even real faces with large poses and out-of-domain cases.

关键词： Bridges Three-dimensional displays Codes Signal processing Generative adversarial networks Vectors Acoustics Speech processing Image reconstruction Faces

来源：评论

学校读者我要写书评

暂无评论

A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs

SSRN

引用

SSRN 2024年

作者： Li, Qingya Liu, Shengcai Zou, Juan Tang, Ke Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China The Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan411105 China

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most signiﬁcant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Speciﬁcally, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modiﬁed benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs

arXiv

引用

arXiv 2024年

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most significant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Specifically, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modified benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Agent-SiMT: Agent-Assisted Simultaneous Translation With Large Language Models

IEEE Transactions on Audio, Speech and Language Processing

引用

IEEE Transactions on Audio, Speech and Language processing 2025年 33卷 2074-2083页

作者： Shoutao Guo Shaolei Zhang Zhengrui Ma Min Zhang Yang Feng Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences (ICT/CAS) Beijing China University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of AI Safety Chinese Academy of Sciences Beijing China

Simultaneous Machine Translation (SiMT) generates target translations in real-time while reading the source sentence. It relies on a policy to determine the optimal timing for producing translations, aiming to achieve both low response latency and high translation quality. Existing SiMT methods typically utilize the traditional Transformer architecture, employing complicated dynamic programming algorithms to jointly optimize policy decisions and translation generation. While these methods excel at determining policies, their translation capabilities are suboptimal. In contrast, Large Language Models (LLMs), trained on extensive corpora, exhibit exceptional generation capabilities but struggle to learn translation policies through traditional Transformer-based training methods. To address these limitations, we introduce Agent-SiMT, a novel framework combining the strengths of LLMs and traditional SiMT methods. Agent-SiMT contains a policy-decision agent and a translation agent. The policy-decision agent is managed by a SiMT model, which determines the policy using partial source sentences and translations. The translation agent, powered by an LLM, generates the target translation according to the policy decisions. These two agents work collaboratively to perform SiMT. Experiments demonstrate that our method attains state-of-the-art performance.

关键词： Translation Hidden Markov models Transformers Training Large language models Collaboration Vocabulary Speech processing Memory modules Machine translation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：