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

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud computing, 16th IEEE International Conference on Social computing and Networking and 13th International Conference on Sustainable computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Jin, Zhenkun Wan, Xingshi Nie, Xin Zhou, Xinlei Yi, Yuanyuan Zhou, Gefei Wuhan Business University Wuhan Research Institute of Posts and Telecommunications Wuhan China Wuhan Research Institute of Posts and Telecommunications Wuhan China Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Wuhan China Huazhong University of Science and Technology School of Journalism and Information Communication Wuhan China Huazhong University of Science and Technology School of Computer Science & Technology Wuhan China

ISBN: (纸本)9798350329223

In light of recent advancements in Internet of Multimedia Things (IoMT) and 5G technology, both the variety and quantity of data have been rapidly increasing. Consequently, handling zero-shot cross-modal retrieval (ZSCMR) of unlabeled multi-modal data has emerged as a prominent research topic. Early models utilized generative adversarial networks and class embeddings to assist in building a common feature space. However, this approach resulted in a loss of reliability in the feature distributions of individual modalities. In this paper, we propose a method called Ranking on Heterogeneous Manifold (RHM) to address the aforementioned issue. Our model comprises three feature extractors, each dedicated to extracting features from text, images and multimodal data. Subsequently, the relationship structures derived from these feature extractors are employed to construct a heterogeneous manifold. A diffusion process is then conducted on this heterogeneous manifold, ultimately yielding the final ranking scores. Comprehensive experiments demonstrate that the proposed modal has the capability to acquire more effective knowledge representation, thus enhancing the effectiveness of ZSCMR. © 2023 IEEE.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Semantic Alignment with Transferred Person-SAM for Text-based Person Retrieval 24

Fine-grained Semantic Alignment with Transferred Person-SAM ...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wang, Yihao Yang, Meng Cao, Rui School of Computer Science and Engineering Sun Yat-Sen University Guangdong Guangzhou China State Key Laboratory of Integrated Services Networks Xidian University Shaanxi Xi'an China Ministry of Education Guangdong Guangzhou China School of Information Science and Technology State-Province Joint Engineering and Research Center of Advanced Networking and Intelligent Information Services Northwest University Shaanxi Xi'an China

ISBN: (纸本)9798400706868

Addressing the disparity in description granularity and information gap between images and text has long been a formidable challenge in text-based person retrieval (TBPR) tasks. Recent researchers tried to solve this problem by random local alignment. However, they failed to capture the fine-grained relationships between images and text, so the information and modality gaps remain on the table. We align image regions and text phrases at the same semantic granularity to address the semantic atomicity gap. Our idea is first to extract and then exploit the relationships between fine-grained locals. We introduce a novel Fine-grained Semantic Alignment with Transferred Person-SAM (SAP-SAM) approach. By distilling and transferring knowledge, we propose a Person-SAM model to extract fine-grained semantic concepts at the same granularity from images and texts of TBPR and its relationships. With the extracted knowledge, we optimize the fine-grained matching via Explicit Local Concept Alignment and Attentive Cross-modal Decoding to discriminate fine-grained image and text features at the same granularity level and represent the important semantic concepts from both modalities, effectively alleviating the granularity and information gaps. We evaluate our proposed approach on three popular TBPR datasets, demonstrating that SAP-SAM achieves state-of-the-art results and underscores the effectiveness of end-to-end fine-grained local alignment in TBPR tasks. © 2024 ACM.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

PB-UAP: Hybride Universal Adversarial Attack for Image Segmentation

PB-UAP: Hybride Universal Adversarial Attack for Image Segme...

引用

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

作者： Yufei Song Ziqi Zhou Minghui Li Xianlong Wang Hangtao Zhang Menghao Deng Wei Wan Shengshan Hu Leo Yu Zhang Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology School of Computer Science and Technology Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

With the rapid advancement of deep learning, the model robustness has become a significant research hotspot, i.e., adversarial attacks on deep neural networks. Existing works primarily focus on image classification tasks, aiming to alter the model’s predicted labels. Due to the output complexity and deeper network architectures, research on adversarial examples for segmentation models is still limited, particularly for universal adversarial perturbations. In this paper, we propose a novel universal adversarial attack method designed for segmentation models, which includes dual feature separation and low-frequency scattering modules. The two modules guide the training of adversarial examples in the pixel and frequency space, respectively. Experiments demonstrate that our method achieves high attack success rates surpassing the state-of-the-art methods, and exhibits strong transferability across different models.

关键词： Training Image segmentation Perturbation methods Semantics Scattering Signal processing Predictive models Network architecture Robustness Speech processing

来源：评论

学校读者我要写书评

暂无评论

APSeg: Auto-Prompt Network for Cross-Domain Few-Shot Semantic Segmentation

APSeg: Auto-Prompt Network for Cross-Domain Few-Shot Semanti...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Weizhao He Yang Zhang Wei Zhuo Linlin Shen Jiaqi Yang Songhe Deng Liang Sun Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen Institute of Artificial Intelligence and Robotics for Society School of Computer Science University of Nottingham China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Few-shot semantic segmentation (FSS) endeavors to segment unseen classes with only a few labeled samples. Current FSS methods are commonly built on the assumption that their training and application scenarios share similar domains, and their performances degrade significantly while applied to a distinct domain. To this end, we propose to leverage the cutting-edge foundation model, the segment Anything Model (SAM), for generalization enhancement. The SAM however performs unsatisfactorily on domains that are distinct from its training data, which primarily comprise natural scene images, and it does not support automatic segmentation of specific semantics due to its interactive prompting mechanism. In our work, we introduce APSeg, a novel auto-prompt network for cross-domain few-shot semantic segmentation (CD-FSS), which is designed to be auto-prompted for guiding cross-domain segmentation. Specifically, we propose a Dual Prototype Anchor Transformation (DPAT) module that fuses pseudo query prototypes extracted based on cycle-consistency with support prototypes, allowing features to be transformed into a more stable domain-agnostic space. Additionally, a Meta Prompt (MPG) module is introduced to automatically generate prompt embeddings, eliminating the need for manual visual prompts. We build an efficient model which can be applied directly to target domains without fine-tuning. Extensive experiments on four cross-domain datasets show that our model outperforms the state-of-the-art CD-FSS method by 5.24% and 3.10% in average accuracy on 1-shot and 5-shot settings, respectively.

关键词： Training Metalearning Visualization Semantic segmentation Semantics Prototypes Training data

来源：评论

学校读者我要写书评

暂无评论

Optimized Design of a Haptic Unit for Vibrotactile Amplitude Modulation

Optimized Design of a Haptic Unit for Vibrotactile Amplitude...

引用

2024 IEEE International Conference on Robotics and Biomimetics, ROBIO 2024

作者： Huang, Jingchen Fang, Yun Guo, Weichao Qiao, Zhijian Sheng, Xinjun School of Mechanical Engineering Meta Robotics Institute Shanghai Jiao Tong University State Key Laboratory of Mechanical System and Vibration Shanghai200240 China Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong

ISBN: (纸本)9781665481090

Communicating information to users is a crucial aspect of human-machine interaction. Vibrotactile feedback encodes information into spatiotemporal vibrations, enabling users to perceive tactile sensations. It offers advantages such as lightweight, wearability, and high stability, with broad applications in sensory substitution, virtual reality, education, and healthcare. However, existing haptic unit designs lack amplitude modulation capabilities, which limits their applications. This paper proposed an optimized design of the haptic unit from the perspective of vibration amplitude modulation. A modified elastic model was developed to describe the propagation and attenuation mechanisms of vibration in the skin. Based on the model, two types of hierarchical architectural design were proposed. The design incorporated various materials arranged in multiple layers to amplify or attenuate the vibration amplitude as it traveled through the structure. An experimental platform was built to evaluate the performance of the optimized design. © 2024 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

The Power of Bamboo: On the Post-Compromise Security for Searchable Symmetric Encryption

arXiv

引用

arXiv 2024年

作者： Chen, Tianyang Xu, Peng Picek, Stjepan Luo, Bo Susilo, Willy Jin, Hai Liang, Kaitai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China Cluster and Grid Computing Lab School of Computer Science and Technology China Huazhong University of Science and Technology Wuhan430074 China Digital Security Group Radboud University Nijmegen Netherlands Department of EECS Institute of Information Sciences The University of Kansas LawrenceKS United States Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 CD Netherlands

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user’s secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client’s secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance. © 2024, CC BY.

关键词： Bamboo

来源：评论

学校读者我要写书评

暂无评论

CMRM: Collaborative Multi-agent Reinforcement Learning for Multi-objective Traffic Signal Control

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Nie, Lei Qi, Dandan Liu, Bingyi Li, Peng Bao, Haizhou He, Heng Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430065 China Wuhan University of Technology School of Computer Science and Artificial Intelligence Wuhan430070 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China

Efficient traffic signal control is a cost-effective way to ease urban traffic congestion. Multi-agent reinforcement learning (MARL) has become a widely adopted method for optimizing traffic signal control (TSC). However, existing MARL-based methods often focus on a single optimization objective, lacking a comprehensive consideration of traffic efficiency, environmental pollution, and traffic safety. Simultaneously, these methods often fail to effectively capture the dynamic and complex interactions among agents in multi-intersection scenarios, which negatively impacts traffic efficiency. In this article, we propose a collaborative MARL-based method for multi-objective TSC, called CMRM. First, we introduce a multi-objective reward mechanism that integrates traffic efficiency, environmental impact, and safety to guide agents toward more comprehensive optimization. Second, we design a cooperation enhancement module (CEM) based on the graph attention mechanism to dynamically capture neighboring agents’ state information. This mitigates the partial observability problem in independent proximal policy optimization (IPPO) and enhances the model’s ability to capture dynamic and complex interactions among agents. Finally, we assess the performance of the proposed CMRM method using SUMO on two real traffic networks. Experimental results demonstrate that our method significantly improves traffic efficiency while reducing environmental pollution and enhancing traffic safety, compared to the best performing baseline, our method reduces CO2 emission by approximately 17.53% and 9.57%, and lowers vehicle collision risks by 44.39% and 42.85% in two different traffic networks. © 1975-2011 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

A new class of generalized quasi-variational inequalities with applications to Oseen problems under nonsmooth boundary conditions

引用

science China Mathematics 2024年第2期67卷 315-338页

作者： Shengda Zeng Akhtar A.Khan Stanislaw Migórski Guangxi Colleges and Universities Key Laboratory of Complex System Optimization and Big Data Processing Yulin Normal UniversityYulin 537000China Faculty of Mathematics and Computer Science Jagiellonian University in Krak´owKrak´ow 30348Poland Center for Applied and Computational Mathematics School of Mathematical SciencesRochester Institute of TechnologyRochesterNY 14623USA College of Sciences Beibu Gulf UniversityQinzhou 535000China

In this paper, we study a generalized quasi-variational inequality (GQVI for short) with twomultivalued operators and two bifunctions in a Banach space setting. A coupling of the Tychonov fixedpoint principle and the Katutani-Ky Fan theorem for multivalued maps is employed to prove a new existencetheorem for the GQVI. We also study a nonlinear optimal control problem driven by the GQVI and givesufficient conditions ensuring the existence of an optimal control. Finally, we illustrate the applicability of thetheoretical results in the study of a complicated Oseen problem for non-Newtonian fluids with a nonmonotone andmultivalued slip boundary condition (i.e., a generalized friction constitutive law), a generalized leak boundarycondition, a unilateral contact condition of Signorini’s type and an implicit obstacle effect, in which themultivalued slip boundary condition is described by the generalized Clarke subgradient, and the leak boundarycondition is formulated by the convex subdifferential operator for a convex superpotential.

关键词： generalized quasi-variational inequality existence theorem optimal control Kakutani-Ky Fan theorem Oseen problem non-Newtonian fluid nonmonotone slip boundary condition

来源：评论

学校读者我要写书评

暂无评论

Edge Resource Prediction and Auction for Distributed Spatial Crowdsourcing With Differential Privacy

Edge Resource Prediction and Auction for Distributed Spatial...

引用

作者： Xu, Yin Xiao, Mingjun Liu, An Wu, Jie Suzhou Institute for Advanced Research The Cas Key Laboratory of Wireless-Optical Communications University of Science and Technology of China School of Computer Science and Technology Hefei230026 China Soochow University School of Computer Science and Technology Suzhou215006 China Temple University Center for Networked Computing PhiladelphiaPA19122 United States

Traditional spatial crowdsourcing (SC) systems employ a centralized server platform to provide services for requesters. Such a centralized design requires powerful resource capacity and often cannot accomplish the urgent demands due to the unpredictable network latency. In order to ensure the scalability of systems and the quality of services, we study the distributed SC (DSC), where a diversity of location-relative services provided by various service providers (SPs) can deploy on edge clouds (ECs) with low time latency. Since the edge resources are limited, SPs need to compete for edge resources so as to deploy their desired SC services, and the requested resources must be allocated together to meet the demand of the service. We first design a gated recurrent unit with particle filter (GRUPF) network for SPs to predict future resource demands so as to participate in the competitions judiciously. Then, we model the competitive edge resource allocation problem between SPs and ECs as a combinatorial auction process. Due to the NP-hardness of this problem, an approximation algorithm is proposed to tackle it. Moreover, the leakage of private information such as bids may incur severe economic damage, and most existing studies usually rely on a trusted third party to provide rigorous privacy protection. Therefore, we customize a novel differentially private resource auction (DRA) mechanism, and design a bid confusion strategy based on differential privacy. Through theoretical analysis, we prove that the DRA mechanism meets some desired properties, including ϵ-differential privacy, individual rationality, computational efficiency, and γ-truthfulness. Additionally, we corroborate the significant performances of DRA through extensive simulations on synthetic and real-world data sets. © 2014 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Identification Algorithm Framework and Structural model on Input Pattern of Metamorphic Relations 9

Identification Algorithm Framework and Structural model on I...

引用

9th International Conference on Dependable systems and Their Applications, DSA 2022

作者： Yan, Shiyu Yang, Xiaohua Lu, Zhongjian Li, Meng Gong, Helin Liu, Jie Computer School University of South China Hunan Hengyang China Intelligent Equipment Software Evaluation Engineering Technology Research Center of Hunan Hengyang China Cnnc Key Laboratory on High Trusted Computing Hunan Hengyang China Nuclear Power Institute of China Science and Technology on Reactor System Design Technology Laboratory Chengdu China

ISBN: (数字)9781665488778

ISBN: (纸本)9781665488778

Metamorphic Relation (MR) plays a crucial role in Metamorphic Testing (MT), which can be regarded as the implication relation from the input pattern to the output pattern. Based on MR's properties, the identification of Metamorphic Relations (MRs) can be from its input pattern and output pattern, respectively. However, the finding of the effective input pattern is very first and important. Especially for complicated mathematical function includes more than two input variables, we systematically analyze the structural model of input pattern in MR, propose the concept of the class of basic input pattern, as well as prove that any one input pattern can be expressed as a combination of basic input patterns in scientific computing programs. Moreover, the structural model of input pattern in MR is established based on previous proof. Finally, we put forward an identification algorithm framework and analysis its complexity. The core contribution of our method is to decompose the input pattern identification problem in multi-dimensional space into a single one-dimensional. For this reason, the examples show that the complexity of the algorithm is reduced significantly. © 2022 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：