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

2020 5th International Seminar on Computer technology, Mechanical and Electrical Engineering, ISCME 2020

作者： Jiang, Kaiwen Zhang, Degan Xu, Haixia Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300384 China Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin300410 China

With the fast development of 3D imaginations becomes more and more fascination, multi-view stereo based 3D reconstruction is a significant technique for those application. To facilitate the subsequent processing of 3D reconstruction and reduce the possibility of other algorithms falling into local optimal solutions, attempting to get better and faster performance, a new parallax calculation based on symmetric continuous optimization is proposed in this paper. The algorithm is proposed here will be tested respectively in the same data, in order to certificate the algorithm applied is better than traditional minimize El algorithm. © Published under licence by IOP Publishing Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Variable Rate Syndrome-Trellis Codes for Steganography on Bursty Channels 19th

Variable Rate Syndrome-Trellis Codes for Steganography on Bu...

引用

19th International Workshop on Digital Forensics and Watermarking, IWDW 2020

作者： Feng, Bingwen Liu, Zhiquan Wei, Kaimin Lu, Wei Lin, Yuchun College of Information Science and Technology Jinan University Guangzhou510632 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security Shenzhen518060 China School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University Guangzhou510006 China Guangzhou Institute of Science and Technology Guangzhou510006 China

ISBN: (纸本)9783030694487

This paper presents a type of variable rate syndrome-trellis codes (VR-STC) for bursty channels. It can embed message bits with two different embedding rates. In the embedding, a cover vector is sliced into segments, and the embedding rates for each segment depend on the local channel distribution. The parities of stego segments are exploited to indicate the selected embedding rates according to a mapping function between parities and embedding rates. The core of the VR-STC is the parity-aware encoder, which can simultaneously output two candidate stego segments with different embedding rates and opposite parities, either of which can be used to constitute the final stego vector. A Viterbi algorithm is also suggested to find the closed stego segments. Besides, the mapping function between parities and embedding rates is designed by minimizing the embedding costs on a down sampled version of the cover vector. It can further improve the undetectability of the VR-STC. Experimental results on artificial signals and binary images suggest that the proposed VR-STC can provide high success rate of embedding and reduce the embedding cost on bursty channels. © 2021, Springer Nature Switzerland AG.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

An Innovative Control Approach for Cyber-Physical Transportation Systems: The Case of Monte-Carlo Workflow Computations

An Innovative Control Approach for Cyber-Physical Transporta...

引用

Euromicro Conference on Parallel, Distributed and Network-Based processing

作者： Vladislav Kashansky Sara Agha Hossein Kashani Javier Garcia-Blas Fabrizio Marozzo Hai Zhuge Xiaoping Sun Research Laboratory Eteronix GmbH Vienna Austria Institute of Production and Logistics Management Business School Johannes Kepler Universität Linz Austria ARCOS Group Universidad Carlos III de Madrid Leganes Spain DIMES Department University of Calabria Rende Italy Key Laboratory of Intelligent Information Processing Institute of Computing Technology (ICTCAS) Beijing China

Contemporarily, in light of the intelligent transportation systems (ITS) sector, the tendency can be observed that the solution of the multi-objective cyber-physical optimization problems with imperfect information takes an increasingly weighted role. In the present scientific work, the authors want to take these developments into account by introducing an innovative cyber-physical architectural design and corresponding the two-stage heuristic computing approach. It is utilized in synergy with the MCSA 1 1 Multi-tier Cyber-physical System Architecture and DCEx architectural principles for the workflow scheduling of Monte-Carlo simulation, which is based on the intelligent and sustainable route-order dispatching process model. Factors such as emissions, transport costs, risks, and the individual weighting of orders are reflected in the model. In particular, the authors define a stochastic ILP-based 2 2 Integer Linear Programming monte-carlo workflow model. They further propose two-stage scheduling heuristic with 6-HEFT DAG relaxation as first stage and apply state-of-the-art techniques as a part of SCIP framework to solve 2nd 1–0 ILP-based stage; evaluate the performance of the scheduling approach. The authors obtain preliminary results of the second stage behavior using a realistic heterogeneous computing scenario and corresponding constraint structures within MACS simulator engine 3 3 Modular Architecture for Complex computing Systems Analysis. The results from the experiments illustrate moderate complexity of the approach. Scalability of the model looks promising for the applicability in various industry-related scenarios and corresponding computing environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Access Control with Privacy-Preserving Data Retrieval for Cloud-Assisted IoV

引用

IEEE Transactions on Vehicular technology 2025年

作者： Li, Wenchao Xia, Chunhe Yang, Simiao Wang, Kangming Huang, Guotao Huang, Luqi Guo, Fuchun Susilo, Willy Wang, Tianbo Beihang University School of Cyber Science and Technology Beijing100191 China University of Wollongong School of Computing and Information Technology Institute of Cybersecurity and Cryptology WollongongNSW2522 Australia Beihang University Beijing Key Laboratory of Network Technology Beijing100191 China Guangxi Normal University Guangxi Collab. Innovation Center of Multi-source Information Integration and Intelligent Processing Guilin541004 China Beihang University Sino-French Engineer School Beijing100191 China Beihang University Computer Science and Engineering School Beijing100191 China

In addition to the autonomous driving technology of single vehicles, the inter-group control algorithm serving the data sharing of multi-vehicle cooperative driving has also attracted widespread attention. To ensure secure communication, many encryption schemes have been proposed to protect the interaction data between vehicles. Nevertheless, traditional public key encryption schemes hinder the sharing of encrypted data. Based on the premise of ensuring the confidentiality of encrypted information, in order to facilitate efficient data sharing, conduct data searches across extensive cloud-based datasets, and authorize access under specified conditions, we introduce Fine-Grained Access Control with Privacy-Preserving Data Retrieval (FGAC-PPDR) for the Internet of Vehicles. This scheme offers a secure, flexible, and privacy-centric approach to data sharing for groups of vehicles in the IoV. Our proposed scheme enables encrypted data to be retrieved at the group level by the cloud server, and prevents vehicles outside the group from performing equality tests on the ciphertext. Furthermore, the data owner can create an authorization token with defined conditions to specify how the data is shared. During the process of data search and sharing, intensive computing tasks are undertaken by cloud servers with abundant computational resources. We also demonstrate that our scheme is secure against chosen ciphertext attacks (CCA). Finally, we provide security and performance analyses that verify the feasibility and effectiveness of our proposal. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Understanding the Robustness of 3D Object Detection with Bird'View Representations in Autonomous Driving

Understanding the Robustness of 3D Object Detection with Bir...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Zijian Zhu Yichi Zhang Hai Chen Yinpeng Dong Shu Zhao Wenbo Ding Jiachen Zhong Shibao Zheng Institute of Image Communication and Network Engineering Shanghai Jiao Tong University Dept. of Comp. Sci. and Tech. THBI Lab Institute for AI Tsinghua University BNRist Center Zhongguancun Laboratory Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Information Materials and Intelligent Sensing Laboratory of Anhui Province School of Computer Science and Technology Anhui University SAIC Motor AI Lab

3D object detection is an essential perception task in autonomous driving to understand the environments. The Bird's-Eye-View (BEV) representations have significantly improved the performance of 3D detectors with camera inputs on popular benchmarks. However, there still lacks a systematic understanding of the robustness of these vision-dependent BEV models, which is closely related to the safety of autonomous driving systems. In this paper, we evaluate the natural and adversarial robustness of various representative models under extensive settings, to fully understand their behaviors influenced by explicit BEV features compared with those without BEV. In addition to the classic settings, we propose a 3D consistent patch attack by applying adversarial patches in the 3D space to guarantee the spatiotemporal consistency, which is more realistic for the scenario of autonomous driving. With substantial experiments, we draw several findings: 1) BEV models tend to be more stable than previous methods under different natural conditions and common corruptions due to the expressive spatial representations; 2) BEV models are more vulnerable to adversarial noises, mainly caused by the redundant BEV features; 3) Camera-LiDARfusion models have superior performance under different settings with multi-modal inputs, but BEV fusion model is still vulnerable to adversarial noises of both point cloud and image. These findings alert the safety issue in the applications of BEV detectors and could facilitate the development of more robust models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Facilitating Multi-turn Emotional Support Conversation with Positive Emotion Elicitation: A Reinforcement Learning Approach

arXiv

引用

arXiv 2023年

作者： Zhou, Jinfeng Chen, Zhuang Wang, Bo Huang, Minlie The CoAI Group DCST Institute for Artificial Intelligence State Key Lab of Intelligent Technology and Systems China Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China College of Intelligence and Computing Tianjin University Tianjin China

Emotional support conversation (ESC) aims to provide emotional support (ES) to improve one’s mental state. Existing works stay at fitting grounded responses and responding strategies (e.g., question), which ignore the effect on ES and lack explicit goals to guide emotional positive transition. To this end, we introduce a new paradigm to formalize multi-turn ESC as a process of positive emotion elicitation. Addressing this task requires finely adjusting the elicitation intensity in ES as the conversation progresses while maintaining conversational goals like coherence. In this paper, we propose SUPPORTER, a mixture-of-expert-based reinforcement learning model, and well design ES and dialogue coherence rewards to guide policy’s learning for responding. Experiments verify the superiority of SUPPORTER in achieving positive emotion elicitation during responding while maintaining conversational goals including coherence. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Online Prototype Learning for Online Continual Learning

Online Prototype Learning for Online Continual Learning

引用

International Conference on Computer Vision (ICCV)

作者： Yujie Wei Jiaxin Ye Zhizhong Huang Junping Zhang Hongming Shan Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University MOE Frontiers Center for Brain Science Fudan University Shanghai Center for Brain Science and Brain-Inspired Technology

Online continual learning (CL) studies the problem of learning continuously from a single-pass data stream while adapting to new data and mitigating catastrophic forgetting. Recently, by storing a small subset of old data, replay-based methods have shown promising performance. Unlike previous methods that focus on sample storage or knowledge distillation against catastrophic forgetting, this paper aims to understand why the online learning models fail to generalize well from a new perspective of shortcut learning. We identify shortcut learning as the key limiting factor for online CL, where the learned features may be biased, not generalizable to new tasks, and may have an adverse impact on knowledge distillation. To tackle this issue, we present the online prototype learning (OnPro) framework for online CL. First, we propose online prototype equilibrium to learn representative features against shortcut learning and discriminative features to avoid class confusion, ultimately achieving an equilibrium status that separates all seen classes well while learning new classes. Second, with the feedback of online prototypes, we devise a novel adaptive prototypical feedback mechanism to sense the classes that are easily misclassified and then enhance their boundaries. Extensive experimental results on widely-used benchmark datasets demonstrate the superior performance of OnPro over the state-of-the-art baseline methods. Source code is available at https://***/weilllllls/OnPro.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Harnessing Hierarchical label Distribution Variations in Test Agnostic Long-tail Recognition

arXiv

引用

arXiv 2024年

作者： Yang, Zhiyong Xu, Qianqian Wang, Zitai Li, Sicong Han, Boyu Bao, Shilong Cao, Xiaochun Huang, Qingming School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China BDKM University of Chinese Academy of Sciences China

This paper explores test-agnostic long-tail recognition, a challenging long-tail task where the test label distributions are unknown and arbitrarily imbalanced. We argue that the variation in these distributions can be broken down hierarchically into global and local levels. The global ones reflect a broad range of diversity, while the local ones typically arise from milder changes, often focused on a particular neighbor. Traditional methods predominantly use a Mixture-of-Expert (MoE) approach, targeting a few fixed test label distributions that exhibit substantial global variations. However, the local variations are left unconsidered. To address this issue, we propose a new MoE strategy, DirMixE, which assigns experts to different Dirichlet meta-distributions of the label distribution, each targeting a specific aspect of local variations. Additionally, the diversity among these Dirichlet meta-distributions inherently captures global variations. This dual-level approach also leads to a more stable objective function, allowing us to sample different test distributions better to quantify the mean and variance of performance outcomes. Theoretically, we show that our proposed objective benefits from enhanced generalization by virtue of the variance-based regularization. Comprehensive experiments across multiple benchmarks confirm the effectiveness of DirMixE. The code is available at https: //***/scongl/DirMixE. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aligning Recommendation and Conversation via Dual Imitation

Aligning Recommendation and Conversation via Dual Imitation

引用

2022 Conference on Empirical Methods in Natural Language processing, EMNLP 2022

作者： Zhou, Jinfeng Wang, Bo Huang, Minlie Zhao, Dongming Huang, Kun He, Ruifang Hou, Yuexian College of Intelligence and Computing Tianjin University Tianjin China State Key Laboratory of Communication Content Cognition People's Daily Online Beijing China The CoAI Group DCST Institute for Artificial Intelligence State Key Lab of Intelligent Technology and Systems China Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China AI Lab China Mobile Communication Group Tianjin Co. Ltd. China

Human conversations of recommendation naturally involve the shift of interests which can align the recommendation actions and conversation process to make accurate recommendations with rich explanations. However, existing conversational recommendation systems (CRS) ignore the advantage of user interest shift in connecting recommendation and conversation, which leads to an ineffective loose coupling structure of CRS. To address this issue, by modeling the recommendation actions as recommendation paths in a knowledge graph (KG), we propose DICR (Dual Imitation for Conversational Recommendation), which designs a dual imitation to explicitly align the recommendation paths and user interest shift paths in a recommendation module and a conversation module, respectively. By exchanging alignment signals, DICR achieves bidirectional promotion between recommendation and conversation modules and generates high-quality responses with accurate recommendations and coherent explanations. Experiments demonstrate that DICR outperforms the state-of-the-art models on recommendation and conversation performance with automatic, human, and novel explainability metrics. © 2022 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Rate-Splitting Multiple Access Enabled Green Probabilistic Semantic Communication over Wireless Networks

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2025年

作者： Xu, Ruopeng Yang, Zhaohui Mao, Yijie Huang, Chongwen Yang, Qianqian Xu, Lexi Xu, Wei Zhang, Zhaoyang Zhejiang University College of Information Science and Electronic Engineering China Hangzhou310027 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China Zhejiang Prov. Key Lab. of Multi-Modal Communication Networks and Intelligent Information Processing Hangzhou310027 China China United Network Communications Corporation Research Institute Beijing100048 China Southeast University National Mobile Communications Research Laboratory Nanjing211189 China

In this paper, we propose a multi-user green probabilistic semantic communication (PSC) system for semantic communication (SemCom) facilitated by probabilistic knowledge graphs (PKGs), which are knowledge graphs (KGs) integrated with probability to represent semantic information. In the considered model, semantic information of different users is represented by PKGs. On this basis, we design a semantic compression model for multi-user downlink task-oriented SemCom, utilizing the semantic compression ratio (SCR) as a parameter to connect the computation and communication processes of information transmission. Utilizing rate-splitting multiple access (RSMA) technology, the transmitted messages are splitted into shared and private ones. Considering the limited wireless resources and constraint in semantic communication, an optimization problem with the goal of minimizing system energy consumption comprehensively considering the computation and communication process is formulated. In order to address the optimization problem, we propose an alternating optimization algorithm that tackles sub-problems of power allocation and beamforming design with successive convex approximation (SCA) method, semantic compression ratio optimization with variable substitution method, and computation capacity allocation with obtaining closed-form optimal solution. Simulation results verify the effectiveness of the proposed algorithm. © 2017 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：