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

Enhancing wircless channel authentication in industrial control: Attack-resistant CSI-based PUF

Ad Hoc networks 2025年 178卷

作者： Yubo Song Wenchang Liu Hongyu Zhu Yi Gong Yang Li Jiyuan Huang Yazhi Deng Key Laboratory of Computer Network Technology of Jiangsu Province School of Cyber Science and Engineering Southeast University No. 2 Southeast University Road Jiangning District Nanjing 211151 Jiangsu China Purple Mountain Laboratories No. 9 Mozhou east road Jiangning District Nanjing 211151 Jiangsu China Hunan Key Laboratory for Internet of Things in Electricity No. 398 Xin Shaodong Road Tianxin District Changsha 410002 Hunan China State Grid Hunan Electric Power Company Limited Information and Communication Company No. 398 Xin Shaodong Road Tianxin District Changsha 410002 Hunan China State Grid Hunan Electric Power Co. Ltd. No. 398 Xin Shaodong Road Tianxin District Changsha 410002 Hunan China

The extensive deployment of wireless networks in industrial settings has led to a surge in wireless-connected devices, presenting formidable security challenges. Traditional encryption approaches, relying on cryptographic keys without binding to physical hardware details, are highly susceptible to cloning attacks when the keys are compromised. This paper presents a novel solution: a Channel State information-based Physical Unclonable Function (CSI-PUF) for wireless devices. By leveraging CSI, it generates a unique device identity. A meticulously designed fuzzy extractor algorithm is incorporated. In the enrollment phase, random numbers are generated and encoded with BCH error correction codes. During the reconstruction phase, errors in the CSI-PUF output bit sequence are transferred to the BCH-encoded random numbers. This allows for error elimination through decoding, safeguarding the confidentiality of CSI. A prototype WiFi terminal authentication system based on this CSI-PUF framework is developed and implemented. Experimental evaluations in an interference-free industrial control environment reveal that the system attains an average authentication success rate exceeding 95%. This significantly bolsters the security of WiFi-enabled devices, indicating that the CSI-PUF can effectively enhance the authentication security of wireless devices in industrial scenarios.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Deep octonion networks

arXiv

引用

arXiv 2019年

作者： Wu, Jiasong Xu, Ling Kong, Youyong Senhadji, Lotfi Shu, Huazhong Laboratory of Image Science and Technology Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing210096 China INSERM U1099 RennesF-35000 France Université de Rennes 1 LTSI RennesF-35042 France

Deep learning is a research hot topic in the field of machine learning. Real-value neural networks (Real NNs), especially deep real networks (DRNs), have been widely used in many research fields. In recent years, the deep complex networks (DCNs) and the deep quaternion networks (DQNs) have attracted more and more attentions. The octonion algebra, which is an extension of complex algebra and quaternion algebra, can provide more efficient and compact expression. This paper constructs a general framework of deep octonion networks (DONs) and provides the main building blocks of DONs such as octonion convolution, octonion batch normalization and octonion weight initialization;DONs are then used in image classification tasks for CIFAR-10 and CIFAR-100 data sets. Compared with the DRNs, the DCNs, and the DQNs, the proposed DONs have better convergence and higher classification accuracy. The success of DONs is also explained by multi-task learning. Copyright © 2019, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Delay Optimization Based on Improved Differential Evolutionary Algorithm for Task Offloading in Fog Computing networks

Delay Optimization Based on Improved Differential Evolutiona...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Xujie Li Guangzhao Zhang Xuedong Zheng Siyang Hua College of Computer and Information Hohai University Nanjing China National Mobile Communications Research Laboratory Southeast University Nanjing China Key Lab for Wireless Sensor network and Communication Chinese Academy of Sciences Shanghai China Nanjing China-Spacenet Satellite Telecom Co. Ltd Nanjing China Talent Science and Technology Co. Ltd Nanjing China

ISBN: (数字)9781728172361

ISBN: (纸本)9781728172378

With the rapid development of communication technology, more and more devices tend to be intelligent. Intelligent devices with computing functions can provide computing services to reduce total task completion time in fog computing networks. This paper aims at minimizing the total task completion time to study multi-user multi-node multi-task offloading problem. Firstly, the task offloading process of task node and fog node is modeled. Then, the system function of the total task completion time is constructed and an optimization problem with constraints is generated. The problem is NP-hard and difficult to be solved by traditional methods. Finally, the improved differential evolution (IDE) algorithm is used to solve the task offloading problem. Simulation results show that it has better performance and can significantly shorten the total task completion time compared with other algorithms.

关键词： Task analysis Delays Computational modeling Edge computing Optimization Signal to noise ratio Wireless communication

来源：评论

学校读者我要写书评

暂无评论

A Construction of Quantum Error-Locating Codes

引用

Communications in Theoretical Physics 2017年第1期67卷 37-40页

作者：樊继豪陈汉武 School of Computer Science and Engineering Southeast UniversityNanjing 211189China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing 211189China

We present the construction of quantum error-locating(QEL) codes based on classical error-locating(EL)codes. Similar to classical EL codes, QEL codes lie midway between quantum error-correcting codes and quantum errordetecting codes. Then QEL codes can locate qubit errors within one sub-block of the received qubit symbols but do not need to determine the exact locations of the erroneous qubits. We show that, an e-error-locating code derived from an arbitrary binary cyclic code with generator polynomial g(x), can lead to a QEL code with e error-locating abilities, only if g(x) does not contain the(1 + x)-factor.

关键词： quantum error-correcting code error-locating code cyclic code

来源：评论

学校读者我要写书评

暂无评论

Measuring web page complexity by analyzing TCP flows and HTTP headers

引用

The Journal of China Universities of Posts and Telecommunications 2017年第6期24卷 1-13页

作者： Cheng Weiqing Hu Yangyang Yin Qiaofeng Chen Jiajia School of Computer Science Nanjing University of Posts and Telecommunications Key Laboratory of Computer Network and Information Integration Southeast University Jiangsu Education Information Center Jiangsu Provincial Department of Education

To understand website complexity deeply, a web page complexity measurement system is developed. The system measures the complexity of a web page at two levels： transport-level and content-level, using a packet trace-based approach rather than server or client logs. Packet traces surpass others in the amount of information contained. Quantitative analyses show that different categories of web pages have different complexity characteristics. Experimental results show that a news web page usually loads much more elements at more accessing levels from much more web servers within diverse administrative domains over much more concurrent transmission control protocol （TCP） flows. About more than half of education pages each only involve a few logical servers, where most of elements of a web page are fetched only from one or two logical servers. The number of content types for web game traffic after login is usually least. The system can help web page designers to design more efficient web pages, and help researchers or Internet users to know communication details.

关键词： hyper text transfer protocol concurrent TCP flows world wide web web page complexity

来源：评论

学校读者我要写书评

暂无评论

Overview of the CCKS 2019 knowledge graph evaluation track: Entity, relation, event and QA

arXiv

引用

arXiv 2020年

作者： Han, Xianpei Wang, Zhichun Zhang, Jiangtao Wen, Qinghua Li, Wenqi Tang, Buzhou Wang, Qi Feng, Zhifan Zhang, Yang Lu, Yajuan Wang, Haitao Chen, Wenliang Shao, Hao Chen, Yubo Liu, Kang Zhao, Jun Wang, Taifeng Zhang, Kezun Wang, Meng Jiang, Yinlin Qi, Guilin Zou, Lei Hu, Sen Zhang, Minhao Lin, Yinnian Chinese Information Processing Laboratory Institute of Software Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence Beijing Normal University Beijing100875 China 305 Hospital of People’s Liberation Army Beijing100017 China Department of Computer Science and Technology Tsinghua University Beijing100084 China Yidu Cloud Beijing100000 China Harbin Institute of Technology Shenzhen Guangdong518055 China Baidu Beijing100193 China School of Computer Science & Technology Soochow University Suzhou Jiangsu215006 China Gowild Suzhou Jiangsu215002 China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Ant Financial Hangzhou Zhejiang310000 China School of Computer Science and Engineering Southeast University Nanjing Jiangsu211189 China Key Laboratory of Computer Network Information Integration Southeast University Nanjing Jiangsu211189 China Peking University Beijing100871 China

Knowledge graph models world knowledge as concepts, entities, and the relationships between them, which has been widely used in many real-world tasks. CCKS 2019 held an evaluation track with 6 tasks and attracted more than 1,600 teams. In this paper we give an overview of the knowledge graph evaluation tract at CCKS 2019. By reviewing the task definition, successful methods, useful resources, good strategies and research challenges associated with each task in CCKS 2019, this paper can provide a helpful reference for developing knowledge graph applications and conducting future knowledge graph researches. Copyright © 2020, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

偏标记学习的研究

偏标记学习的研究

引用

第六届演化计算与学习研讨会(ECOLE)

作者：张敏灵 School of Computer Science and Engineering MOE Key Lab.of Computer Network & Information Integration Southeast UniversityChina

Traditional Supervised Learning Cnput Space represented by a single instance(feature vector characterizing its properties Dutput Space associated with a single label characterizing its *** Assumption:Strong Supervision label supervision information key factor tor successful learning(encoding semantics and regularities for the learning problen Strong supervision assumption Sufficient labeling abundant labeled training data are available Explicit labeling object labeling is unique and unambiguous.

关键词：偏标记学习流程设计计算性能

来源：评论

学校读者我要写书评

暂无评论

Enhancing Interest Forwarding for Fast Recovery from Unanticipated Data Access Failure in NDN

Enhancing Interest Forwarding for Fast Recovery from Unantic...

引用

2018中国信息通信大会(CICC2018)

作者： Xiaoyan Hu Xuhui Liu Lixia Zhao Shaoqi Zheng Jian Gong Guang Cheng Hua Wu School of Cyber Science ＆ Engineering Southeast University School of Computer Science ＆ Engineering Southeast University Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University

We show that an aggregated Interest in Named Data networking（NDN）may fail to retrieve desired data since the Interest previously sent upstream for the same content is judged as a duplicate one and then dropped by an upstream node due to its multipath ***,we propose NDRUDAF,a NACK based mechanism that enhances the Interest forwarding and enables Detection and fast Recovery from such Unanticipated Data Access *** the NDN enhanced NDRUDAF,the router that aggregates the Interests detects such unanticipated data access failure based on a negative acknowledgement from the upstream node that judges the Interest as a duplicate *** the router retransmits the Interest as soon as possible on behalf of the requester whose Interest is aggregated to fast recover from the data access *** qualitatively and quantitatively analyze the performance of the NDN enhanced with our proposed NDRUDAF and compare it with that of the present *** experimental results validate that NDRUDAF improves the system performance in case of such unanticipated data access failure in terms of data access delay and network resource utilization efficiency at routers.

关键词： Named data networking Interest aggregation mul-tipath forwarding data access failure negative acknowledgement

来源：评论

学校读者我要写书评

暂无评论

A Metaheuristic for No-wait Flowshops with Variable Processing Times

A Metaheuristic for No-wait Flowshops with Variable Processi...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yi Xu Xiaoping Li Chaomin Shi Mingyu Cui Xincheng Cao Yanyan Ge School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China

No-wait flowshop scheduling problems are widespread in industries. Though processing times of jobs are traditionally assumed to be constant, they are variable because of learning and deteriorating effects in practical manufacturing processes which make the problems much more difficult. In this paper, we propose a metaheuristic, self-adaptive memetic algorithm (SAMA for short), for no-wait flowshops with variable processing times which have never been considered yet. The balance between intensification and diversification of the algorithm is adaptively controlled by evolutionary operators. Local search is performed on better individuals with higher probabilities to dynamically adjust diversification. Experimental results show that the proposed SAMA outperforms existing algorithms for similar problems.

关键词： Sociology Statistics Memetics Genetic algorithms Job shop scheduling Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Precise slicing of interprocedural concurrent programs

引用

Frontiers of computer Science 2017年第6期11卷 971-986页

作者： Xiaofang QI Zhenliang JIANG School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing 211189 China China Huawei Technologies Co. Ltd Nanjing 210012 China

Program slicing is an effective technique for an- alyzing concurrent programs. However, when a conventional closure-based slicing algorithm for sequential programs is ap- plied to a concurrent interprocedural program, the slice is usually imprecise owing to the intransitivity of interference dependence. Interference dependence arises when a state- ment uses a variable defined in another statement executed concurrently. In this study, we propose a global dependence analysis approach based on a program reachability graph, and construct a novel dependence graph called marking-statement dependence graph （MSDG）, in which each vertex is a 2-tuple of program state and statement. In contrast to the conven- tional program dependence graph where the vertex is a state- ment, the dependence relation in MSDG is transitive. When traversing MSDG, a precise slice will be obtained. To en- hance the slicing efficiency without loss of precision, our slic- ing algorithm adopts a hybrid strategy. The procedures con- taining interaction statements between threads are inlined and sliced by the slicing algorithm based on program reachability graphs while allowing other procedures to be sliced as se- quential programs. We have implemented our algorithm and three other representative slicing algorithms, and conducted an empirical study on concurrent Java programs. The exper- imental results show that our algorithm computes more pre- cise slices than the other algorithms. Using partial-order re- duction techniques, which are effective for reducing the size of a program reachability graph without loss of precision, ouralgorithm is optimized, thereby improving its performance to some extent.

关键词： program slicing concurrent programs reacha-bility analysis context sensitivity dependence analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：