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

A Review of Intelligent Configuration and Its Security for Complex Networks

Chinese Journal of Electronics 2024年第4期33卷 920-947页

作者： Yue ZHAO Bin YANG Fei TENG Xianhua NIU Ning HU Bo TIAN Science and Technology on Communication Security Laboratory School of Computer and Information Engineering Chuzhou University School of Computing and Artificial Intelligence Southwest Jiaotong University School of Computer and Software Engineering Xihua University Cyberspace Institute of Advanced Technology Guangzhou University

Complex networks are becoming more complex because of the use of many components with diverse technologies. In fact, manual configuration that makes each component interoperable has breed latent danger to system security. There is still no comprehensive review of these studies and prospects for further research. According to the complexity of component configuration and difficulty of security assurance in typical complex networks, this paper systematically reviews the abstract models and formal analysis methods required for intelligent configuration of complex networks, specifically analyzes, and compares the current key technologies such as configuration semantic awareness, automatic generation of security configuration, dynamic deployment, and verification evaluation. These technologies can effectively improve the security of complex networks intelligent configuration and reduce the complexity of operation and maintenance. This paper also summarizes the mainstream construction methods of complex networks configuration and its security test environment and detection index system, which lays a theoretical foundation for the formation of the comprehensive effectiveness verification capability of configuration security. The whole lifecycle management system of configuration security process proposed in this paper provides an important technical reference for reducing the complexity of network operation and maintenance and improving network security.

关键词： Complex networks Intelligent configuration Configuration security Software defined network Lifecycle management

来源：评论

学校读者我要写书评

暂无评论

Constraints Separation Based Evolutionary Multitasking for Constrained Multi-Objective Optimization Problems

引用

IEEE/CAA Journal of Automatica Sinica 2024年第8期11卷 1819-1835页

作者： Kangjia Qiao Jing Liang Kunjie Yu Xuanxuan Ban Caitong Yue Boyang Qu Ponnuthurai Nagaratnam Suganthan School of Electrical and Information Engineering Zhengzhou UniversityZhengzhou 450001China School of Electrical Engineering and Automation Henan Institute of TechnologyXinxiang 453003China School of Electronic and Information Zhongyuan University of TechnologyZhengzhou 450007China KINDI Center for Computing Research College of EngineeringQatar UniversityDoha 999043Qatar

Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for *** all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto ***,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single ***,this paper attempts to identify promising single constraints and utilize them to help solve *** be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint ***,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance ***,an improved tentative method is designed to find and transfer useful knowledge among *** results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.

关键词： Constrained multi-objective optimization(CMOPs) evolutionary multitasking knowledge transfer single constraint.

来源：评论

学校读者我要写书评

暂无评论

Media Power Measuring via Emotional Contagion

引用

Journal of Social computing 2024年第1期5卷 15-35页

作者： Xue Lin Hong Huang Zongya Li Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China School of Journalism Huazhong University of Science and TechnologyWuhan 430074China

Media power,the impact that media have on public opinion and perspectives,plays a significant role in maintaining internal stability,exerting external influence,and shaping international dynamics for nations/***,prior research has primarily concentrated on news content and reporting time,resulting in limitations in evaluating media *** more accurately assess media power,we use news content,news reporting time,and news emotion simultaneously to explore the emotional contagion between *** use emotional contagion to measure the mutual influence between media and regard the media with greater impact as having stronger media *** propose a framework called Measuring Media Power via Emotional Contagion(MMPEC)to capture emotional contagion among media,enabling a more accurate assessment of media power at the media and national/regional *** also interprets experimental results through correlation and causality analyses,ensuring *** analyses confirm the higher accuracy of MMPEC compared to other baseline models,as demonstrated in the context of COVID-19-related news,yielding compelling and interesting insights.

关键词： explainability media power emotional contagion

来源：评论

学校读者我要写书评

暂无评论

SGGAA: a robust adversarial generation based on synthesizing point cloud and mesh space

引用

Neural computing and Applications 2025年 1-23页

作者： Hu, Ruihan Yang, Rui Faculty of Computing Harbin Institute of Technology Harbin China School of Electrical and Information Engineering Tianjin University Tianjin China

3D vision recognition offers a significantly more robust tool for achieving machine cognition compared to traditional 2D vision techniques. However, similar to the vulnerabilities present in 2D vision, many 3D vision recognition applications, including point cloud classification models, are susceptible to degradation when confronted with imperceptible outliers. Outliers have a considerable impact on the performance and accuracy of models, compromising their overall effectiveness. Existing 3D point cloud attack and defense strategies neglect outliers and overlook the crucial impact of 3D printability in real-world scenarios. Neglecting this aspect hinders the consideration of potential manipulation or alteration of 3D objects in the physical realm, posing significant implications for the security and robustness of 3D vision systems. This manuscript presents a novel and effective targeted attack framework called synthesizing geometry and geodesic attack (SGGAA). It offers an alternative adversarial training algorithm that bridges the gap between the digital and physical domains. SGGAA introduces a novel generalized distance metric, facilitating the design of powerful and simple techniques for generating adversarial samples and improving the training process. It focuses on the regularizer loss object in synthesizing attack modes for mesh and point cloud spaces, utilizing Hausdorff distance, geometry distance, and geodesic distance losses. Comprehensive evaluations, including hyperparameter tuning, qualitative analysis, and quantitative experiments, were conducted to assess SGGAA’s performance. The results demonstrated its superiority, with high attack success rates, excellent geometric similarity scores, and outperformance of state-of-the-art attack strategies across various 3D defense techniques. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Efficient Penetration Testing Path Planning Based on Reinforcement Learning with Episodic Memory

引用

Computer Modeling in engineering & Sciences 2024年第9期140卷 2613-2634页

作者： Ziqiao Zhou Tianyang Zhou Jinghao Xu Junhu Zhu Henan Key Laboratory of Information Security National Engineering Technology Research Center of the Digital Switching SystemZhengzhou450000China School of Cryptographic Engineering Information Engineering UniversityZhengzhou450000China

Intelligent penetration testing is of great significance for the improvement of the security of information systems,and the critical issue is the planning of penetration test *** view of the difficulty for attackers to obtain complete network information in realistic network scenarios,Reinforcement Learning(RL)is a promising solution to discover the optimal penetration path under incomplete information about the target *** RL-based methods are challenged by the sizeable discrete action space,which leads to difficulties in the ***,most methods still rely on experts’*** address these issues,this paper proposes a penetration path planning method based on reinforcement learning with episodic ***,the penetration testing problem is formally described in terms of reinforcement *** speed up the training process without specific prior knowledge,the proposed algorithm introduces episodic memory to store experienced advantageous strategies for the first ***,the method offers an exploration strategy based on episodic memory to guide the agents in *** design makes full use of historical experience to achieve the purpose of reducing blind exploration and improving planning ***,comparison experiments are carried out with the existing RL-based *** results reveal that the proposed method has better convergence *** running time is reduced by more than 20%.

关键词： Intelligent penetration testing penetration testing path planning reinforcement learning episodic memory exploration strategy

来源：评论

学校读者我要写书评

暂无评论

Improved Double Deep Q Network-Based Task Scheduling Algorithm in Edge computing for Makespan Optimization

引用

Tsinghua Science and technology 2024年第3期29卷 806-817页

作者： Lei Zeng Qi Liu Shigen Shen Xiaodong Liu School of Computer Science Nanjing University of Information Science and TechnologyNanjing 210044China School of Software Nanjing University of Information Science and TechnologyNanjing 210044China School of Information Engineering Huzhou UniversityHuzhou 313000China School of Computing Edinburgh Napier UniversityEdinburghEH105DTUK

Edge computing nodes undertake an increasing number of tasks with the rise of business ***,how to efficiently allocate large-scale and dynamic workloads to edge computing resources has become a critical *** study proposes an edge task scheduling approach based on an improved Double Deep Q Network(DQN),which is adopted to separate the calculations of target Q values and the selection of the action in two networks.A new reward function is designed,and a control unit is added to the experience replay unit of the *** management of experience data are also modified to fully utilize its value and improve learning *** learning agents usually learn from an ignorant state,which is *** such,this study proposes a novel particle swarm optimization algorithm with an improved fitness function,which can generate optimal solutions for task *** optimized solutions are provided for the agent to pre-train network parameters to obtain a better cognition *** proposed algorithm is compared with six other methods in simulation *** show that the proposed algorithm outperforms other benchmark methods regarding makespan.

关键词： edge computing task scheduling reinforcement learning makespan Double Deep Q Network(DQN)

来源：评论

学校读者我要写书评

暂无评论

Precise trajectory tracking of mecanum-wheeled omnidirectional mobile robots via a novel fixed-time sliding mode control approach

引用

Control Theory and technology 2024年第4期22卷 596-611页

作者： Zhe Sun Zhipeng Li Hao Xie Yunjun Zheng Jinchuan Zheng Bo Chen College of Information Engineering Zhejiang University of TechnologyHangzhou310023China School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyHawthorn3122VICAustralia School of Mechanical Engineering Hefei University of TechnologyHefei230009AnhuiChina

This paper proposes a novel fixed-time sliding mode control approach for trajectory-tracking tasks of a mecanum-wheeled omnidirectional mobile ***,the idea of two-phase attractors is introduced into the domain of sliding mode control,and a new fixed-time sliding surface is ***,according to this sliding surface,a new type of nonsingular fast terminal sliding mode control algorithm is designed for the omnidirectional mobile robot,which can realize a fast fixed-time convergence *** stability of the control system is proven scrupulously,and a guideline for control-parameter tuning is ***,experiments are implemented to test the trajectory-tracking performance of the *** results demonstrate the superiority of the proposed sliding surface and the corresponding control scheme in comparison with benchmark controllers.

关键词： Omnidirectional mobile robot Trajectory tracking Sliding mode control Fixed-time convergence

来源：评论

学校读者我要写书评

暂无评论

NeurDB: an AI-powered autonomous data system

引用

Science China(information Sciences) 2024年第10期67卷 129-150页

作者： Beng Chin OOI Shaofeng CAI Gang CHEN Yanyan SHEN Kian-Lee TAN Yuncheng WU Xiaokui XIAO Naili XING Cong YUE Lingze ZENG Meihui ZHANG Zhanhao ZHAO School of Computing National University of Singapore College of Computer Science and Technology Zhejiang University Department of Computer Science and Engineering Shanghai Jiao Tong University School of Information Renmin University of China School of Computer Science and Technology Beijing Institute of Technology

In the wake of rapid advancements in artificial intelligence(AI), we stand on the brink of a transformative leap in data systems. The imminent fusion of AI and DB(AI×DB) promises a new generation of data systems, which will relieve the burden on end-users across all industry sectors by featuring AI-enhanced functionalities, such as personalized and automated in-database AI-powered analytics, and selfdriving capabilities for improved system performance. In this paper, we explore the evolution of data systems with a focus on deepening the fusion of AI and DB. We present NeurDB, an AI-powered autonomous data system designed to fully embrace AI design in each major system component and provide in-database AI-powered analytics. We outline the conceptual and architectural overview of NeurDB, discuss its design choices and key components, and report its current development and future plan.

关键词： AI$\times$DB in-database AI intelligent data system

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

Research and application of composite stochastic resonance in enhancement detection

引用

Chinese Physics B 2024年第1期33卷 264-273页

作者：高蕊焦尚彬薛琼婕 School of Automation and Information Engineering Xi'an University of TechnologyXi'an 710048China School of Electronic and Electrical Engineering Baoji University of Arts and SciencesBaoji 721016China Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of TechnologyXi'an 710048China

Aiming at the problem that the intermediate potential part of the traditional bistable stochastic resonance model cannot be adjusted independently, a new composite stochastic resonance(NCSR) model is proposed by combining the Woods–Saxon(WS) model and the improved piecewise bistable model. The model retains the characteristics of the independent parameters of WS model and the improved piecewise model has no output saturation, all the parameters in the new model have no coupling characteristics. Under α stable noise environment, the new model is used to detect periodic signal and aperiodic signal, the detection results indicate that the new model has higher noise utilization and better detection ***, the new model is applied to image denoising, the results showed that under the same conditions, the output peak signal-to-noise ratio(PSNR) and the correlation number of NCSR method is higher than that of other commonly used linear denoising methods and improved piecewise SR methods, the effectiveness of the new model is verified.

关键词： Woods–Saxon improved piecewise model composite stochastic resonance(SR) image denoising

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：