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

Preserving Location Privacy of IoT Devices in Heterogeneous Edge Computing Architecture Through Deniability-Based Authentication

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Ali, Ikram Li, Jianqiang Chen, Jie Chen, Yong Ullah, Shamsher Wakeel, Abdul Shenzhen University National Engineering Laboratory of Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China National University of Sciences and Technology Military College of Signals Department of Electrical Engineering Islamabad Pakistan

Edge computing moves cloud services closer to consumer Internet of Things (IoT) devices, reducing latency and bandwidth usage. This setup enables faster responses but also introduces new security challenges, particularly concerning location privacy when sender and receiver use different security techniques. The authentication process in such architectures can expose the location of IoT devices. To address this issue, researchers have proposed various privacy-preserving schemes. However, these are computationally heavy for IoT devices. To tackle this issue, we propose two novel heterogeneous deniable authentication schemes: HDA-IoT-I and HDA-IoT-II. These schemes use public-key infrastructure and identity-based cryptography to protect the location privacy of IoT devices in heterogeneous edge computing environments. Our schemes enable the designated edge device to verify the source of a message without being able to prove its origin to a third party, thus preserving privacy. Additionally, they incorporate a batch verification method, which speeds up the verification of multiple deniable authenticators. The proposed schemes are formally proven secure in the random oracle model based on the hardness assumption of elliptic curve inverse computational Diffie-Hellman problem. The performance evaluation demonstrate that our schemes significantly enhance computational and communication efficiency, making them suitable for IoT devices. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Can Large Language Models Understand Intermediate Representations?

arXiv

引用

arXiv 2025年

作者： Jiang, Hailong Zhu, Jianfeng Wan, Yao Fang, Bo Zhang, Hongyu Jin, Ruoming Guan, Qiang Department of Computer Science Kent State University Kent United States School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Pacific Northwest National Laboratory Richland United States School of Big Data and Software Engineering Chongqing University Chongqing China

Intermediate Representations (IRs) are essential in compiler design and program analysis, yet their comprehension by Large Language Models (LLMs) remains underexplored. This paper presents a pioneering empirical study to investigate the capabilities of LLMs, including GPT-4, GPT-3, Gemma 2, LLaMA 3.1, and Code Llama, in understanding IRs. We analyze their performance across four tasks: Control Flow Graph (CFG) reconstruction, decompilation, code summarization, and execution reasoning. Our results indicate that while LLMs demonstrate competence in parsing IR syntax and recognizing high-level structures, they struggle with control flow reasoning, execution semantics, and loop handling. Specifically, they often misinterpret branching instructions, omit critical IR operations, and rely on heuristic-based reasoning, leading to errors in CFG reconstruction, IR decompilation, and execution reasoning. The study underscores the necessity for IR-specific enhancements in LLMs, recommending fine-tuning on structured IR datasets and integration of explicit control flow models to augment their comprehension and handling of IR-related tasks.1 © 2025, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Adaptive and non-adaptive fusion algorithms analysis for digital surface model generated using census and convolutional neural networks 24

Adaptive and non-adaptive fusion algorithms analysis for dig...

引用

2021 24th ISPRS Congress Commission II: Imaging Today, Foreseeing Tomorrow

作者： Albanwan, Hessah Qin, Rongjun Geospatial Data Analytics Laboratory Department of Civil Environmental and Geodetic Engineering The Ohio State University ColumbusOH United States Department of Electrical and Computer Engineering The Ohio State University United States Translational Data Analytics Institute The Ohio State University United States

The digital surface models (DSM) fusion algorithms are one of the ongoing challenging problems to enhance the quality of 3D models, especially for complex regions with variable radiometric and geometric distortions like satellite datasets. DSM generation using Multiview stereo analysis (MVS) is the most common cost-efficient approach to recover elevations. Algorithms like Census-semi global matching (SGM) and Convolutional Neural Networks (MC-CNN) have been successfully implemented to generate the disparity and recover DSMs;however, their performances are limited when matching stereo pair images with ill-posed regions, low texture, dense texture, occluded, or noisy, which can yield missing or incorrect elevation values, in additions to fuzzy boundaries. DSM fusion algorithms have proven to tackle such problems, but their performance may vary based on the quality of the input and the type of fusion which can be classified into adaptive and non-adaptive. In this paper, we evaluate the performance of the adaptive and nonadaptive fusion methods using median filter, adaptive median filter, K-median clustering fusion, weighted average fusion, and adaptive spatiotemporal fusion for DSM generated using Census and MC-CNN. We perform our evaluation on 9 testing regions using stereo pair images from Worldview-3 satellite to generate DSMs using Census and MC-CNN. Our results show that adaptive fusion algorithms are more accurate than non-adaptive algorithms in predicting elevations due to their ability to learn from temporal and contextual information. Our results also show that MC-CNN produces better fusion results with a lower overall average RMSE than Census. © 2021 International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

A Single-Cell Clustering Algorithm Based on Structure Pertur...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Jiang, Hanjing Wang, Meineng Zhang, Luping Huang, Yu-An Li, Yangyuan Huang, Yabing Huazhong University of Science and Technology Key Laboratory of Image Information Processing and Intelligent Control Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Hubei Wuhan430074 China China University of Mining and Technology School of Computer Science and Technology Xuzhou221116 China Yichun University School of Mathematics and Computer Science Yichun336000 China East China University of Technology School of Information Engineering Nanchang330013 China Northwestern Polytechnical University School of Computer Science Xi'an710129 China Renmin Hospital Wuhan University Department of Pathology Wuhan430060 China

ISBN: (纸本)9798350386226

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets. © 2024 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Exploring the Impact of Personality Traits on LLM Bias and Toxicity

arXiv

引用

arXiv 2025年

作者： Wang, Shuo Li, Renhao Chen, Xi Wong, Derek F. Yuan, Yulin Yang, Min NLP2CT Lab Department of Computer and Information Science University of Macau China Shenzhen Key Laboratory for High Performance Data Mining Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Linguistics and Multilingual Studies Nanyang Technological University Singapore Department of Chinese Language and Literature University of Macau China

With the different roles that AI is expected to play in human life, imbuing large language models (LLMs) with different personalities has attracted increasing research interests. While the "personification" enhances human experiences of interactivity and adaptability of LLMs, it gives rise to critical concerns about content safety, particularly regarding bias, sentiment and toxicity of LLM generation. This study explores how assigning different personality traits to LLMs affects the toxicity and biases of their outputs. Leveraging the widely accepted HEXACO personality framework developed in social psychology, we design experimentally sound prompts to test three LLMs’ performance on three toxic and bias benchmarks. The findings demonstrate the sensitivity of all three models to HEXACO personality traits and, more importantly, a consistent variation in the biases, negative sentiment and toxicity of their output. In particular, adjusting the levels of several personality traits can effectively reduce bias and toxicity in model performance, similar to humans’ correlations between personality traits and toxic behaviors. The findings highlight the additional need to examine content safety besides the efficiency of training or fine-tuning methods for LLM personification. They also suggest a potential for the adjustment of personalities to be a simple and low-cost method to conduct controlled text generation. © 2025, CC BY.

关键词： Social psychology

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

Congress on Evolutionary Computation

作者： Yongfeng Li Yuze Zhang Lijia Ma Junkai Ji Dugang Liu Victor C. M. Leung Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen China Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms.

关键词： Measurement Correlation Sociology Evolutionary computation Reinforcement learning Germanium Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A Dynamics Theory of Implicit Regularization in Deep Low-Rank Matrix Factorization

SSRN

引用

SSRN 2023年

作者： Cao, Jian Qian, Chen Huang, Yihui Chen, Dicheng Gao, Yuncheng Dong, Jiyang Guo, Di Qu, Xiaobo Department of Electronic Science Biomedical Intelligent Cloud R&D Center Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance Xiamen University Xiamen361005 China School of Computer and Information Engineering Fujian Engineering Research Center for Medical Data Mining and Application Xiamen University of Technology Xiamen361024 China

Implicit regularization induced by gradient optimization is an important way to understand the generalization in neural networks. Recent theory explains implicit regularization over the model of deep matrix factorization (DMF) and analyzes the trajectory of discrete gradient dynamics in the optimization process. These discrete gradient dynamics can mathematically characterize the practical learning rate of adaptive gradient optimization such as RMSProp. Discrete gradient dynamics analysis has been successfully applied to shallow networks but encounters the difficulty of complex computation for deep networks. In this work, we introduce another discrete gradient dynamics approach to explain implicit regularization of RMSProp, i.e. landscape analysis. It mainly focuses on gradient regions like saddle points and local minima. We investigate that increasing learning rates benefit saddle point escaping (SPE) stages. In elucidating implicit regularization through the convergence of RMSProp, we prove that for a rank-R matrix reconstruction, DMF will converge to a second-order critical point after R stages of SPE. This conclusion is further experimentally verified on a low-rank matrix reconstruction problem. © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

An Unsupervised Fake News Detection Framework Based on Structural Contrastive Learning

引用

Cybersecurity 2025年第1期8卷 1-13页

作者： Guo, Yajie Ji, Shujuan Fang, Xianwen Chiu, Dickson K. W. Cao, Ning Leung, Hofung Key Laboratory for Wisdom Mine Information Technology of Shandong Province Shandong University of Science and Technology Qingdao China Department of Computer Systems and Computation Universitat Politècnica de València València Spain Anhui Province Engineering Laboratory for Big Data Analysis and Early Warning Technology of Coal Mine Safety Anhui University of Science and Technology Huainan China Faculty of Education The University of Hong Kong Hong Kong China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China

Recently, fake news detection on social media (SM) has attracted a lot of attention. With the emergence of fake news at a breakneck pace, the massive spread of fake news has had a serious impact in our society. The authenticity of the news is questionable and there exists a necessity for an automated tool for the detection. However, most fake news detection methods are mainly supervised, requiring huge amounts of annotated data, which is time-consuming, expensive, and almost impossible with vast new SM volume. To deal with this problem, in this paper, we propose a novel unsupervised fake news detection framework based on structural contrastive learning by combining the propagation structure of news and contrastive learning to achieve unsupervised training. To validate the influence of parameters and our method’s performance, we design experiment sets on public Twitter and Weibo datasets, which validate our approach outperforms current baseline ones and has proper robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GKT: A Novel Guidance-Based Knowledge Transfer Framework For Efficient Cloud-edge Collaboration LLM Deployment

arXiv

引用

arXiv 2024年

作者： Yao, Yao Li, Zuchao Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China

The burgeoning size of Large Language Models (LLMs) has led to enhanced capabilities in generating responses, albeit at the expense of increased inference times and elevated resource demands. Existing methods of acceleration, predominantly hinged on knowledge distillation, generally necessitate fine-tuning of considerably large models, posing a challenge for average users. Furthermore, present techniques for expediting inference and reducing costs operate independently. To address these issues, we introduce a novel and intuitive Guidance-based Knowledge Transfer (GKT) framework. This approach leverages a larger LLM as a "teacher" to create guidance prompts, paired with a smaller "student" model to finalize responses. Remarkably, GKT requires no fine-tuning and doesn’t necessitate the teacher and student models to have the same vocabulary, allowing for extensive batch generation to accelerate the process while ensuring user customization. GKT can be seamlessly integrated into cloud-edge collaboration architectures, and is versatile enough for plug-and-play application across various models. When utilizing ChatGPT as teacher model and Llama2-70B as the student model, we can achieve 95.00% of ChatGPT’s performance at 52% of the cost. The results highlight substantial enhancements in accuracy and processing speed on the GSM8K and CSQA datasets, surpassing the performance of using either the student or teacher models in isolation. Our code is publicly available at https://***/Zoeyyao27/GKT © 2024, CC BY.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Bi-layered coded metasurface for multi-functional hologram with broadband transmission and efficient reflection

引用

Chinese Optics Letters 2024年第5期22卷 8-16页

作者：朱磊李绪胜董亮谢文静尚关玉 Shah Nawaz Burokur 丁旭旻 School of Computer and Control Engineering Qiqihar UniversityQiqihar 161006China Communication and Electronics Engineering Institute Qiqihar UniversityQiqihar 161006China Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis Qiqihar UniversityQiqihar 161000China Department of Microwave Engineering Harbin Institute of TechnologyHarbin 150001China LEME UPLUniversitéParis NanterreF92410 Ville d’AvrayFrance Advanced Microscopy and Instrumentation Research Center Harbin Institute of TechnologyHarbin 150080China Key Laboratory of Millimeter Waves Southeast UniversityNanjing 210096China

A multi-functional full-space metasurface based on frequency and polarization multiplexing is *** metasurface unit consists of metallic patterns printed on the two faces of a single-layered dielectric *** unit cell can control electromagnetic wavefronts to achieve a broadband transmission with amplitudes greater than 0.4 from 4.4 to 10.4 ***,at 11.7 GHz and 15.4 GHz,four high-efficiency reflection channels with a reflection amplitude greater than 0.8 are also *** illuminated by linearly polarized waves,five different functions can be realized at five different frequencies,which are demonstrated by theoretical calculations,full-wave simulations,and experimental measurements.

关键词： multi-functional metasurface broadband transmission efficient reflection full space

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：