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

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Ma, Yi Hao, Jianye Hu, Xiaohan Zheng, Yan Xiao, Chenjun School of Computer and Information Technology Shanxi University China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education China College of Intelligence and Computing Tianjin University China Noah's Ark Lab Huawei Canada The Chinese University of Hong Kong Shenzhen China

One of the fundamental challenges for offline reinforcement learning (RL) is ensuring robustness to data distribution. Whether the data originates from a near-optimal policy or not, we anticipate that an algorithm should demonstrate its ability to learn an effective control policy that seamlessly aligns with the inherent distribution of offline data. Unfortunately, behavior regularization, a simple yet effective offline RL algorithm, tends to struggle in this regard. In this paper, we propose a new algorithm that substantially enhances behavior-regularization based on conservative policy iteration. Our key observation is that by iteratively refining the reference policy used for behavior regularization, conservative policy update guarantees gradually improvement, while also implicitly avoiding querying out-of-sample actions to prevent catastrophic learning failures. We prove that in the tabular setting this algorithm is capable of learning the optimal policy covered by the offline dataset, commonly referred to as the in-sample optimal policy. We then explore several implementation details of the algorithm when function approximations are applied. The resulting algorithm is easy to implement, requiring only a few lines of code modification to existing methods. Experimental results on the D4RL benchmark indicate that our method outperforms previous state-of-the-art baselines in most tasks, clearly demonstrate its superiority over behavior regularization. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GC-SALM: Multi-Task Runoff Prediction Using Spatial-Temporal Attention Graph Convolution Networks

GC-SALM: Multi-Task Runoff Prediction Using Spatial-Temporal...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Lu, Jin Xie, Zaipeng Chen, Jiayu Li, Maohua Xu, Chenghong Cao, Hongli Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing China College of Computer and Information Hohai University Nanjing China Southeast University Key Laboratory of Underwater Acoustic Signal Processing of Ministry of Education Nanjing China

ISBN: (纸本)9798350337020

Runoff prediction is essential for flood forecasting, irrigation planning, and sustainable water resource management. However, accurate predictions can be challenging due to the involvement of multiple variables. This paper presents a novel Graph Convolution-based Spatial-temporal Attention LSTM Multi-Task learning (GC-SALM) model for accurate runoff predictions. Our approach combines a multilayer neural network and an attention mechanism for enhanced generalization performance. The GC-SALM model employs spatial attention and graph convolutional networks to discern local and global spatial patterns, while temporal attention and LSTM are utilized to capture temporal characteristics within extended sequences. Experimental results reveal that the proposed model outperforms six state-of-the-art methods in runoff prediction and flow calibration, emphasizing its potential for real-world hydrological applications. © 2023 IEEE.

关键词： Graph convolutional networks Multi-Task Learning Runoff prediction Spatial and temporal modeling

来源：评论

学校读者我要写书评

暂无评论

A New Diagnosis and Treatment Platform for Autism Spectrum Disorder Based on Artificial Intelligence 2

A New Diagnosis and Treatment Platform for Autism Spectrum D...

引用

2nd International Conference on Digital Society and Intelligent Systems, DSInS 2022

作者： Zhang, Yuhuan Chen, Mo Lin, Qiwen Song, Yipin Wang, Miaomiao Xie, Yao Sun, Cuimin School of computer Electronics and Information Guangxi University Nanning China Guangxi Colleges Universities Key Laboratory of Multimedia Communications and Information Processing Nanning China School of Information Science and Technology University of Science and Technology of China Hefei China Anhui Tongling Bionic Technology Co. Ltd Hefei China

ISBN: (纸本)9781510663244

This paper aims to develop a new diagnosis and treatment platform for autism spectrum disorder based on artificial intelligence in view of the difficulties in the autism diagnosis and treatment industry in the market, such as a mix of institutions, shortage of talents and high treatment costs, as well as the shortcomings of related diagnosis and treatment digital platforms with single functions and low differentiation. The platform is mainly presented in the form of websites, apps and small programs. It integrates the functions of autism diagnosis, autism intervention, prognosis monitoring and other functions. It quantifies and visualizes the diagnosis data of autism through artificial intelligence technology, and provides an intelligent "stethoscope" for autism diagnosis, with a view to further advancing the diagnosis age of children. To achieve early detection, intervention and treatment of autism, so that children with autism have a better prognosis. Families will be connected with professional resources through artificial intelligence, and services between people will be connected through science and technology, allowing professional intervention from organizations to enter families. © 2023 SPIE.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Near-field focusing properties of microcylinders decorated with engineered metallic surface patches

Near-field focusing properties of microcylinders decorated w...

引用

2022 International Conference on Optical and Photonic Engineering, icOPEN 2022

作者： Xu, Chu Yang, Tian-Yu Zou, Peng-Xin Ye, Ran Key Laboratory for Opto-Electronic Technology of Jiangsu Province Nanjing Normal University Nanjing210023 China School of Computer and Electronic Information Nanjing Normal University Nanjing210023 China

ISBN: (纸本)9781510661905

Photonic hooks (PHs) are non-evanescent light beams with a highly concentrated curved optical fields. Since their discovery, PHs always have one single inflection point and thus have a hook-like structure. In this work, a new type of PHs with two inflection points and S-shaped structures were reported for the first time. We theoretically studied the effects of various physical parameters on the generation of S-shaped photonic hook (S-PH). The S-PH may have potential applications in super-resolution imaging, subwavelength micromachining, particle and cell manipulation, etc. © 2022 SPIE.

关键词： Molecular biology

来源：评论

学校读者我要写书评

暂无评论

Quality-Oriented Task Assignment for Heterogeneous Users in Mobile Crowdsensing 26

Quality-Oriented Task Assignment for Heterogeneous Users in ...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Chen, Kang Li, Peng Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Mobile crowdsensing (MCS) is a potential technology for large-scale data collection. This technology requires the platform to recruit users to complete tasks in specific areas. A vital issue in MCS is task assignment, and most existing task assignment efforts consider only a single user type, which is not reasonable in real scenarios. Task assignment becomes more complicated when the platform tries to assign tasks to heterogeneous users with a limited budget in the platform. In this paper, we consider a quality-oriented task assignment for heterogeneous users problem. Professional users have a high sensing quality with a high cost, and normal users have a low sensing quality with a low cost First, we model the sensing capabilities and the costs of different users and formulate the quality-oriented task assignment for heterogeneous users problem. Then, we design the integer linear programming form and prove that the problem is NP-hard. By verifying the submodularity of the objective function, we present a greedy algorithm. Considering the inefficiency of the algorithm, we design two genetic algorithms to improve the total sensing quality. Finally, we evaluate the proposed algorithms under different cost cases based on a real dataset The results show that our proposed algorithm performs well under different cost distribution scenarios. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Derivative Matrix-Based Covert Communication Method in Blockchain

引用

computer Systems Science & Engineering 2023年第7期46卷 225-239页

作者： Xiang Zhang Xiaona Zhang Xiaorui Zhang Wei Sun Ruohan Meng Xingming Sun School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Hydrology and Water Resources Nanjing University of Information Science&TechnologyNanjing210044China Wuxi Research Institute Nanjing University of Information Science&TechnologyWuxi214100China Key Laboratory of Hydrometeorological Disaster Mechanism andWarning ofMinistry ofWater Resources Nanjing210044China Engineering Research Center of Digital Forensics Ministry of EducationJiangsu Engineering Center of Network MonitoringSchool of Computer and SoftwareNanjing University of Information Science&TechnologyNanjing210044China Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology(CICAEET) NanjingUniversity of Information Science&TechnologyNanjing210044China School of Automation Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Science Engineering Nanyang Technological UniversitySingapore

The data in the blockchain cannot be tampered with and the users are anonymous,which enables the blockchain to be a natural carrier for covert ***,the existing methods of covert communication in blockchain suffer from the predefined channel structure,the capacity of a single transaction is not high,and the fixed transaction behaviors will lower the concealment of the communication ***,this paper proposes a derivation matrix-based covert communication method in *** uses dual-key to derive two types of blockchain addresses and then constructs an address matrix by dividing addresses into multiple layers to make full use of the redundancy of ***,to solve the problem of the lack of concealment caused by the fixed transaction behaviors,divide the rectangular matrix into square blocks with overlapping regions and then encrypt different blocks sequentially to make the transaction behaviors of the channel addresses match better with those of the real ***,the linear congruence algorithm is used to generate random sequence,which provides a random order for blocks encryption,and thus enhances the security of the encryption *** results show that this method can effectively reduce the abnormal transaction behaviors of addresses while ensuring the channel transmission efficiency.

关键词： Covert communication blockchain concealment security capacity derivation

来源：评论

学校读者我要写书评

暂无评论

Mamba-VA: A Mamba-based Approach for Continuous Emotion Recognition in Valence-Arousal Space

arXiv

引用

arXiv 2025年

作者： Liang, Yuheng Liu, Feng Liu, Mingzhou Yao, Yu Wang, Zheyu Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Intelligent Information Processing and Communication Technology China Nanjing University of Science and Technology ZiJin College School of Computer and Artificial Intelligence China

Continuous Emotion Recognition (CER) plays a crucial role in intelligent human-computer interaction, mental health monitoring, and autonomous driving. Emotion modeling based on the Valence-Arousal (VA) space enables a more nuanced representation of emotional states. However, existing methods still face challenges in handling long-term dependencies and capturing complex temporal dynamics. To address these issues, this paper proposes a novel emotion recognition model, Mamba-VA, which leverages the Mamba architecture to efficiently model sequential emotional variations in video frames. First, the model employs a Masked Autoencoder (MAE) to extract deep visual features from video frames, enhancing the robustness of temporal information. Then, a Temporal Convolutional Network (TCN) is utilized for temporal modeling to capture local temporal dependencies. Subsequently, Mamba is applied for long-sequence modeling, enabling the learning of global emotional trends. Finally, a fully connected (FC) layer performs regression analysis to predict continuous valence and arousal values. Experimental results on the Valence-Arousal (VA) Estimation task of the 8th competition on Affective Behavior Analysis in-the-wild (ABAW) demonstrate that the proposed model achieves valence and arousal scores of 0.5362 (0.5036) and 0.4310 (0.4119) on the validation (test) set, respectively, outperforming the baseline. The source code is available on GitHub: https://***/FreedomPuppy77/Charon. Copyright © 2025, The Authors. All rights reserved.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Two-stage Vehicle Pair Dispatch in Multi-hop Ridesharing 26

Two-stage Vehicle Pair Dispatch in Multi-hop Ridesharing

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wei, Xiaobo Li, Peng Huang, Weiyi Liu, Zhiyuan Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Ridesharing benefits the economy and the environment. In multi-hop ridesharing, passengers are permitted to switch vehicles within a single trip, extending the flexibility of conventional ridesharing. Nonetheless, vehicle dispatch is a difficult issue in multi-hop ridesharing. We subdivide the vehicle dispatching problem into the vehicle pairing problem and the request selection problem within a vehicle pair. To address these subproblems, we propose a two-stage framework for vehicle pair dispatching. In the initial stage, we model the vehicle pairing problem as a maximum vehicle-vehicle matching problem in a general graph, which differs from the conventional vehicle-request matching problem in a bipartite graph. The vehicle pairing algorithm is proposed to efficiently solve the vehicle pairing problem. In the second stage, we model the request selection problem as a multidimensional knapsack problem (d-KP) and propose an LP-relaxation request selection algorithm with an approximation ratio 1/5. Experiments conducted on a real-world dataset demonstrate the economic benefit of our proposed two-stage framework. © 2023 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

On Privacy-Preserving Task Assignment for Heterogeneous Users in Mobile Crowdsensing 26

On Privacy-Preserving Task Assignment for Heterogeneous User...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Ji Li, Peng Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Task assignment is a key challenge in mobile crowd-sensing because of the varying capabilities of crowd users. Location-based task assignment schemes require users to upload their location to an untrusted platform, which raises many privacy concerns. However, stronger privacy preservation may lead to lower system utility. It is challenging to maximize system utility under privacy preservation for users. In this paper, we propose a privacy-preserving task assignment for heterogeneous users (PTAH) problem in mobile crowdsensing. Specifically, we divide users into two groups: private users with location privacy requirements and public users without location privacy requirements. We first design a privacy-preserving mechanism to obfuscate the actual location of private users. Then we construct a relationship graph based on the locations between users and tasks. We prove that the PTAH problem is an NP-hard problem, so to maximize the system utility, we propose an approximation algorithm based on the greedy algorithm. Then we propose a multi-thread cooperative simulated annealing algorithm to search for a better approximate solution. Finally, we conducted simulations based on the widely-used real-world Roma dataset. The results show that our proposed algorithm consistently outperforms other baseline algorithms. © 2023 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Overview of the SIGHAN 2024 Shared Task for Chinese Dimensional Aspect-Based Sentiment Analysis 10

Overview of the SIGHAN 2024 Shared Task for Chinese Dimensio...

引用

10th SIGHAN Workshop on Chinese Language processing, SIGHAN 2024

作者： Lee, Lung-Hao Yu, Liang-Chih Wang, Suge Liao, Jian Institute of Artificial Intelligence Innovation National Yang Ming Chiao Tung University Taiwan Department of Information Management Yuan Ze University Taiwan School of Computer and Information Technology Shanxi University Taiyuan China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Taiyuan China

ISBN: (纸本)9798891761551

This paper describes the SIGHAN-2024 shared task for Chinese dimensional aspect-based sentiment analysis (ABSA), including task description, data preparation, performance metrics, and evaluation results. Compared to representing affective states as several discrete classes (i.e., sentiment polarity), the dimensional approach represents affective states as continuous numerical values (called sentiment intensity) in the valence-arousal space, providing more fine-grained affective states. Therefore, we organized a dimensional ABSA (shorted dimABSA) shared task, comprising three subtasks: 1) intensity prediction, 2) triplet extraction, and 3) quadruple extraction, receiving a total of 214 submissions from 61 registered participants during evaluation phase. A total of eleven teams provided selected submissions for each subtask and seven teams submitted technical reports for the subtasks. This shared task demonstrates current NLP techniques for dealing with Chinese dimensional ABSA. All data sets with gold standards and evaluation scripts used in this shared task are publicly available for future research. © 2024 Association for Computational Linguistics

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：