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

IAENG International Journal of computer science 2025年第1期52卷 38-45页

作者： Li, Wanji Liu, Qiangbin Zhu, Yi School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China School of Computer Science and Communication Engineering the Dean of Department of Communication Engineering Jiangsu University Zhenjiang China

Named in-network computing service (NICS) is a potential computing paradigm emerged recently. Benefitted from the characteristics of named addressing and routing, NICS can be flexibly deployed on NDN router side and provide nearby computing service to Internet users. But the NICS feature of dynamic deployment also causes serious security risk of access control. How to independently check out the subscription relationship between requester and requested computing service on NICS side become a challenge. To solve this problem, we propose a novel certificateless signature-based access control scheme (CS-ACS) in this paper. In CS-ACS, the entire user public-private key pairs consist of two parts, user side and source server side. Where, the user public-private key pairs (server side) are generated according to the user ID, service subscription relationship and subscription expiration time. Based on this special design, when authorized user signs the interest packet of invoking specific service using its private key, the NICS can verify the signature then check out whether the requester is a valid subscriber and the subscription is expired or not. Simulation results show that, comparing with fundamental solutions, CS-ACS can avoid extra secret key storage cost on NICS side and markedly shorten authentication delay. © (2025), (International Association of Engineers). All rights reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

science China(Information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Robust subspace clustering via two-way manifold representation

引用

Multimedia Tools and Applications 2024年 1-18页

作者： Ezeora, Nnamdi Johnson Anichebe, Gregory Emeka Nzeh, Royransom Chiemela Uzo, Izuchukwu Uchenna Department of Computer Science University of Nigeria Nsukka Nigeria School of Computer Science and Communication Engineering JiangSu University JiangSu212013 China

Subspace clustering has shown great potential in discovering the hidden low-dimensional subspace structures in high-dimensional data. However, most existing methods still face the problem of noise distortion and overlapping subspaces. To tackle this problem and ensure that each sample is only assigned to a single subspace, a new method is proposed in this paper. Specifically, a two-way learning technique is introduced by inducing data manifold via two representative structures. The first is a low-rank structure learned directly from original data. The second structure is an affinity matrix obtained via a k symmetric nearest neighbor graph. By further introducing a dual regularization term, both structures are allowed to guild themselves adaptively to find robust clustering directly without spectral post-processing. In order to evaluate the effectiveness of the proposed method, several experiments are conducted on multiple benchmark datasets. The experimental results, evaluated using six standard metrics, clearly demonstrate that the proposed method outperforms state-of-the-art methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Automated face recognition using deep learning technique and center symmetric multivariant local binary pattern

引用

Neural Computing and Applications 2025年第1期37卷 263-281页

作者： Sekhar, J.C. Josephson, P. Joel Chinnasamy, A. Maheswari, M. Sankar, S. Kalangi, Ruth Ramya Department of Computer Science and Engineering NRI Institute of Technology Andhra Pradesh Guntur India Department of Electronics and Communication Engineering Malla Reddy Engineering College Telangana Hyderabad India Department of Data Science and Business Systems School of Computing SRMIST Kattankulathur Chennai India Department of Computer Science and Engineering Panimalar Engineering College Chennai India Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai India Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vijayawada India

Researchers have recently created several deep learning strategies for various tasks, and facial recognition has made remarkable progress in employing these techniques. Face recognition is a noncontact, nonobligatory, acceptable, and harmonious biometric recognition method with a promising national and social security future. The purpose of this paper is to improve the existing face recognition algorithm, investigate extensive data-driven face recognition methods, and propose a unique automated face recognition methodology based on generative adversarial networks (GANs) and the center symmetric multivariable local binary pattern (CS-MLBP). To begin, this paper employs the center symmetric multivariant local binary pattern (CS-MLBP) algorithm to extract the texture features of the face, addressing the issue that C2DPCA (column-based two-dimensional principle component analysis) does an excellent job of removing the global characteristics of the face but struggles to process the local features of the face under large samples. The extracted texture features are combined with the international features retrieved using C2DPCA to generate a multifeatured face. The proposed method, GAN-CS-MLBP, syndicates the power of GAN with the robustness of CS-MLBP, resulting in an accurate and efficient face recognition system. Deep learning algorithms, mainly neural networks, automatically extract discriminative properties from facial images. The learned features capture low-level information and high-level meanings, permitting the model to distinguish among dissimilar persons more successfully. To assess the proposed technique’s GAN-CS-MLBP performance, extensive experiments are performed on benchmark face recognition datasets such as LFW, YTF, and CASIA-WebFace. Giving to the findings, our method exceeds state-of-the-art facial recognition systems in terms of recognition accuracy and resilience. The proposed automatic face recognition system GAN-CS-MLBP provides a solid basis for a

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Influence analysis of calculated horizontally layered soil parameters on grounding parameters

引用

High Voltage 2023年第2期8卷 421-430页

作者： Yihua Dan Junjun Yin Jian Yang Huizhang Yang Department of Electronic Engineering Tsinghua UniversityBeijingChina School of Computer&Communication Engineering University of Science and Technology BeijingBeijingChina

Calculated parameters(soil layer resistivity,soil layer thickness,and the number of soil layers)of horizontally layered soil are usually obtained based on the measured apparent resistivity under different measurement distances,which are significant for the design,operation,and maintenance of grounding *** existing calculation methods of soil parameters are just trying to make the calculation results approach the measurement data,ignoring the relationship among measurement data,the calculated soil parameters,and grounding parameters,which would increase the workload of the *** better balance the distance range of the measurement data and the influence of the calculated horizontally layered soil on grounding parameters,this paper systematically studies the relationship among measured apparent soil resistivity,calculated horizontally layered soil parameters,and grounding *** basic theories of apparent resistivity measurement,soil parameter calculation,and grounding parameter calculation are given,the influence of soil layer thickness on the measured apparent resistivity is studied,and the influence of the calculated soil parameters on the grounding resistance of different grounding models is *** on different scales of grounding grids,the results give a corresponding reference distance range of measured apparent soil ***,this paper can help decrease the workload of soil resistivity measurement during grounding parameters analysis,which has far-reaching engineering significance.

关键词： soil parameters apparent

来源：评论

学校读者我要写书评

暂无评论

A privacy-preserving method for publishing data with multiple sensitive attributes

引用

CAAI Transactions on Intelligence Technology 2024年第1期9卷 222-238页

作者： Tong Yi Minyong Shi Wenqian Shang Haibin Zhu School of Computer Science and Engineering Guangxi Normal UniversityGuilinChina School of Computer Science Communication University of ChinaBeijingChina Department of Computer Science and Mathematics Nipissing UniversityNorth BayOntarioCanada

The overgeneralisation may happen because most studies on data publishing for multiple sensitive attributes(SAs)have not considered the personalised privacy ***,sensitive information disclosure may also be caused by these personalised *** address the matter,this article develops a personalised data publishing method for multiple *** to the requirements of individuals,the new method partitions SAs values into two categories:private values and public values,and breaks the association between them for privacy *** the private values,this paper takes the process of anonymisation,while the public values are released without this *** algorithm is designed to achieve the privacy mode,where the selectivity is determined by the sensitive value frequency and undesirable *** experimental results show that the proposed method can provide more information utility when compared with previous *** theoretic analyses and experiments also indicate that the privacy can be guaranteed even though the public values are known to an *** overgeneralisation and privacy breach caused by the personalised requirement can be avoided by the new method.

关键词： data privacy data publishing

来源：评论

学校读者我要写书评

暂无评论

Falcon Optimization Algorithm-Based Energy Efficient communication Protocol for Cluster-Based Vehicular Networks

引用

computers, Materials & Continua 2024年第3期78卷 4243-4262页

作者： Youseef Alotaibi B.Rajasekar R.Jayalakshmi Surendran Rajendran Department of Software Engineering College of ComputingUmm Al-Qura UniversityMakkah21955Saudi Arabia Department of Electronics and Communication Engineering Sathyabama Institute of Science and TechnologyChennai600119India Department of Computer Science and Engineering Panimalar Engineering CollegeChennai600123India Department of Computer Science and Engineering Saveetha School of EngineeringSaveetha Institute of Medical and Technical ScienceChennai602105India

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)*** networks give a safe and more effective driving experience by presenting time-sensitive and location-aware *** communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with ***,the scheme of an effectual routing protocol for reliable and stable communications is *** research demonstrates that clustering is an intelligent method for effectual routing in a mobile ***,this article presents a Falcon Optimization Algorithm-based Energy Efficient communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in *** FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the *** accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust *** the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR *** experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

关键词： Vehicular networks communication protocol clustering falcon optimization algorithm routing

来源：评论

学校读者我要写书评

暂无评论

Optimizing Stand-Alone PV Systems:A Metaheuristic-Enhanced Fuzzy Approach for Adaptive MPPT

引用

China communications 2025年第1期22卷 61-74页

作者： Tina Samavat Mostafa Nazari Lin Fuhong Lei Yang Department of Computer Science and Engineering University of NevadaRenoNVUSA Faculty of Mechanical Engineering Shahrood University of TechnologyShahroodIran School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China

This paper introduces a simple yet effective approach for developing fuzzy logic controllers(FLCs)to identify the maximum power point(MPP)and optimize the photovoltaic(PV)system to extract the maximum power in different environmental *** propose a robust FLC with low computational complexity by reducing the number of membership functions and *** optimize the performance of the FLC,metaheuristic algorithms are employed to determine the parameters of the *** evaluate the proposed FLC in various panel configurations under different environmental *** results indicate that the proposed FLC can easily adapt to various panel configurations and perform better than other benchmarks in terms of enhanced stability,responsiveness,and power transfer under various scenarios.

关键词： genetic algorithm imperialist competitive algorithm invasive weed algorithm maximum power point tracking

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Time Series Segmentation Network Based on Eddy Current Testing for Detecting Surface Metal Defects

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 528-538页

作者： Xiaorui Li Xiaojuan Ban Haoran Qiao Zhaolin Yuan Hong-Ning Dai Chao Yao Yu Guo Mohammad S.Obaidat George Q.Huang the School of Intelligence Science and Technology University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering the Key Laboratory of Intelligent Bionic Unmanned Systems and the Institute of Materials Intelligent Technology Liaoning Academy of Materials IEEE the Department of Computer Science Hong Kong Baptist University the School of Computer and Communication Engineering Key Laboratory of Advanced Materials and Devices for Post-Moore Chips Ministry of Education University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing the School of Computer and Communication Engineering University of Science and Technology Beijing the King Abdullah Ⅱ School of Information Technology The University of Jordan the Department of Computational Intelligence the School of Computing SRM University the School of Engineering The Amity University The Hong Kong Polytechnic University

In high-risk industrial environments like nuclear power plants, precise defect identification and localization are essential for maintaining production stability and safety. However, the complexity of such a harsh environment leads to significant variations in the shape and size of the defects. To address this challenge, we propose the multivariate time series segmentation network(MSSN), which adopts a multiscale convolutional network with multi-stage and depth-separable convolutions for efficient feature extraction through variable-length templates. To tackle the classification difficulty caused by structural signal variance, MSSN employs logarithmic normalization to adjust instance distributions. Furthermore, it integrates classification with smoothing loss functions to accurately identify defect segments amid similar structural and defect signal subsequences. Our algorithm evaluated on both the Mackey-Glass dataset and industrial dataset achieves over 95% localization and demonstrates the capture capability on the synthetic dataset. In a nuclear plant's heat transfer tube dataset, it captures 90% of defect instances with75% middle localization F1 score.

关键词： Eddy current testing nondestructive testing semantic segmentation time series analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Service Stipulation Uncertainty with Deep Reinforcement Learning for Internet Vehicle Systems

引用

computers, Materials & Continua 2023年第3期74卷 5705-5721页

作者： Zulqar Nain B.Shahana Shehzad Ashraf Chaudhry P.Viswanathan M.S.Mekala Sung Won Kim Department of Information and Communication Engineering Yeungnam UniversityGyeongsan-siKorea Department of Computer Science and Engineering KLEFIndia Department of Computer Engineering Faculty of Engineering and ArchitectureIstanbul Gelisim UniversityIstanbul34310Turkey School of Computer Science and Engineering VIT UniversityVelloreIndia

Fog computing brings computational services near the network edge to meet the latency constraints of cyber-physical System(CPS)*** devices enable limited computational capacity and energy availability that hamper end user *** designed a novel performance measurement index to gauge a device’s resource *** examination addresses the offloading mechanism issues,where the end user(EU)offloads a part of its workload to a nearby edge server(ES).Sometimes,the ES further offloads the workload to another ES or cloud server to achieve reliable performance because of limited resources(such as storage and computation).The manuscript aims to reduce the service offloading rate by selecting a potential device or server to accomplish a low average latency and service completion time to meet the deadline constraints of sub-divided *** this regard,an adaptive online status predictive model design is significant for prognosticating the asset requirement of arrived services to make float ***,the development of a reinforcement learning-based flexible x-scheduling(RFXS)approach resolves the service offloading issues,where x=service/resource for producing the low latency and high performance of the *** approach to the theoretical bound and computational complexity is derived by formulating the system efficiency.A quadratic restraint mechanism is employed to formulate the service optimization issue according to a set ofmeasurements,as well as the behavioural association rate and adulation *** system managed an average 0.89%of the service offloading rate,with 39 ms of delay over complex scenarios(using three servers with a 50%service arrival rate).The simulation outcomes confirm that the proposed scheme attained a low offloading uncertainty,and is suitable for simulating heterogeneous CPS frameworks.

关键词： Fog computing task allocation measurement models feasible node selection methods performance metrics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：