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

A Phase Estimation Algorithm for Quantum Speed-Up Multi-Party Computing

computers, Materials & Continua 2021年第4期67卷 241-252页

作者： Wenbin Yu Hao Feng Yinsong Xu Na Yin Yadang Chen Zhi-Xin Yang Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology(CICAEET) Jiangsu Engineering Center of Network MonitoringSchool of Computer and SoftwareNanjing University of Information Science&TechnologyNanjing210044China Department of Computer Science and Engineering Michigan State UniversityEast Lansing48824MIUSA State Key Laboratory of Internet of Things for Smart City and Department of Electromechanical Engineering University of Macao999078Macao

Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor *** computing,theoretically known as an absolutely secure way to store and transmit information as well as a speed-up way to accelerate local or distributed classical algorithms that are hard to solve with polynomial complexity in computation or *** this paper,we focus on the phase estimation method that is crucial to the realization of a general multi-party computing model,which is able to be accelerated by quantum algorithms.A novel multi-party phase estimation algorithm and the related quantum circuit are proposed by using a distributed Oracle operator with *** proved theoretical communication complexity of this algorithm shows it can give the phase estimation before applying multi-party computing efficiently without increasing any additional ***,a practical problem of multi-party dating investigated shows it can make a successful estimation of the number of solution in advance with zero communication complexity by utilizing its special statistic *** simulations present the correctness,validity and efficiency of the proposed estimation method.

关键词： Edge computing security multi-party computing quantum algorithm phase estimation communication complexity

来源：评论

学校读者我要写书评

暂无评论

FERI: Feature Enhancement and Relational Interaction for Image-text Matching

FERI: Feature Enhancement and Relational Interaction for Ima...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yu Zhang Jianqiang Zhang Gongpeng Song Qin Lu Shuo Zhao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co. Jinan China

ISBN: (数字)9798331515966

ISBN: (纸本)9798331515973

Image-text matching is an important problem at the intersection of computer vision and natural language processing. It aims to establish the semantic link between image and text to achieve high-quality semantic alignment between the two modalities. However, the existing methods have the problem that the meaning expressed in the image or the complex narrative in the text cannot be fully understood due to insufficient feature extraction. Moreover, due to the essential modal differences between images and texts, how to effectively and accurately align the semantic contents in images and texts has become the key of research. In order to solve the above problems, this paper proposes a method based on feature enhancement and relationship interaction. When processing images, the proposed method fuses labeled features, region features and location features to represent images. When processing text, a combination of Bi-GRU and self-attention mechanism is used to represent the text. In order to further align the semantic content in images and texts accurately, this paper improves two relational interaction mechanisms by identifying connection relationships and learning association relationships. Thus, the relation enhanced embedding is obtained. Finally, it calculated the similarity of the enhanced embedding to judge the matching degree of the image and text. Extensive experiments on the public datasets Flickr30K and MSCOCO demonstrate the effectiveness of our method.

关键词： computer vision Fuses Image matching Semantics Feature extraction Natural language processing

来源：评论

学校读者我要写书评

暂无评论

Towards Cost-Optimal Policies for DAGs to Utilize IaaS Clouds with Online Learning

引用

IEEE Transactions on Services Computing 2025年

作者： Wu, Xiaohu Yu, Han Casale, Giuliano Gao, Guanyu Beijing University of Posts and Telecommunications National Engineering Research Center of Mobile Network Technologies Beijing China Nanyang Technological University WeBank-NTU Joint Research Centre on Fintech Singapore Singapore Nanyang Technological University School of Computer Science and Engineering Singapore Singapore Imperial College London Department of Computing London United Kingdom Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing China

Premier cloud service providers (CSPs) offer on-demand and spot instances (i.e., virtual machines) with time-varying features in availability and price. While interacting with a CSP, what concerns users is the process of cost-effectively utilizing these instances, possibly in addition to self-owned instances. A job in data-intensive applications is represented by a directed acyclic graph (DAG) whose nodes represent tasks and the DAG can further be transformed into a chain of tasks. The key to achieving cost efficiency is determining the allocation of a specific deadline to each task, as well as the allocation of different types of instances to the task. In this paper, we make some mild assumptions on the usage of various instances and give an analytical understanding of the expected behaviors while utilizing instances. Based on this, we propose informed heuristic policies to determine the allocation of deadlines and instances. The policies are parametric to support the usage of online learning to infer the optimal values against the dynamics of cloud markets. Finally, intuitive greedy policies are used as baselines to validate the effectiveness of the proposed analytical solutions. The cost improvement is up to 23.58% when spot and on-demand instances are considered and up to 50.08% when self-owned instances are also considered. © 2008-2012 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

IDFusion: An Infrared and Visible Image Fusion network for Illuminating Darkness

IDFusion: An Infrared and Visible Image Fusion Network for I...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Guohua Lv Xiyan Wang Zhonghe Wei Jinyong Cheng Guangxiao Ma Hanju Bao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Faculty of Comuter Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China Lianxin Intelligent Technology (Shandong) Co. Ltd Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The purpose of infrared and visible image fusion is to combine the background information of the visible images and the thermal target information of the infrared images. Current fusion methods often neglect the challenges of low-light conditions. In the night scene, the existing methods fail to capture texture information from the visible images that is hidden in the darkness, producing suboptimal fusion results that can hinder subsequent visual applications. Therefore, we propose a method for infrared and visible image fusion under night scenes, termed as IDFusion. Specifically, our method is divided into three parts, first, a dense auto-encoder is designed to obtain more useful features from the source images. Then we design a brightness enhancement network that removes visible degraded illumination maps to obtain brightness-enhanced features. Finally, a texture fusion network is designed so that the infrared features and enhanced visible features avoid texture loss during the fusion process. Experimental results show that our network can obtain better fusion results, outperforming state-of-the-art methods in terms of subjective visual effects and quantitative metrics.

关键词： Measurement Federated learning Brightness Lighting Visual effects Image fusion

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Prompt Learning for Multimodal Sarcasm Detection

Semantic-Aware Prompt Learning for Multimodal Sarcasm Detect...

引用

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

作者： Guangjin Wang Bao Wang Fuyong Xu Zhenfang Zhu Peipei Wang Ru Wang Peiyu Liu School of Information Science and Engineering Shandong Normal University Jinan China School of Information Science and Electrical Engineering Shandong Jiao Tong University Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal sarcasm detection aims to identify whether utterances express sarcastic intentions contrary to their literal meaning based on multimodal information. However, existing methods fail to explore the model’s "ability to understand" the semantics expressed by sentences in the image context from semantic diversity perspectives. In this paper, we propose a multi-view semantic awareness method, which concretizes semantics from multiple perspectives to improve the model’s ability to capture different semantic features. Specifically, two learnable prefixes are attached to the text representation respectively to construct semantic representations from both the literal meaning and sarcastic intention perspectives. Then, image-text information is further fused through cross-attention to guide the semantic representation of different perspectives in the image context. Finally, the semantics expressed by prefixes are strengthened through KL divergence, thereby encouraging the model to capture two distinctive semantic features. Experiments on benchmark datasets demonstrate the effectiveness of our method.

关键词： Semantics Benchmark testing Speech enhancement Signal processing Vectors Acoustics Context modeling

来源：评论

学校读者我要写书评

暂无评论

Long and Recent Preference Learning with Recent-k Items Distribution for Recommender System

引用

IEEE Transactions on Multimedia 2025年

作者： Gao, Yongbiao Niu, Sijie Lv, Guohua Ling, Miaogen Geng, Xin Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China Southeast University Ministry of Education Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Application China University of Jinan Shandong Provincial Key Laboratory of Ubiquitous Intelligent Computing School of Information Science and Engineering China Nanjing University of Information Science and Technology School of Computer Science China Southeast University School of Computer Science and Engineering China

Reinforcement learning (RL) aims to formulate the recommendation task as a Markov decision process (MDP) and trains an agent to automatically learn the optimal recommendation policy from interaction trajectories through trial-and-error and reward mechanisms. However, most existing RL-based approaches overlook the correlation between items and the dynamics of user interests implied in temporally close interactions. Therefore, in this paper, we propose a reinforcement learning method that incorporates a "recent-k items"distribution to capture users' local preferences. Specifically, we model the output layer as two distinct branches. The "recent-k items"branch, formulated with a Kullback-Leibler divergence loss, learns the recent interests of users, whereas the other branch utilizes a one-step temporal difference error to capture long-term preferences. The proposed structure is integrated into deep Q-learning and actor-critics, resulting in two enhanced methods named R k Q and R k AC, respectively. Furthermore, a novel soft inter-reward is carefully designed to enhance the proposed method, and we theoretically prove the convergence of the proposed algorithm. We perform extensive experiments on two large real-world datasets and conduct further analysis of the influences of different action sequences, time intervals, and enhancement capabilities for state-of-the-art models. The experimental results demonstrate the efficacy of our proposed methods. © 1999-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

TPE-H2MWD:an exact thumbnail preserving encryption scheme with hidden Markov model and weighted diffusion

引用

Frontiers of Information technology & Electronic engineering 2023年第8期24卷 1169-1180页

作者： Xiuli CHAI Xiuhui CHEN Yakun MA Fang ZUO Zhihua GAN Yushu ZHANG School of Artificial Intelligence Henan Engineering Research Center for Industrial Internet of ThingsHenan UniversityZhengzhou450046China Henan Key Laboratory of Cyberspace Situation Awareness Zhengzhou450001China School of Software Intelligent Data Processing Engineering Research Center of Henan ProvinceInstitute of Intelligent Network SystemHenan UniversityKaifeng475004China College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjing211106China

With the substantial increase in image transmission,the demand for image security is ***-like images can be obtained by conventional encryption schemes,and although the security of the images can be guaranteed,the noise-like images cannot be directly previewed and *** on the rank-then-encipher method,some researchers have designed a three-pixel exact thumbnail preserving encryption(TPE2)scheme,which can be applied to balance the security and availability of images,but this scheme has low encryption *** this paper,we introduce an efficient exact thumbnail preserving encryption ***,blocking and bit-plane decomposition operations are performed on the plaintext *** zigzag scrambling model is used to change the bit positions in the lower four bit ***,an operation is devised to permute the higher four bit planes,which is an extended application of the hidden Markov ***,according to the difference in bit weights in each bit plane,a bit-level weighted diffusion rule is established to generate an encrypted image and still maintain the same sum of pixels within the *** results show that the proposed scheme improves the encryption efficiency and can guarantee the availability of images while protecting their privacy.

关键词： Hidden Markov model Weighted diffusion Balance between usability and privacy Image encryption

来源：评论

学校读者我要写书评

暂无评论

Multilingual Knowledge Graph Completion via Multimodal Decouple and Relation-based Ensemble Inference

Multilingual Knowledge Graph Completion via Multimodal Decou...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xiaojing Liu Xuesong Jiang Fengge Yi Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

The objective of Multimodal Knowledge Graph Completion (MKGC) is to forecast absent entities within a knowledge graph by leveraging additional textual and visual modalities. Existing studies commonly utilize a singular relationship embedding to depict all modalities within an entity pair, thus connecting several relationships derived from diverse modalities. However, this coupling may introduce interference from conflicting information between modalities, as the relationships between modalities for a given entity pair can be contradictory. Moreover, existing Ensemble Inference methods fail to dynamically adjust modal weights based on their differences and importance, despite the varying contributions of different modalities. In this paper, we propose the Multimodal Decouple and Relation-based Ensemble inference (MDRE) model. For each modality, we construct corresponding relationship embeddings and build separate triple representations to avoid interferences among modalities. During the training phase, we employ confidence-constrained training with temperature scaling to alleviate conflicting information in textual and visual modalities. For inference, we utilize the Relation-based Ensemble Inference method to adjust modal weights at the relationship level, thus achieving improved prediction results. Experimental results on two datasets demonstrate that MDRE outperforms existing single-modal and multimodal knowledge graph completion methods in terms of performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Image super resolution via multi-regularization combining hybrid Tikhonov-TV prior and deep denoiser prior

Image super resolution via multi-regularization combining hy...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Jiahao Zhang Shengrong Zhao Hu Liang Changchun Wen Chen Liang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

In a real scenario, the image is often corrupted by complex degradation, and a lot of useful information is lost, which makes super-resolution (SR) reconstruction seriously ill-posed. To effectively solve such a problem, it is crucial to correctly exploit image prior knowledge. Although existing deep learning-based methods can obtain excellent results, they cannot deal with the complex degradation effectively, which would lead to the loss of texture details and the destruction of edge details. In this paper, an efficient multi-regularization method for SR is proposed, which can simultaneously exploit both internal and external image priors within a unified framework. The hybrid Tikhonov-TV prior and deep denoiser prior are introduced to constrain the reconstruction process. That is, the proposed model combines the superiority of the piecewise-smooth prior and deep prior. Moreover, an adaptive weight parameter is employed to make the hybrid component more detail-preserving. Experimental demonstrate that the proposed method achieves better performance in image detail protection than advanced methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GA-Net: Gated Attention Mechanism Based Global Refinement network for Image Inpainting

GA-Net: Gated Attention Mechanism Based Global Refinement Ne...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ran Qiu Shengrong Zhao Hu Liang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Underwater images are often affected by problems such as light attenuation, color distortion, noise and scattering, resulting in image defects. A novel image inpainting method is proposed to intelligently predict and fill damaged areas for complete and continuous visualization of the image. First, in order to effectively solve the problem of color distortion caused by light refraction in underwater environments, the improved gated attention mechanism is used. This mechanism improves the local details by learning and weighting the important features of the image. Second, gated convolution automatically determines the degree of restoration for each pixel based on local features of the original image. It eliminates distractions such as low contrast and scattering, retaining more original detailed information. By doing so, image inpainting techniques improve the quality and visualization of underwater images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：