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

17th International Conference on Information security and Cryptology, Inscrypt 2021

作者： Li, Wenyuan Wang, Wei Lin, Jingqiang Wang, Qiongxiao Wang, Wenjie State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100089 China School of Cyber Security University of Chinese Academy of Sciences Beijing100089 China Data Assurance and Communication Security Research Center CAS Beijing100089 China School of Cyber Security University of Science and Technology of China Anhui Hefei230027 China

ISBN: (纸本)9783030883225

OpenPGP public key distribution via Synchronizing KeyServers (SKS) is facing the challenges of user privacy leakage caused by keyword search behaviors and service unavailability of OpenPGP software caused by OpenPGP certificate spamming attack (CVE-2019-13050). Most existing solutions to the problem dispense with the necessary features and functions of SKS or Web of Trust (WoT) for attack mitigation. In this paper, we put forward a solution which is privacy-preserving and spamming-resistant, while maintaining the functionalities of SKS and WoT. Considering the characteristics of our scenario, we protect user privacy by introducing a third-party server, and propose a specific third party-based private set intersection protocol to improve usability of OpenPGP software. Our protocol helps users filter out the required key data by intersection computation between unbalanced sets of keywords. We also propose an enhanced scheme for multi-key query and further privacy protection. We evaluate the usability and privacy of our schemes. Experimental results show that our scheme can largely reduce unnecessary data download with appropriate filter parameters. The proposed solution relies on the security of Elliptic Curve Diffie–Hellman, HMAC-based Key Derivation Function, Bloom filter and symmetric cryptographic encryption to defend against semi-honest adversaries. © 2021, Springer Nature Switzerland AG.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

引用

Proceedings of the Fortieth Conference on Uncertainty in Artificial Intelligence

作者： Zhiqiang Zhang Yongqiang Jiang Qian Gao Zhipeng Wang Key Laboratory of Computing Power Network and information Security Ministry of Eaucation Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China and 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 and Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China China Telecom Digital Intelligence Techonology Co Jinan China

Existing multimodal recommendation research still faces some challenges, such as not being able to fully mine the implicit relevance information of neighbor nodes, and the unreasonable weight allocation to imbalanced nodes. To address the aforementioned challenges, this paper introduces a new multimodal recommendation model called NS-MAR+. Specifically, the model firstly constructs a neighbor similarity graph convolutional network to capture the implicit relevance information and reasonably assigns the attention weights through the graph attention mechanism. Secondly, the model introduces a modal alignment and fusion mechanism by using a multilayer perceptron (MLP) to map image and text features into a shared space for comparison and fusion. In addition, the model constructs a user co-interaction graph and an item semantic graph based on the original information and performs graph convolution operations to enhance the preference information of users and items, and to better capture the interactions and internal features between users and items. Finally, MLP is employed to aggregate user and item representations and predict personalized recommendation rankings. To validate the experiment's efficacy, this paper compares with several leading multimodal recommendation models on public datasets with a performance improvement of 1% to 3%. The experimental outcomes indicate that the model in this paper has good superiority and accuracy in multimodal recommendation tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Flexible WMMSE Beamforming for MU-MIMO Movable Antenna Communications

arXiv

引用

arXiv 2025年

作者： Yang, Songjie Wan, Zihang Xiu, Yue Ning, Boyu Li, Yong Liu, Yuenwei Yuen, Chau National Key Laboratory of Wireless Communications University of Electronic Science and Technology of China Chengdu611731 China Key Laboratory of Wireless Optical Communication Chinese Academy of Sciences School of Information Science and Technology University of Science and Technology of China Hefei230026 China Henan Agricultural Environment Monitoring and Big Data Analysis Engineering Research Center Henan Agricultural University Zhengzhou450046 China Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong School of Electrical and Electronics Engineering Nanyang Technological University Singapore

Movable antennas offer new potential for wireless communication by introducing degrees of freedom in antenna positioning, which has recently been explored for improving sum rates. In this paper, we aim to fully leverage the capabilities of movable antennas (MAs) by assuming that both the transmitter and receiver can optimize their antenna positions in multi-user multiple-input multiple-output (MU-MIMO) communications. Recognizing that WMMSE beamforming is a highly effective method for maximizing the MU-MIMO sum rate, we modify it to integrate antenna position optimization for MA systems, which we refer to as flexible WMMSE (F-WMMSE) beamforming. Importantly, we reformulate the subproblems within WMMSE to develop regularized sparse optimization frameworks to achieve joint beamforming (antenna coefficient optimization) and element movement (antenna position optimization). We then propose a regularized least squares-based simultaneous orthogonal matching pursuit (RLS-SOMP) algorithm to address the resulting sparse optimization problem. To enhance practical applications, the low-complexity implementation of the proposed framework is developed based on the pre-calculations and matrix inverse lemma. The overall F-WMMSE algorithm converges similarly to WMMSE, and our findings indicate that F-WMMSE achieves a significant sum rate improvement compared to traditional WMMSE, exceeding 20% under appropriate simulation conditions. Copyright © 2025, The Authors. All rights reserved.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm 29

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zeng, Yan Huang, Chengchuang Ni, Yijie Zhou, Chunbao Zhang, Jilin Wang, Jue Zhou, Mingyao Xue, Meiting Zhang, Yunquan Hangzhou Dianzi University School of Computer Science and Technology Hangzhou310018 China Ministry of Education Key Laboratory for Modeling and Simulation of Complex Systems Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Hangzhou Dianzi University School of ITMO Joint Institute Hangzhou310018 China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing100086 China HuaWei China Institute of Computing Technology of the Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100086 China

ISBN: (纸本)9798350330717

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network's dataflow graph and device cluster's topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method. © 2023 IEEE.

关键词： Auto-Parallel Distributed machine learning Genetic algorithm Integer linear programming Model parallelism

来源：评论

学校读者我要写书评

暂无评论

Controlling update distance and enhancing fair trainable prototypes in federated learning under data and model heterogeneity

引用

Defence technology 2025年第5期 15-31页

作者： Kangning Yin Zhen Ding Xinhui Ji Zhiguo Wang School of Information and Software Engineering University of Electronic Science and Technology of China Institute of Public Security Kash Institute of Electronics and Information Industry Shanghai New Energy Vehicle Public Data Collection and Monitoring Research Center

Heterogeneous federated learning(Ht FL) has gained significant attention due to its ability to accommodate diverse models and data from distributed combat units. The prototype-based Ht FL methods were proposed to reduce the high communication cost of transmitting model parameters. These methods allow for the sharing of only class representatives between heterogeneous clients while maintaining privacy. However, existing prototype learning approaches fail to take the data distribution of clients into consideration, which results in suboptimal global prototype learning and insufficient client model personalization capabilities. To address these issues, we propose a fair trainable prototype federated learning(Fed FTP) algorithm, which employs a fair sampling training prototype(FSTP) mechanism and a hyperbolic space constraints(HSC) mechanism to enhance the fairness and effectiveness of prototype learning on the server in heterogeneous environments. Furthermore, a local prototype stable update(LPSU) mechanism is proposed as a means of maintaining personalization while promoting global consistency, based on contrastive learning. Comprehensive experimental results demonstrate that Fed FTP achieves state-of-the-art performance in Ht FL scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Chest CT-Scan Anomaly Detection Models Using Principal Component Analysis

Evaluation of Chest CT-Scan Anomaly Detection Models Using P...

引用

Information technology (ACIT)

作者： Ala’ Alyabrodi Shrouq Al-Daja MohammadNoor Injadat Abdallah Moubayed Ali Elrashidi Cyber Security Department Zarqa University Zarqa Jordan Data Science & AI Department Zarqa University Zarqa Jordan Computer Engineering Department and Interdisciplinary Research Center for Intelligent Secure Systems King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Department of Electrical Engineering University of Business and Technology Jeddah Saudi Arabia

ISBN: (数字)9798331540012

ISBN: (纸本)9798331540029

Machine learning-based improvements in anomaly detection, visualization, and segmentation are made possible by the growing digitization of medical imaging, which reduces the workload for medical specialists. Nevertheless, trustworthy labeled data is necessary for supervised machine learning and is sometimes expensive, time-consuming, or impossible to get. Consequently, techniques that need either little labeling (unsupervised methods) or partial labeling (semi-supervised methods) have been used increasingly been used. One approach that can be used to tackle medical imaging tasks like segmentation and classification is anomaly detection, which makes use of both unsupervised and semi-supervised methods. This study investigates the anomaly detection capabilities of deep learning and machine learning models trained on chest CT scans. To adopt this approach, firstly, by evaluating several feature extraction techniques (Principal Component Analysis (PCA), Autoencoder, and variance threshold), PCA achieves the best results on the selected dataset. After that, different machine learning and deep learning models (Isolation Forest, K-means, feed-forward neural networks, and convolutional neural networks) are assessed to detect anomalies using PCA for dimensionality reduction. The experiments show that the NN-Feedforward model with PCA outperformed the other models, also attains remarkably low false alarm rate, demonstrating its effectiveness in reducing false positives and precisely detecting anomalies.

关键词： Deep learning Image segmentation Forestry Feature extraction Feedforward neural networks Labeling Information technology Anomaly detection Principal component analysis Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Criteria-based Unsupervised Feature Selection Techniques: A Comparative Study Over Chest CT Scan

Criteria-based Unsupervised Feature Selection Techniques: A ...

引用

Information technology (ACIT)

作者： Shrouq Al-Daja Ala’ Alyabrodi Abdallah Moubayed MohammadNoor Injadat Ali Elrashidi Data Science & AI Department Zarqa University Zarqa Jordan Cyber Security Department Zarqa University Zarqa Jordan Computer Engineering Department Interdisciplinary Research Center for Intelligent Secure Systems King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Department of Electrical Engineering University of Business and Technology Jeddah Saudi Arabia

ISBN: (数字)9798331540012

ISBN: (纸本)9798331540029

research on classifying chest CT scans as normal or abnormal using machine learning and deep learning has garnered significant attention. To address this, various feature selection (FS) methods are employed to reduce dimensionality and identify key features. This paper evaluates criteria tailored to unsupervised binary datasets, such as feature subsets, redundancy, and diversity, by comparing Mutual Information-Based Methods (MI) with Clustering-Based Feature Selection (Agglomerative Clustering) ones. Additionally, it examines Graph Structure, Spectral Properties, and Quality criteria by comparing Graph-Based Methods with Spectral Feature Selection-be (SPEC). For feature reduction, Agglomerative Clustering may offer a slight advantage due to better handling of diversity and redundancy, though the difference is minimal. If these aspects are crucial, Agglomerative Clustering might be preferred. Conversely, for Graph-Based vs. SPEC, SPEC Method is more suitable for feature reduction due to its coherent feature selection and focus on capturing significant patterns related to medical interventions.

关键词： Deep learning Computed tomography Termination of employment Feature extraction Information technology

来源：评论

学校读者我要写书评

暂无评论

Genetic Auto-prompt Learning for Pre-trained Code Intelligence Language Models

arXiv

引用

arXiv 2024年

作者： Feng, Chengzhe Sun, Yanan Li, Ke Zhou, Pan Lv, Jiancheng Lu, Aojun The College of Computer Science Sichuan University Chengdu610065 China The Department of Computer Science University of Exeter ExeterEX4 4QF United Kingdom The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

As Pre-trained Language Models (PLMs), a popular approach for code intelligence, continue to grow in size, the computational cost of their usage has become prohibitively expensive. Prompt learning, a recent development in the field of natural language processing, emerges as a potential solution to address this challenge. In this paper, we investigate the effectiveness of prompt learning in code intelligence tasks. We unveil its reliance on manually designed prompts, which often require significant human effort and expertise. Moreover, we discover existing automatic prompt design methods are very limited to code intelligence tasks due to factors including gradient dependence, high computational demands, and limited applicability. To effectively address both issues, we propose Genetic Auto Prompt (GenAP), which utilizes an elaborate genetic algorithm to automatically design prompts. With GenAP, non-experts can effortlessly generate superior prompts compared to meticulously manual-designed ones. GenAP operates without the need for gradients or additional computational costs, rendering it gradient-free and cost-effective. Moreover, GenAP supports both understanding and generation types of code intelligence tasks, exhibiting great applicability. We conduct GenAP on three popular code intelligence PLMs with three canonical code intelligence tasks including defect prediction, code summarization, and code translation. The results suggest that GenAP can effectively automate the process of designing prompts. Specifically, GenAP outperforms all other methods across all three tasks (e.g. improving accuracy by an average of 2.13% for defect prediction). To the best of our knowledge, GenAP is the first work to automatically design prompts for code intelligence PLMs. Copyright © 2024, The Authors. All rights reserved.

关键词： Design

来源：评论

学校读者我要写书评

暂无评论

Distantly-Supervised Named Entity Recognition with Adaptive Teacher Learning and Fine-grained Student Ensemble

arXiv

引用

arXiv 2022年

作者： Qu, Xiaoye Zeng, Jun Liu, Daizong Wang, Zhefeng Huai, Baoxing Zhou, Pan Huawei Cloud China School of Software Engineering Huazhong University of Science and Technology China Peking University China 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 China

Distantly-Supervised Named Entity Recognition (DS-NER) effectively alleviates the data scarcity problem in NER by automatically generating training samples. Unfortunately, the distant supervision may induce noisy labels, thus undermining the robustness of the learned models and restricting the practical application. To relieve this problem, recent works adopt self-training teacher-student frameworks to gradually refine the training labels and improve the generalization ability of NER models. However, we argue that the performance of the current self-training frameworks for DS-NER is severely underestimated by their plain designs, including both inadequate student learning and coarse-grained teacher updating. Therefore, in this paper, we make the first attempt to alleviate these issues by proposing: (1) adaptive teacher learning comprised of joint training of two teacher-student networks and considering both consistent and inconsistent predictions between two teachers, thus promoting comprehensive student learning. (2) fine-grained student ensemble that updates each fragment of the teacher model with a temporal moving average of the corresponding fragment of the student, which enhances consistent predictions on each model fragment against noise. To verify the effectiveness of our proposed method, we conduct experiments on four DS-NER datasets. The experimental results demonstrate that our method significantly surpasses previous SOTA methods. The code is available at https://***/zenhjunpro/ATSEN. © 2022, CC BY.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Ranking on Heterogeneous Manifold for Multimodal Information Retrieval

Ranking on Heterogeneous Manifold for Multimodal Information...

引用

IEEE International Conference on Big data and Cloud Computing (BdCloud)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：