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

18th International Conference on Computational Intelligence and Security, CIS 2022

作者： Xuan, Hejun Lin, Lidan Liu, Zhenghui Zhao, Xuelin Xinyang Normal University Department of Computer and Information Technology China Big Data Xinyang Normal University Henan Key Laboratory of Analysis and Applications of Education Xinyang Henan China Luo He Vocational Technology College Department of Information Engineering Luohe Henan China

ISBN: (纸本)9798350346275

In mobile edge computing, computing and storage resources are close to the network of the user device, which can effectively reduce network access and computing service delay. However, network function virtualization for mobile edge computing networks is more challenging due to the strong coupling of CPU resources, storage resources, and wireless resources. In order to solve the problems of load balance and long response time of user-oriented service function chain deployment algorithm in mobile edge computing networks, this paper proposed a load balance and time delay efficient algorithm (denoted as LBDQN) for virtual network function service chain deployment problem based Deep Q-LearningFirst, a global optimization model, which minimizes time delay and maximizes the load balance, is established. Then, a new real-time algorithm for VNF service chain deployment based on DQN is proposed. In this algorithm, an adaptive ϵ-greedy method is designed. In addition, a particle swarm optimization is used to optimize the neural network parameters. To demonstrate the efficiency of the proposed algorithm, some simulation experiments are conducted and the experimental results show that the algorithm can effectively reduce the time delay and improve the load balance than the compared algorithms. © 2022 IEEE.

关键词： Time delay

来源：评论

学校读者我要写书评

暂无评论

Unveiling Vulnerability of Self-Attention

arXiv

引用

arXiv 2024年

作者： Liong, Khai Jiet Wu, Hongqiu Zhao, Hai Xiaoshan, Li Minjie, Bian Department of Computer Science and Engineering Shanghai Jiao Tong University China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China Shanghai Technology Innovation Department Shanghai Data Group Co. Ltd China Shanghai Data Group Co. Ltd China

Pre-trained language models (PLMs) are shown to be vulnerable to minor word changes, which poses a big threat to real-world systems. While previous studies directly focus on manipulating word inputs, they are limited by their means of generating adversarial samples, lacking generalization to versatile real-world attack. This paper studies the basic structure of transformer-based PLMs, the self-attention (SA) mechanism. (1) We propose a powerful perturbation technique HackAttend, which perturbs the attention scores within the SA matrices via meticulously crafted attention masks. We show that state-of-the-art PLMs fall into heavy vulnerability that minor attention perturbations (1%) can produce a very high attack success rate (98%). Our paper expands the conventional text attack of word perturbations to more general structural perturbations. (2) We introduce S-Attend, a novel smoothing technique that effectively makes SA robust via structural perturbations. We empirically demonstrate that this simple yet effective technique achieves robust performance on par with adversarial training when facing various text attackers. Code is publicly available at ***/liongkj/HackAttend. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Dynamic Graph Neural Networks for Joint Terahertz based Sensing and Communication Optimization in Vehicular Networks

Dynamic Graph Neural Networks for Joint Terahertz based Sens...

引用

IEEE Conference on Wireless Communications and Networking

作者： Xuefei Li Mingzhe Chen Ye Hu Zhilong Zhang Danpu Liu Shiwen Mao Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijina China Department-of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA Department of Industrial and System Engineering University of Miami Coral Gables FL USA Department of Electrical and Computer Engineering Auburn University Auburn AL USA

ISBN: (数字)9798350303582

ISBN: (纸本)9798350303599

In this paper, the problem of vehicle service mode selection (sensing, communication, or both) and vehicle connections within terahertz (THz) enabled joint sensing and communications over vehicular networks is studied. The considered network consists of several service provider vehicles (SPVs) that can provide: 1) only sensing service, 2) only communication service, and 3) both services, sensing service request vehicles, and communication service request vehicles. Based on the vehicle network topology and their service accessibility, SPVs strategically select service request vehicles to provide sensing, communication, or both services. This problem is formulated as an optimization problem, aiming to maximize the number of successfully served vehicles by jointly determining the service mode of each SPV and its associated vehicles. To solve this problem, we propose a dynamic graph neural network (GNN) model that selects appropriate graph information aggregation functions according to the vehicle network topology, thus extracting more vehicle network information compared to traditional static GNNs that use fixed aggregation functions for different vehicle network topologies. Using the extracted vehicle network information, the service mode of each SPV and its served service request vehicles will be determined. Simulation results show that the proposed dynamic GNN based scheme can improve the number of successfully served vehicles by up to 17% compared to a GNN based algorithm with a fixed neural network model.

关键词： Network topology Simulation Heuristic algorithms Graph neural networks Sensors data mining Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

A Bi-objective Optimal Scheme for 5G Base Station Deployment Based on BPSO 12th

A Bi-objective Optimal Scheme for 5G Base Station Deployment...

引用

12th International Conference on computer engineering and Networks, CENet 2022

作者： Zhu, Tao Xu, Yin-qing Guo, Hao-qi Wang, Yi-bo Department of Computer Information and Cyber Security Jiangsu Police Institute Nanjing China Engineering Research Center of Electronic Data Forensics Analysis Jiangsu Province Nanjing China Key Laboratory of Digital Forensics Department of Public Security of Jiangsu Province Nanjing210031 China

ISBN: (纸本)9789811969003

The 5G mobile network is a kind of critical information infrastructure for future Internet of Things. Due to its rapid development, the planning and deployment of 5G network base stations is a more urgent and meaningful problem than ever before from the aspect of optimization. Because the purpose of establishing a 5G base station is to make its wireless signal cover as many areas as possible, a 0–1 programming model with two optimal objectives is proposed for 5G base stations based on the cover set. Then after analyzing the difficulties in solving the problem expressed by above model, employing the idea of divide and conquer and the strategies of parallelization, a scheme based on Binary Particle Swarm Optimization (BPSO) algorithm is proposed to solve this problem. In the first step of the scheme, the partition processing based on coordinate position is considered by the way of dividing the target area into many smaller sub-areas with the algorithm of Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH). The next step is to use BPSO algorithm improved by sparse particles initialization and a suppressor factor to solve each small sub-area with the parallel computing and the memory mapping technology. The proposed approach has been tested in several experiments and the experimental results demonstrate its effectiveness. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

Structured Tensor Decomposition Based Channel Estimation and Double Refinements for Active RIS Empowered Broadband Systems

arXiv

引用

arXiv 2024年

作者： Wang, Yirun Wang, Yongqing Shen, Yuyao Wang, Gongpu Tellambura, Chintha School of Information and Electronics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory of Transportation Data Analysis and Mining Beijing Jiaotong University Beijing100044 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada

Channel parameter recovery is critical for the next-generation reconfigurable intelligent surface (RIS)-empowered communications and sensing. Tensor-based mechanisms are particularly effective, inherently capturing the multi-dimensional nature of wireless channels. However, existing studies assume either a line-of-sight (LOS) scenario or a blocked TX-RX channel. This paper solves a novel problem: tensor-based channel parameter estimation for active RIS-aided multiple-antenna broadband connections in fully multipath environments with the TX-RX link. System settings are customized to construct a fifth-order canonical polyadic (CP) signal tensor that matches the five-dimensional channel. Four tensor factors contain redundant columns, rendering the classical Kruskal’s condition for decomposition uniqueness unsatisfied. The fifth-order Vandermonde structured CP decomposition (VSCPD) is developed to address this challenge, making the tensor factorization problem solvable using only linear algebra and offering a relaxed general uniqueness condition. With VSCPD as a perfect decoupling scheme, a sequential triple-stage channel estimation algorithm is proposed based on one-dimensional parameter estimation. The first stage enables multipath identification and algebraic coarse estimation. The following two stages offer optional successive refinements at the cost of increased complexity. The closed-form Cramér-Rao lower bound (CRLB) is derived to assess the estimation performance. Herein, the noise covariance matrix depends on multipath parameters in our active-RIS scenario. Numerical results are provided to verify the effectiveness of proposed algorithms under various evaluation metrics. Our results also show that active RIS can significantly improve channel estimation performance compared to passive RIS. Copyright © 2024, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

LaCo: Large Language Model Pruning via Layer Collapse

arXiv

引用

arXiv 2024年

作者： Yang, Yifei Cao, Zouying Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 China

Large language models (LLMs) based on transformer are witnessing a notable trend of size expansion, which brings considerable costs to both model training and inference. However, existing methods such as model quantization, knowledge distillation, and model pruning are constrained by various issues, including hardware support limitations, the need for extensive training, and alterations to the model internal structure. In this paper, we propose a concise layer-wise structured pruner called Layer Collapse (LaCo), in which rear model layers collapse into a prior layer, enabling a rapid reduction in model size while preserving the model structure. Comprehensive experiments show that our method maintains an average task performance of over 80% at pruning ratios of 25-30%, significantly outperforming existing state-of-the-art structured pruning methods. We also conduct post-training experiments to confirm that the LaCo effectively inherits the parameters of the original model. Additionally, we perform ablation studies on various settings of LaCo. Finally, we discuss our motivation from the perspective of layer-wise similarity and evaluate the performance of the pruned LLMs across various pruning ratios Copyright © 2024, The Authors. All rights reserved.

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

Front-running Attacks in Hash-Based Transaction Sharding Blockchains 23

Front-running Attacks in Hash-Based Transaction Sharding Blo...

引用

23rd IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2024

作者： Wang, Yusen Lou, Jiong Wang, Zihan Li, Jie Shanghai Jiao Tong University Department of Computer Science and Engineering China Blockchain Advanced Research Center China Shanghai Key Laboratory of Trusted Data Circulation and Governance and Web3 China

Sharding is one of the prominent solutions to solve the scalability problem of traditional blockchains. By dividing the blockchain network into independent shards, transactions in different shards can be executed in parallel, improving the throughput of the blockchain. However, sharding also brings security issues. In a hash-based transaction sharding system, the output shard of a transaction is determined by the hash value of the transaction. Unfortunately, we show that this hashbased transaction assignment strategy can be easily exploited by attackers to conduct front-running attacks. Attackers can take advantage of the execution differences between different shards and the extra processing time of cross-shard transactions to make the attacker's transaction executed and committed before the victim's transaction, thereby obtaining the benefits that originally belonged to the victim. We also propose a flooding front-running attack, which introduces a single-shard flooding attack to enhance the front-running attack. Specifically, injecting a large number of junk transactions into the shard where the victim's transaction is located can significantly extend the execution time of the victim's transaction. We demonstrate the feasibility and practical effects of these two attacks through experiments on RapidChain, which show that a single-shard flooding attack can increase the success rate of a front-running attack by 12%. Finally, we discuss two possible mitigation measures and the cost of two proposed attacks. © 2024 IEEE.

关键词： blockchain flooding attack front-running attack sharding

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization of Semantic Communications for Users with Heterogeneous Knowledge

Performance Optimization of Semantic Communications for User...

引用

IEEE International Conference on Communications (ICC)

作者： Jiantong Zhang Mingzhe Chen Yujiao Zhu H. Shihao Tao Luo Zhilong Zhang Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

In this paper, a semantic communication framework for a scenario where the transmitter and the receiver have different knowledge is proposed. In the proposed framework, the transmitter extracts semantic information from the data according to its knowledge and sends it to the receiver. The receiver requires to process the received semantic information based on its knowledge. Here, the knowledge implies a method which the transmitter or the receiver can use to process the semantic information. Since the transmitter or the receiver have different knowledge, they may have different understandings for the same information. To ensure the receiver can understand the semantic information, the transmitter requires to estimate the receiver's knowledge by asking a series of questions about the transmitted data. By evaluating the difference between the answers of the receiver and the answers of the transmitter, the transmitter can adjust the method of semantic information extraction. Since the size of the extracted semantic information and the number of the questions that the transmitter can ask are limited, the transmitter must adjust the method of semantic information extraction and select appropriate questions to transmit. This problem is formulated as an optimization problem whose goal is to maximize the similarity of answers of the transmitter and the receiver by determining semantic information while minimizing the semantic similarity of answers by determining the questions to be transmitted. To solve this problem, an adversarial reinforcement learning (ARL) algorithm is proposed. The proposed algorithm, which consists of a semantic information RL and a question RL, can find the optimal semantic information generation scheme and question selection scheme by a competitive game between two agents. Simulation results demonstrate that the proposed framework can improve the semantic similarity of answers by up to 3.7% gain and can achieve up to 15.2 % gain in terms of the aver

关键词： Transmitters Simulation Semantics Receivers Games Transforms Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Study on Energy-Saving Optimization and Simulation of Wireless Sensor Networks Using Ant Colony Algorithm 6th

Study on Energy-Saving Optimization and Simulation of Wirele...

引用

6th Euro-China Conference on Intelligent data Analysis and Applications, ECC 2019

作者： Chang, Kuo-Chi Chu, Kai-Chun Lin, Yuh-Chung Nguyen, Trong-The Sung, Tien-Wen Zhou, Yu-Wen Pan, Jeng-Shyang School of Information Science and Engineering Fujian University of Technology Fuzhou China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China Department of Business Management Fujian University of Technology Fuzhou China College of Mechanical and Electrical Engineering National Taipei University of Technology Taipei Taiwan

ISBN: (纸本)9789811650352

The WSN uses wireless communication to realize its information transmission. WSN is a network data system composed of a large number of wireless data collectors with sensing functions. In the WSN-based sensing function structure, the size should be small, more power saving, low price, and can achieve design goals. This study first assumes that WSN uses routing algorithm assumptions in the protocol, and starts from the node position and direction information, and considers the dynamic evolution of the network. Each public node has random mobility, and the WSN node can help determine the location information of the public node, and then use the node location information to have effective routing performance and effective. However, the experimental results also strongly support the energy saving ability of this research. In the overall system energy saving and power consumption reduction, the actual electric energy hazard is greatly reduced, so in the spirit of ISD strategies, if the WSN system is installed in a high-risk and explosive atmosphere, it can significantly improve the safety level. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：