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

Hierarchical Privacy Protection Model in Advanced Metering Infrastructure Based on Cloud and Fog Assistance

computers, Materials & Continua 2024年第8期80卷 3193-3219页

作者： Linghong Kuang Wenlong Shi Jing Zhang School of Computer Science and Mathematics Fujian University of TechnologyFuzhou350118China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fuzhou350118China

The Advanced Metering Infrastructure(AMI),as a crucial subsystem in the smart grid,is responsible for measuring user electricity consumption and plays a vital role in communication between providers and ***,with the advancement of information and communication technology,new security and privacy challenges have emerged for *** address these challenges and enhance the security and privacy of user data in the smart grid,a Hierarchical Privacy Protection Model in Advanced Metering Infrastructure based on Cloud and Fog Assistance(HPPM-AMICFA)is proposed in this *** proposed model integrates cloud and fog computing with hierarchical threshold encryption,offering a flexible and efficient privacy protection solution that significantly enhances data security in the smart *** methodology involves setting user protection levels by processing missing data and utilizing fuzzy comprehensive analysis to evaluate user importance,thereby assigning appropriate protection ***,a hierarchical threshold encryption algorithm is developed to provide differentiated protection strategies for fog nodes based on user IDs,ensuring secure aggregation and encryption of user *** results demonstrate that HPPM-AMICFA effectively resists various attack strategies while minimizing time costs,thereby safeguarding user data in the smart grid.

关键词： AMI cloud and fog assistance fuzzy comprehensive analysis hierarchical threshold encryption

来源：评论

学校读者我要写书评

暂无评论

ARCHER:a ReRAM-based accelerator for compressed recommendation systems

引用

Frontiers of computer science 2024年第5期18卷 147-160页

作者： Xinyang SHEN Xiaofei LIAO Long ZHENG Yu HUANG Dan CHEN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Modern recommendation systems are widely used in modern data *** random and sparse embedding lookup operations are the main performance bottleneck for processing recommendation systems on traditional platforms as they induce abundant data movements between computing units and ***-based processing-in-memory(PIM)can resolve this problem by processing embedding vectors where they are ***,the embedding table can easily exceed the capacity limit of a monolithic ReRAM-based PIM chip,which induces off-chip accesses that may offset the PIM ***,we deploy the decomposed model on-chip and leverage the high computing efficiency of ReRAM to compensate for the decompression performance *** this paper,we propose ARCHER,a ReRAM-based PIM architecture that implements fully yon-chip recommendations under resource ***,we make a full analysis of the computation pattern and access pattern on the decomposed *** on the computation pattern,we unify the operations of each layer of the decomposed model in multiply-and-accumulate *** on the access observation,we propose a hierarchical mapping schema and a specialized hardware design to maximize resource *** the unified computation and mapping strategy,we can coordinatethe inter-processing elements *** evaluation shows that ARCHER outperforms the state-of-the-art GPU-based DLRM system,the state-of-the-art near-memory processing recommendation system RecNMP,and the ReRAM-based recommendation accelerator REREC by 15.79×,2.21×,and 1.21× in terms of performance and 56.06×,6.45×,and 1.71× in terms of energy savings,respectively.

关键词： recommendation system ReRAM processing-in-memory embedding layer

来源：评论

学校读者我要写书评

暂无评论

Generating (Semi-)active Schedules for Dynamic Multi-mode Project Scheduling Using Genetic Programming Hyper-heuristics 25th

Generating (Semi-)active Schedules for Dynamic Multi-mode P...

引用

25th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2025 Held as Part of EvoStar 2025

作者： Tian, Yuan Mei, Yi Zhang, Mengjie Centre for Data Science and Artificial Intelligence and School of Engineering and Computer Science Victoria University of Wellington Wellington6012 New Zealand

ISBN: (纸本)9783031868481

Dynamic multi-mode resource-constrained project scheduling problem (DMRCPSP) is crucial for effectively managing complex projects where activities have multiple options of resource demand and durations are uncertain. Efficient solutions to this problem are vital for industrial applications, where optimal scheduling can significantly impact project costs and timelines. Genetic programming hyper-heuristic (GPHH) has been applied to evolve effective scheduling heuristics to make real-time decisions. However, current decision-making procedures for solving DMRCPSP primarily generate non-delay schedules, which are often suboptimal. This paper proposes two new decision-making procedures to generate (semi-)active schedules. The core idea is to expand the decision set and allow activities that cannot immediately start to reserve resources for future execution. We further developed GPHH to evolve scheduling heuristics based on these procedures and a comparison was conducted with existing decision-making procedures. The results demonstrated that the proposed GP approaches managed to evolve rules that generate more effective (semi-)active schedules than the best-known non-delayed schedules in real-time. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Attack based on data: a novel perspective to attack sensitive points directly

引用

Cybersecurity 2024年第3期7卷 111-123页

作者： Yuyao Ge Zhongguo Yang Lizhe Chen Yiming Wang Chengyang Li School of Information Science and Technology North China University of TechnologyBeijingChina Bejing Key Laboratory on Integration and Analysis of Large-Scale Stream Data North China University of TechnologyBeijingChina School of Computer Science Peking UniversityBeijingChina

Adversarial attack for time-series classification model is widely explored and many attack methods are *** there is not a method of attack based on the data *** this paper,we innovatively proposed a black-box sparse attack method based on data *** method directly attack the sensitive points in the time-series data accord-ing to statistical features extract from the *** frst,we have validated the transferability of sensitive points among DNNs with different ***,we use the statistical features extract from the dataset and the sensi-tive rate of each point as the training set to train the predictive ***,predicting the sensitive rate of test set by predictive ***,perturbing according to the sensitive *** attack is limited by constraining the LO norm to achieve one-point *** conduct experiments on several datasets to validate the effectiveness of this method.

关键词： Black-box adversarial attack Time series classification data mining

来源：评论

学校读者我要写书评

暂无评论

The most tenuous group query

引用

Frontiers of computer science 2023年第2期17卷 197-208页

作者： Na LI Huaijie ZHU Wenhao LU Ningning CUI Wei LIU Jian YIN Jianliang XU Wang-Chien LEE School of Computer Science and Engineering Sun Yat-Sen UniversityGuangzhou 510006China Laboratory of Big Data Analysis and Processing Guangzhou 510006China School of Artificial Intelligence Sun Yat-Sen UniversityGuangzhou 510006China Department of Computer Science Anhui UniversityHefei 230601China Department of Computer Science Hong Kong Baptist UniversityHong Kong 999077China Department of Computer Science The Pennsylvania State UniversityState College 19019USA

Rtecently a lot of works have been investigating to find the tenuous groups,i.e.,groups with few social interactions and weak relationships among members,for reviewer selection and psycho-educational group ***,the metrics(e.g.,k-triangle,k-line,and k-tenuity)used to measure the tenuity,require a suitable k value to be specified which is difficult for users without background ***,in this paper we formulate the most tenuous group(MTG)query in terms of the group distance and average group distance of a group measuring the tenuity to eliminate the influence of parameter k on the tenuity of the *** address the MTG problem,we first propose an exact algorithm,namely MTGVDIS,which takes priority to selecting those vertices whose vertex distance is large,to generate the result group,and also utilizes effective filtering and pruning *** MTGVDIS is not fast enough,we design an efficient exact algorithm,called MTG-VDGE,which exploits the degree metric to sort the vertexes and proposes a new combination order,namely degree and reverse based branch and bound(DRBB).MTG-VDGE gives priority to those vertices with small *** a large p,we further develop an approximation algorithm,namely MTG-VDLT,which discards candidate attendees with high degree to reduce the number of vertices to be *** experimental results on real datasets manifest that the proposed algorithms outperform existing approaches on both efficiency and group tenuity.

关键词： tenuous group pruning strategy social network group query

来源：评论

学校读者我要写书评

暂无评论

A Scalable Adaptive Approach to Multi-Vehicle Formation Control with Obstacle Avoidance

引用

IEEE/CAA Journal of Automatica Sinica 2022年第6期9卷 990-1004页

作者： Xiaohua Ge Qing-Long Han Jun Wang Xian-Ming Zhang IEEE School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourneVIC 3122Australia Department of Computer Science and School of Data Science City University of Hong KongChina

This paper deals with the problem of distributed formation tracking control and obstacle avoidance of multivehicle systems(MVSs)in complex obstacle-laden *** MVS under consideration consists of a leader vehicle with an unknown control input and a group of follower vehicles,connected via a directed interaction topology,subject to simultaneous unknown heterogeneous nonlinearities and external *** central aim is to achieve effective and collisionfree formation tracking control for the nonlinear and uncertain MVS with obstacles encountered in formation maneuvering,while not demanding global information of the interaction *** this goal,a radial basis function neural network is used to model the unknown nonlinearity of vehicle dynamics in each vehicle and repulsive potentials are employed for obstacle ***,a scalable distributed adaptive formation tracking control protocol with a built-in obstacle avoidance mechanism is *** is proved that,with the proposed protocol,the resulting formation tracking errors are uniformly ultimately bounded and obstacle collision avoidance is *** simulation results are elaborated to substantiate the effectiveness and the promising collision avoidance performance of the proposed scalable adaptive formation control approach.

关键词： Adaptive control collision avoidance distributed formation control multi-vehicle systems neural networks obstacle avoidance repulsive potential

来源：评论

学校读者我要写书评

暂无评论

Packet Scheduling in Rechargeable Wireless Sensor Networks under SINR Model

引用

China Communications 2023年第3期20卷 286-301页

作者： Baogui Huang Jiguo Yu Chunmei Ma Guangshun Li Anming Dong School of Computer Science Qufu Normal UniversityRizhao 276826China Big Data Institute Qilu University of TechnologyJinan 250353China School of Computer Science and Technology Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Two packet scheduling algorithms for rechargeable sensor networks are proposed based on the signal to interference plus noise ratio *** allocate different transmission slots to conflicting packets and overcome the challenges caused by the fact that the channel state changes quickly and is *** first algorithm proposes a prioritybased framework for packet scheduling in rechargeable sensor *** packet is assigned a priority related to the transmission delay and the remaining energy of rechargeable batteries,and the packets with higher priority are scheduled *** second algorithm mainly focuses on the energy efficiency of *** priorities are related to the transmission distance of packets,and the packets with short transmission distance are scheduled *** sensors are equipped with low-capacity rechargeable batteries,and the harvest-store-use model is *** consider imperfect *** is,the battery capacity is limited,and battery energy leaks over *** energy harvesting rate,energy retention rate and transmission power are *** simulation results indicate that the battery capacity has little effect on the packet scheduling ***,the algorithms proposed in this paper are very suitable for wireless sensor networks with low-capacity batteries.

关键词： packet scheduling physical interference model rechargeable sensor networks SINR model

来源：评论

学校读者我要写书评

暂无评论

A multilayer network diffusion-based model for reviewer recommendation

引用

Chinese Physics B 2024年第3期33卷 700-717页

作者：黄羿炜徐舒琪蔡世民吕琳媛 Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu 611731China Yangtze Delta Region Institute (Huzhou) University of Electronic Science and Technology of ChinaHuzhou 313001China Institute of Dataspace Hefei Comprehensive National Science CenterHefei 230088China Big Data Research Center University of Electronic Science and Technology of ChinaChengdu 611731China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Cyber Science and Technology University of Science and Technology of ChinaHefei 230026China

With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy *** systems are powerful tools developed in computer science and information science to deal with this ***,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform *** this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual *** network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among *** results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking *** work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.

关键词： reviewer recommendation multilayer network network diffusion model recommender systems complex networks

来源：评论

学校读者我要写书评

暂无评论

Layer-Wise Learning Rate Optimization for Task-Dependent Fine-Tuning of Pre-Trained Models: An Evolutionary Approach

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第4期4卷 1-23页

作者： Bu, Chenyang Liu, Yuxin Huang, Manzong Shao, Jianxuan Ji, Shengwei Luo, Wenjian Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Ministry of Education and School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Artificial Intelligence and Big Data Hefei University Hefei China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Shenzhen China

The superior performance of large-scale pre-Trained models, such as Bidirectional Encoder Representations from Transformers (BERT) and Generative Pre-Trained Transformer (GPT), has received increasing attention in both academic and industrial research and has become one of the current research hotspots. A pre-Trained model refers to a model trained on large-scale unlabeled data, whose purpose is to learn general language representation or features for fine-Tuning or transfer learning in subsequent tasks. After pre-Training is complete, a small amount of labeled data can be used to fine-Tune the model for a specific task or domain. This two-stage method of "pre-Training+fine-Tuning"has achieved advanced results in natural language processing (NLP) tasks. Despite widespread adoption, existing fixed fine-Tuning schemes that adapt well to one NLP task may perform inconsistently on other NLP tasks given that different tasks have different latent semantic structures. In this article, we explore the effectiveness of automatic fine-Tuning pattern search for layer-wise learning rates from an evolutionary optimization perspective. Our goal is to use evolutionary algorithms to search for better task-dependent fine-Tuning patterns for specific NLP tasks than typical fixed fine-Tuning patterns. Experimental results on two real-world language benchmarks and three advanced pre-Training language models show the effectiveness and generality of the proposed framework. © 2024 held by the owner/author(s).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Multi-Keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

引用

computers, Materials & Continua 2024年第3期78卷 3177-3194页

作者： Bin Wu Xianyi Chen Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei School of Computer and Big Data Science Jiujiang UniversityJiujiang332005China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Engineering Hubei University of Arts and ScienceXiangyang441053China School of Modern Information Technology Zhejiang Institute of Mechanical and Electrical EngineeringHangzhou310053China Information Center Jiangxi Changjiang Chemical Co.Ltd.Jiujiang332005China School of Mathematics and Computer Science Ningxia Normal UniversityGuyuan756099China

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so *** owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud *** on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure *** issue of privacy data protection has become an important obstacle to data sharing and *** to query outsourcing graph data safely and effectively has become the focus of *** query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same *** work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a *** our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud *** proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental *** research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

关键词： Privacy-preserving adjacency query multi-keyword fuzzy search encrypted graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：