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

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

FedCache 2.0: Federated Edge Learning with Knowledge Caching and dataset Distillation

arXiv

引用

arXiv 2024年

作者： Pan, Quyang Sun, Sheng Wu, Zhiyuan Wang, Yuwei Liu, Min Gao, Bo Wang, Jingyuan The State Key Laboratory of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing China The University of Chinese Academy of Sciences Beijing China The Zhongguancun Laboratory Beijing China The School of Computer and Information Technology The Engineering Research Center of Network Management Technology for High-Speed Railway Ministry of Education Beijing Jiaotong University Beijing China The School of Computer Science and Engineering Beihang Unversity Beijing China

Federated Edge Learning (FEL) has emerged as a promising approach for enabling edge devices to collaboratively train machine learning models while preserving data privacy. Despite its advantages, practical FEL deployment faces significant challenges stemming from device constraints and device-server interactions, necessitating heterogeneous, user-adaptive model training with limited and uncertain communication conditions. Knowledge Cache-driven Federated Learning (FedCache) is a promising architecture that enables communication-efficient and heterogeneous-aware collaborative training in edge computing scenarios. However, previous work is limited by the intrinsic nature of logits-based interactions, leading to performance bottlenecks due to the poor richness of exchanged information for on-device model optimization. To tackle this issue, we introduce FedCache 2.0, a novel personalized FEL architecture that enhances the exchange of optimization insights while delivering state-of-the-art performance with efficient communication. FedCache 2.0 incorporates the benefits of both dataset distillation and knowledge cache-driven federated learning by storing and organizing distilled data as knowledge in the server-side knowledge cache, allowing devices to periodically download and utilize personalized knowledge for local model optimization. Moreover, a device-centric cache sampling strategy is introduced to tailor transferred knowledge for individual devices within controlled communication bandwidth. Extensive experiments on five datasets covering image recognition, audio understanding, and mobile sensor data mining tasks demonstrate that (1) FedCache 2.0 significantly outperforms state-of-the-art methods regardless of model structures, data distributions, and modalities. (2) FedCache 2.0 can train splendid personalized on-device models with at least ×28.6 improvement in communication efficiency. Our code is available at https://***/poppanda/FedCache2. 0. Copyright © 2

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Benders Decomposition Approach for Optimal Large-Scale network Slicing

arXiv

引用

arXiv 2023年

作者： Chen, Wei-Kun Wu, Zheyu Zhang, Rui-Jin Liu, Ya-Feng Dai, Yu-Hong Luo, Zhi-Quan The School of Mathematics and Statistics Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China

This paper considers the network slicing (NS) problem which attempts to map multiple customized virtual network requests to a common shared network infrastructure and allocate network resources to meet diverse service requirements. This paper proposes an efficient customized Benders decomposition algorithm for globally solving the large-scale NP-hard NS problem. The proposed algorithm decomposes the hard NS problem into two relatively easy function placement (FP) and traffic routing (TR) subproblems and iteratively solves them enabling the information feedback between each other, which makes it particularly suitable to solve large-scale problems. Specifically, the FP subproblem is to place service functions into cloud nodes in the network, and solving it can return a function placement strategy based on which the TR subproblem is defined;and the TR subproblem is to find paths connecting two nodes hosting two adjacent functions in the network, and solving it can either verify that the solution of the FP subproblem is an optimal solution of the original problem, or return a valid inequality to the FP subproblem that cuts off the current infeasible solution. The proposed algorithm is guaranteed to find the globally optimal solution of the NS problem. By taking the special structure of the NS problem into consideration, we successfully develop two families of valid inequalities that render the proposed algorithm converge much more quickly and thus much more efficient. Numerical results demonstrate that the proposed valid inequalities effectively accelerate the convergence of the decomposition algorithm, and the proposed algorithm significantly outperforms the existing algorithms in terms of both solution efficiency and quality. Copyright © 2023, The Authors. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Traffic Engineering in Dynamic Hybrid Segment Routing networks

引用

Computers, Materials & Continua 2021年第7期68卷 655-670页

作者： Yingya Guo Kai Huang Cheng Hu Jiangyuan Yao Siyu Zhou College of Mathematics and Computer Science Fuzhou UniversityFuzhou350000China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350000China Key Laboratory of Spatial Data Mining&Information Sharing Ministry of EducationFuzhou350003China School of Information Science and Technology Guangdong University of Foreign StudiesGuangzhou510006China School of Computer Science and Cyberspace Security Hainan UniversityHaiKou570228China Tandon School of Engineering New York UniversityNew York10012USA Department of Computing Hong Kong Polytechnic UniversityHong Hom999077Hong Kong

The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet *** SR architecture,the paths that the packets choose to route on are indicated at the ingress *** with shortest-path-based routing in traditional distributed routing protocols,SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress *** the advantages of SR,it may be difficult to update the existing IP network to a full SR deployed network,for economical and technical *** partial of the traditional IP network to the SR network,thus forming a hybrid SR network,is a preferable *** the traffic is dynamically changing in a daily time,in this paper,we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR *** algorithm can be divided into three steps:firstly,representative Traffic Matrices(TMs)and the expected TM are obtained from the historical TMs through ultrascalable spectral clustering ***,given the network topology,the initial network weight setting and the expected TM,we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning(DRL)***,we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands,in order to improve the network *** the evaluation,we exploit historical TMs to test the performance of the obtained routing configuration in *** extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization(MLU)under the dynamic traffic.

关键词： Traffic engineering routing optimization segment routing deep reinforcement learning ultra-scalable spectral clustering

来源：评论

学校读者我要写书评

暂无评论

Predicting RNA Secondary Structure on Universal Quantum Computer

arXiv

引用

arXiv 2023年

作者： Jiang, Ji Yan, Qipeng Li, Ye Lu, Min Cui, Ziwei Dou, Menghan Wang, Qingchun Wu, Yu-Chun Guo, Guo-Ping Origin Quantum Computing Company Limited Anfei Hefei230026 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anfei Hefei230088 China CAS Key Laboratory of Quantum Information School of Physics University of Science and Technology of China Hefei230026 China CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei230026 China

It is the first step for understanding how RNA structure folds from base sequences that to know how its secondary structure is formed. Traditional energy-based algorithms are short of precision, particularly for non-nested sequences, while learning-based algorithms face challenges in obtaining high-quality training data. Recently, quantum annealer has rapidly predicted the folding of the secondary structure, highlighting that quantum computing is a promising solution to this problem. However, gate model algorithms for universal quantum computing are not available. In this paper, gate-based quantum algorithms will be presented, which are highly flexible and can be applied to various physical devices. Mapped all possible secondary structure to the state of a quadratic Hamiltonian, the whole folding process is described as a quadratic unconstrained binary optimization model. Then the model can be solved through quantum approximation optimization algorithm. We demonstrate the performance with both numerical simulation and experimental realization. Throughout our benchmark dataset, simulation results suggest that our quantum approach is comparable in accuracy to classical methods. For non-nested sequences, our quantum approach outperforms classical energy-based methods. Experimental results also indicate our method is robust in current noisy devices. It is the first instance of universal quantum algorithms being employed to tackle RNA folding problems, and our work provides a valuable model for utilizing universal quantum computers in solving RNA folding problems. Copyright © 2023, The Authors. All rights reserved.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

BaKGraSTeC: A Background Knowledge Graph Based Method for Short Text Classification

BaKGraSTeC: A Background Knowledge Graph Based Method for Sh...

引用

IEEE International Conference on Big Knowledge (ICBK)

作者： Xuhui Jiang Yinghan Shen Yuanzhuo Wang Xiaolong Jin Xueqi Cheng CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

Short text classification is an important task in the area of natural language processing. Recent studies attempt to employ external knowledge to improve classification performance, but they ignore the correlation between external knowledge and have poor interpretability. This paper proposes a novel Background Knowledge Graph based method for Short Text Classification called BaKGraSTeC for short, which can not only employ external knowledge from a knowledge graph to enrich text information, but also utilize its structural information through a graph neural network to promote the understanding of texts. Specifically, we construct a background knowledge graph based on training data, then we propose a novel architecture that integrates background knowledge graph into a graph neural network to model and capture implicit interactions between its concepts and classes. Besides, we propose an attention mechanism considering both similarity and co-occurrence between concepts and classes to identify the informative concepts in texts. Our experimental results demonstrate the effectiveness with good interpretability of BaKGraSTeC through using external knowledge and their structural information for short text classification.

关键词： Knowledge engineering Neural networks Task analysis Semantics Natural language processing Syntactics Machine learning

来源：评论

学校读者我要写书评

暂无评论

Auction Theory and Game Theory Based Pricing of Edge computing Resources: A Survey

引用

IEEE Internet of Things Journal 2025年

作者： Yu, Jiguo Liu, Shun Zou, Yifei Wang, Guijuan Hu, Chunqiang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Qufu Normal University School of Computer Science Shandong Rizhao China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250353 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

The proliferation of Internet of Things (IoT) devices and edge computing applications has heightened the demand for efficient resource allocation and pricing mechanisms. Effective pricing strategies play a crucial role in optimizing resource utilization, reducing latency, and ensuring fair resource distribution among users. Both auction theory and game theory have emerged as fundamental economic frameworks for designing pricing mechanisms in edge computing. This paper presents a comprehensive survey of pricing strategies that leverage both auction and game theory, systematically categorizing existing research based on auction mechanisms and game-theoretic models. Unlike previous surveys that focus solely on auction-based pricing, this work integrates game-theoretic perspectives, providing a holistic analysis of strategic interactions in edge computing resource allocation. Furthermore, we discuss key challenges, emerging trends, and future research directions aimed at enhancing efficiency, fairness, and privacy protection in cloud-edge collaborative computing environments. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

A differential public PUF design for lightweight authentication 16

A differential public PUF design for lightweight authenticat...

引用

2021 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design, SMACD 2021 and 16th Conference on PhD Research in Microelectronics and Electronics, PRIME 2021

作者： Duan, Shengyu Sai, Gaole School of Computer Engineering and Science Shanghai University Shanghai200444 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Guangdong Provincial Key Lab of Robotics and Intelligent System Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China CAS Key Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institutes of Advanced Technology China

ISBN: (纸本)9783800755899

Physical Unclonable Functions (PUFs) have emerged as a promising primitive to provide a hardware keyless security mechanism for integrated circuit applications. Public PUFs (PPUFs) address the crucial PUF vulnerability of requiring databases to store the secrete reference information. This paper investigates one of the PPUF families, differential PPUF (dPPUF), which exploits complexly interacted logic to create time gap between actual execution and simulation, and to prevent simulation attacks. Conventional dPPUFs have high costs. We observe the repressers have large impact on simulation time, but take a great proportion in current dPPUF structure. We thereby present a represser network with specially designed interconnection and shared logic, to maintain a high circuit complexity and to reduce the area cost. We show the proposed dPPUF has similar resilience over simulation attacks as the conventional design. Area cost can be reduced by up to 44%, and thus the proposed design can be used for lightweight authentication. © VDE VERLAG GMBH.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

SPECWANDS: An Efficient Priority-based Scheduler Against Speculation Contention Attacks

arXiv

引用

arXiv 2023年

作者： Tang, Bowen Wu, Chenggang Yew, Pen-Chung Zhang, Yinqian Xie, Mengyao Lai, Yuanming Kang, Yan Wang, Wei Wei, Qiang Wang, Zhe SKLP Institute of Computing Technology CAS Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Zhongguancun Laboratory Beijing China Computer Science & Engineering Department The University of Minnesota-Twin Cities MN55455 United States Department of Computer Science and Engineering The Southern University of Science and Technology Shenzhen518055 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450000 China

Transient Execution Attacks (TEAs) have gradually become a major security threat to modern high-performance processors. They exploit the vulnerability of speculative execution to illegally access private data, and transmit them through timing-based covert channels. While new vulnerabilities are discovered continuously, the covert channels can be categorised to two types: 1) Persistent Type, in which covert channels are based on the layout changes of buffering, e.g. through caches or TLBs;2) Volatile Type, in which covert channels are based on the contention of sharing resources, e.g. through execution units or issuing ports. The defenses against the persistent-type covert channels have been well addressed, while those for the volatile-type are still rather inadequate. Existing mitigation schemes for the volatile type such as Speculative Compression and Time-Division-Multiplexing will introduce significant overhead due to the need to stall the pipeline or to disallow resource sharing. In this paper, we look into such attacks and defenses with a new perspective, and propose a scheduling-based mitigation scheme, called SPECWANDS. It consists of three priority-based scheduling policies to prevent an attacker from transmitting the secret in different contention situations. SPECWANDS not only can defend against both inter-thread and intra-thread based attacks, but also can keep most of the performance benefit from speculative execution and resource-sharing. We evaluate its runtime overhead on SPEC 2017 benchmarks and realistic programs. The experimental results show that SPECWANDS has a significant performance advantage over the other two representative schemes. Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Quantum Digital Signatures over Long Distances with Likely Bit Strings

arXiv

引用

arXiv 2024年

作者： Qin, Ji-Qian Yu, Zong-Wen Wang, Xiang-Bin State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing100084 China Data Communication Science and Technology Research Institute Beijing100191 China Jinan Institute of Quantum technology SAICT Jinan250101 China Shanghai Branch CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics University of Science and Technology of China Shanghai201315 China Shenzhen Institute for Quantum Science and Engineering Physics Department Southern University of Science and Technology Shenzhen518055 China Frontier Science Center for Quantum Information Beijing100084 China

Quantum digital signatures (QDSs) can provide information-theoretic security of messages against forgery and repudiation. Compared with previous QDS protocols that focus on signing one-bit messages, hash function-based QDS protocols can save quantum resources and are able to sign messages of arbitrary length. Using the idea of likely bit strings, we propose an efficient QDS protocol with hash functions over long distances. Our method of likely bit strings can be applied to any quantum key distribution-based QDS protocol to significantly improve the signature rate and dramatically increase the secure signature distance of QDS protocols. In order to save computing resources, we propose an improved method where Alice participates in the verification process of Bob and Charlie. This eliminates the computational complexity relating to the huge number of all likely strings. We demonstrate the advantages of our method and our improved method with the example of sending-or-not-sending QDS. Under typical parameters, both our method and our improved method can improve the signature rate by more than 100 times and increase the signature distance by about 150 km compared with hash function-based QDS protocols without likely bit strings. Copyright © 2024, The Authors. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：