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

arXiv 2021年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Li, Guofa Anil, Carie Li, Keqiang Guo, Xinyu Sun, Geng Tian, Daxin Cao, Dongpu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institute of Human Factors and Ergonomics College of Mechatronics and Control Engineering Shenzhen University Guangdong Shenzhen518060 China School of Computer Science and Engineering VIT-AP Andhra Pradesh Amaravati522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China State Key Laboratory of Automotive Safety and Energy Department of Automotive Engineering Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Beijing100191 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

In the Internet of things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming vehicular networks (VNs) that provide efficient and safe traffic and ubiquitous access to various applications. However, as the number of nodes in an ITS increases, it is challenging to satisfy a varied and large number of service requests with different quality of service (QoS) and security requirements in highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources to achieve the objective for either an individual or a group. Game theory (GT), a theoretical framework designed for strategic interactions among rational decision makers sharing scarce resources, can be used to model and analyze individual or group behaviors of communicating entities in VNs. This paper primarily surveys the recent developments of GT in solving various challenges of VNs. This survey starts with an introduction to the background of VNs. A review of GT models studied in the VNs is then introduced, including the basic concepts, classifications, and applicable vehicular issues. After discussing the requirements of VNs and the motivation of using GT, a comprehensive literature review on GT applications in dealing with the challenges of current VNs is provided. Furthermore, recent contributions of GT to VNs that are integrated with diverse emerging 5G technologies are surveyed. Finally, the lessons learned are given, and several key research challenges and possible solutions of applying GT in VNs are outlined. Copyright © 2021, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

基于Web Services的信息系统的实施研究

基于Web Services的信息系统的实施研究

引用

第15届海峡两岸信息管理发展与策略学术研讨会(2009)

作者： Zuo Meiyun 左美云 Wang Shijuan 王世娟 In formation School and Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin Univ 中国人民大学信息学院数据工程与知识工程教育部重点实验室北京

基于Web Services的信息系统将会是今后信息系统建设的一种重要模式。论文在对23个实施基于WebServices的信息系统的二手资料分析的基础上，归纳了基于Web Services的信息系统的类型、实施策略和实施过程。

关键词：企业管理信息系统控制策略网络服务

来源：评论

学校读者我要写书评

暂无评论

Intersection-free Robot Manipulation with Soft-Rigid Coupled Incremental Potential Contact

arXiv

引用

arXiv 2023年

作者： Du, Wenxin Yao, Siqiong Wang, Xinlei Xu, Yuhang Xu, Wenqiang Lu, Cewu The School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China SJTU-Yale Joint Center of Biostatistics and Data Science National Center for Translational Medicine Shanghai Jiao Tong University China Qing Yuan Research Institute MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai China ZenusTech Inc Philippines

This paper presents a novel simulation platform, ZeMa, designed for robotic manipulation tasks concerning soft objects. Such simulation ideally requires three properties: two-way soft-rigid coupling, intersection-free guarantees, and frictional contact modeling, with acceptable runtime suitable for deep and reinforcement learning tasks. Current simulators often satisfy only a subset of these needs, primarily focusing on distinct rigid-rigid or soft-soft interactions. The proposed ZeMa prioritizes physical accuracy and integrates the incremental potential contact method, offering unified dynamics simulation for both soft and rigid objects. It efficiently manages soft-rigid contact, operating 75x faster than baseline tools with similar methodologies like IPC-GraspSim. To demonstrate its applicability, we employ it for parallel grasp generation, penetrated grasp repair, and reinforcement learning for grasping, successfully transferring the trained RL policy to real-world scenarios. More experiments and videos can be found in the supplementary materials and on the website: https: //***/view/zema-ipc. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Structure-aware random fourier kernel for graphs 21

Structure-aware random fourier kernel for graphs

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Jinyuan Fang Qiang Zhang Zaiqiao Meng Shangsong Liang School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Hangzhou Innovation Center Zhejiang University China and College of Computer Science and Technology Zhejiang University China and AZFT Knowledge Engine Lab China School of Computing Science University of Glasgow United Kingdom and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

ISBN: (纸本)9781713845393

Gaussian Processes (GPs) define distributions over functions and their generalization capabilities depend heavily on the choice of kernels. In this paper, we propose a novel structure-aware random Fourier (SRF) kernel for GPs that brings several benefits when modeling graph-structured data. First, SRF kernel is defined with a spectral distribution based on the Fourier duality given by the Bochner's theorem, transforming the kernel learning problem to a distribution inference problem. Second, SRF kernel admits a random Fourier feature formulation that makes the kernel scalable for optimization. Third, SRF kernel enables to leverage geometric structures by taking subgraphs as inputs. To effectively optimize GPs with SRF kernel, we develop a variational EM algorithm, which alternates between an inference procedure (E-step) and a learning procedure (M-step). Experimental results on five real-world datasets show that our model can achieve state-of-the-art performance in two typical graph learning tasks, i.e., object classification and link prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SOLVING CONTINUAL OFFLINE RL THROUGH SELECTIVE WEIGHTS ACTIVATION ON ALIGNED SPACES

arXiv

引用

arXiv 2024年

作者： Hu, Jifeng Huang, Sili Shen, Li Yang, Zhejian Hu, Shengchao Tang, Shisong Chen, Hechang Chang, Yi Tao, Dacheng Sun, Lichao School of Artificial Intelligence Jilin University China School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University China MoE Key Lab of Artificial Intelligence Shanghai Jiao Tong University China Shenzhen International Graduate School Tsinghua University China College of Computing and Data Science Nanyang Technological University Singapore Computer Science and Engineering Lehigh University United States

Continual offline reinforcement learning (CORL) has shown impressive ability in diffusion-based lifelong learning systems by modeling the joint distributions of trajectories. However, most research only focuses on limited continual task settings where the tasks have the same observation and action space, which deviates from the realistic demands of training agents in various environments. In view of this, we propose Vector-Quantized Continual Diffuser, named VQ-CD, to break the barrier of different spaces between various tasks. Specifically, our method contains two complementary sections, where the quantization spaces alignment provides a unified basis for the selective weights activation. In the quantized spaces alignment, we leverage vector quantization to align the different state and action spaces of various tasks, facilitating continual training in the same space. Then, we propose to leverage a unified diffusion model attached by the inverse dynamic model to master all tasks by selectively activating different weights according to the task-related sparse masks. Finally, we conduct extensive experiments on 15 continual learning (CL) tasks, including conventional CL task settings (identical state and action spaces) and general CL task settings (various state and action spaces). Compared with 16 baselines, our method reaches the SOTA performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Vector quantization

来源：评论

学校读者我要写书评

暂无评论

Triplet Deep Subspace Clustering via Self-Supervised data Augmentation

Triplet Deep Subspace Clustering via Self-Supervised Data Au...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Xianzhen Li Haijun Zhang Yi Yang Shuicheng Yan Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Computer Science and Technology Soochow University Suzhou China Harbin Institute of Technology (Shenzhen) Shenzhen China Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia Sea AI Lab (SAIL) & National University of Singapore Singapore

ISBN: (纸本)9781665423991

Deep subspace clustering (DSC) with the auto-encoder and self-expression layer is of great concern due to encouraging performance. However, existing methods usually adopt a “single-task” strategy based on a single dataset, without considering other related tasks or data. As such, they cannot discover other useful information to improve the clustering task. Besides, the local structure preservation of the latent codes in mapping is usually ignored. In this paper, we therefore present an effective “multi-task” strategy via the self-supervised data augmentation, and propose a new end-to-end trainable Triplet Deep Subspace Clustering Network (TDSC-net). Specifically, TDSC-net firstly generates triplet data (i.e., anchor, positive and negative data) from input data by a spectral clustering module and a self-supervised data augmentation module. This can enable it to inherit the merits of self-supervised learning and multitask learning implicitly. After that, TDSC-net builds a triplet deep autoencoder network with a self-expression layer, which takes the triplet data as input, where they share the common network layers (i.e., autoencoder and self-expression layers) over the triple tasks for complementary learning and mutual supervision. A triplet loss is also included to retain the local information of deep latent codes, which will also benefit the self-expression. Furthermore, TDSC-net separates the self-expression layer from decoding process to improve the efficiency of reconstruction. Extensive results on several public datasets demonstrate the effectiveness of our triplet-task DSC strategy.

关键词： Codes Conferences Multitasking Decoding data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

Disentangled Noisy Correspondence Learning

arXiv

引用

arXiv 2024年

作者： Dang, Zhuohang Luo, Minnan Wang, Jihong Jia, Chengyou Han, Haochen Wan, Herun Dai, Guang Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China SGIT AI Lab State Grid Shaanxi Electric Power Company Limited State Grid Corporation of China Shaanxi China The School of Information Science and Technology University of Science and Technology China United Arab Emirates The Baidu Inc China

Cross-modal retrieval is crucial in understanding latent correspondences across modalities. However, existing methods implicitly assume well-matched training data, which is impractical as real-world data inevitably involves imperfect alignments, i.e., noisy correspondences. Although some works explore similarity-based strategies to address such noise, they suffer from sub-optimal similarity predictions influenced by modality-exclusive information (MEI), e.g., background noise in images and abstract definitions in texts. This issue arises as MEI is not shared across modalities, thus aligning it in training can markedly mislead similarity predictions. Moreover, although intuitive, directly applying previous cross-modal disentanglement methods suffers from limited noise tolerance and disentanglement efficacy. Inspired by the robustness of information bottlenecks against noise, we introduce DisNCL, a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning, to adaptively balance the extraction of MII and MEI with certifiable optimal cross-modal disentanglement efficacy. DisNCL then enhances similarity predictions in modality-invariant subspace, thereby greatly boosting similarity-based alleviation strategy for noisy correspondences. Furthermore, DisNCL introduces soft matching targets to model noisy many-to-many relationships inherent in multi-modal input for noise-robust and accurate cross-modal alignment. Extensive experiments confirm DisNCL's efficacy by 2% average recall improvement. Mutual information estimation and visualization results show that DisNCL learns meaningful MII/MEI subspaces, validating our theoretical analyses. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features

arXiv

引用

arXiv 2024年

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation Techniques

arXiv

引用

arXiv 2024年

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at this url. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning with Group Noise

arXiv

引用

arXiv 2021年

作者： Wang, Qizhou Yao, Jiangchao Gong, Chen Liu, Tongliang Gong, Mingming Yang, Hongxia Han, Bo Department of Computer Science Hong Kong Baptist University Hong Kong Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of MoE School of Computer Science and Engineering Nanjing University of Science and Technology China Data Analytics and Intelligence Lab Alibaba Group China Department of Computing Hong Kong Polytechnic University Hong Kong Trustworthy Machine Learning Lab School of Computer Science University of Sydney Australia School of Mathematics and Statistics University of Melbourne Australia

Machine learning in the context of noise is a challenging but practical setting to plenty of real-world applications. Most of the previous approaches in this area focus on the pairwise relation (casual or correlational relationship) with noise, such as learning with noisy labels. However, the group noise, which is parasitic on the coarse-grained accurate relation with the fine-grained uncertainty, is also universal and has not been well investigated. The challenge under this setting is how to discover true pairwise connections concealed by the group relation with its fine-grained noise. To overcome this issue, we propose a novel Max-Matching method for learning with group noise. Specifically, it utilizes a matching mechanism to evaluate the relation confidence of each object (cf. Figure 1) w.r.t. the target, meanwhile considering the Non-IID characteristics among objects in the group. Only the most confident object is considered to learn the model, so that the fine-grained noise is mostly dropped. The performance on a range of real-world datasets in the area of several learning paradigms demonstrates the effectiveness of Max-Matching. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：