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

2nd International Conference on Computer Science and Educational Informatization, CSEI 2020

作者： Ping, Zhang Fudong, Liu Zheng, Shan State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781728170077

Response to the outbreak of COVID-19, classes in this semester are mainly replaced by online teaching to ensure continual learning. Teachers are actively exploring effective online teaching methods to provide a good learning experience for students at home. This paper presents an online teaching model based on the idea of Problem-Based Learning (PBL) and take 'Data Structure' as an example to discuss the design of teaching process and problems. © 2020 IEEE.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Security-as-a-Service with Cyberspace Mimic Defense Technologies in Cloud 7th

Security-as-a-Service with Cyberspace Mimic Defense Technolo...

引用

7th International Conference of Pioneering Computer Scientists, Engineers and Educators, ICPCSEE 2021

作者： Wang, Junchao Pang, Jianmin Wei, Jin State Key Laboratory of Mathematical Engineering and Advanced Computing ZhengZhou China School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China

ISBN: (纸本)9789811659423

Users usually focus on the application-level requirements which are quite friendly and direct to them. However, there are no existing tools automating the application-level requirements to infrastructure provisioning and application deployment. Although some security issues have been solved during the development phase, the undiscovered vulnerabilities remain hidden threats to the application’s security. Cyberspace mimic defense (CMD) technologies can help to enhance the application’s security despite the existence of the vulnerability. In this paper, the concept of SECurity-as-a-Service (SECaaS) is proposed with CMD technologies in cloud environments. The experiment on it was implemented. It is found that the application’s security is greatly improved to meet the user’s security and performance requirements within budgets through SECaaS. The experimental results show that SECaaS can help the users to focus on application-level requirements (monetary costs, required security level, etc.) and automate the process of application orchestration. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Attention-aligned mean-teacher learning for unsupervised domain adaptive person re-ID

引用

Science China Technological Sciences 2025年

作者： You LYU Zhen ZHANG Guoliang KANG Wei WEI Institute of Artificial Intelligence Beihang University Key Laboratory of Mathematics Informatics Behavioral Semantics Ministry of Education Beihang University State Key Laboratory of Software Development Environment and Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang University School of Automation Science and Electrical Engineering Beihang University AVICAS Generic Technology Co. Ltd Zhongguancun Laboratory School of Mathematics Sciences Beihang University

In recent years, artificial intelligence has fueled the development of numerous applications [1, 2]. Person re-identification (re-ID) is a typical artificial intelligence system designed to automatically retrieve imag...

关键词：

来源：评论

学校读者我要写书评

暂无评论

DQPS: An Intelligent Multi-Hop Computation Offloading Scheme for Workflow Applications in Vehicular Edge computing Networks

引用

IEEE Transactions on Consumer Electronics 2024年第1期71卷 2202-2216页

作者： Lin, Bing Chen, Qiaoxin Chen, Xing Jia, Wen-Kang Lu, Yu Xiong, Neal N. Fujian Normal University College of Physics and Energy Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China Peking University School of Computer Science 100871 China Xiamen University Department of Informatics and Communication Engineering Xiamen361005 China Fuzhou University College of Computer and Data Science Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China Fujian Normal University College of Photonic and Electronic Engineering Fuzhou350117 China Fujian Normal University Concord University College Fuzhou350117 China Sul Ross State University Department of Computer Mathematical and Physical Sciences AlpineTX79830 United States

Vehicular Edge computing (VEC) is a feasible solution for autonomous driving as it can offload latency-sensitive and computation-intensive tasks from vehicle terminals to roadside units (RSUs) for real-time processing. Due to the high computational resource the workflow applications (i.e., autonomous driving) required, the small vehicle-to-RSUs communication range, and the scarce available resources for each vehicle, it might be difficult to accomplish complex workflow applications through the single-hop offloading paradigm in the Internet of Vehicles (IoV). In this paper, we propose a reinforcement learning (RL) based multi-hop computation offloading scheme for workflow applications to reduce their execution latency in the VEC networks, which considers the data dependency in workflow applications as well as the trust relationship and communication interference among RSUs. Firstly, a preprocessing method is employed to merge the cut-edges in a workflow to reduce the offloading scale of tasks and compress the encoding dimension of offloading solutions. Then, a Deep Q-network algorithm using Phase-optimal state update (DQPS) is proposed to update the offloading policy distribution, in which the deviation of the phase-optimal state from the current state is estimated as the reward of RL to promote the algorithm's convergence to adapt the dynamic VEC networks. Simulation results show that DQPS has the best performance compared to other benchmark schemes. Moreover, the latency of the identical applications can be reduced by 2.5%-25.3% through our offloading scheme with a multi-hop model compared to that with the single-hop paradigm in IoV. © 1975-2011 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

An Extraction Method of Network Security Situation Elements Based on Gradient Lifting Decision Tree

An Extraction Method of Network Security Situation Elements ...

引用

advanced computing and Endogenous Security, International Conference on

作者： Zhaorui Ma Shicheng Zhang Yiheng Chang Qinglei Zhou Xinhao Hu Xia Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Zhengzhou University of Light Industry Zhengzhou China

ISBN: (纸本)9781665424509

The primary purpose of acquiring network security situation elements is to detect and discover potential security threats from discrete and isolated data. In the complex network environment, the existing network security situation element acquisition technology has the problems of low extraction accuracy and low extraction efficiency. To solve these problems, a method for extracting network security situation elements based on Gradient Boosting Decision Tree (GBDT) is proposed. This method uses the attribute reduction function of rough set to preprocess the original data, which can effectively reduce redundancy. Furthermore, the initial parameters of GBDT are optimized by quantum particle swarm optimization (QPSO) algorithm to improve stability. Finally, the optimized GBDT classifier is used to classify and train with the reduced data set, and the accuracy of the final classifier is continuously improved by reducing the deviation via iterative optimization. Experiments demonstrate that the proposed algorithm achieves significant results and outperforms several state-of-the-art algorithms to the extraction of network security situation elements on the UNSW-NB15 dataset.

关键词： Termination of employment Rough sets Complex networks Network security Stability analysis Classification algorithms Decision trees

来源：评论

学校读者我要写书评

暂无评论

Street-Level IP Geolocation Algorithm Based on Landmarks Clustering

引用

Computers, Materials & Continua 2021年第3期66卷 3345-3361页

作者： Fan Zhang Fenlin Liu Rui Xu Xiangyang Luo Shichang Ding Hechan Tian PLA Strategic Support Force Information Engineering University Zhengzhou450001China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China Cyberspace Security Key Laboratory of Sichuan Province Chengdu610000China China Electronic Technology Cyber Security Co. Ltd.Chengdu610000China University of Goettingen Goettingen37075Germany

Existing IP geolocation algorithms based on delay similarity often rely on the principle that geographically adjacent IPs have similar ***,this principle is often invalid in real Internet environment,which leads to unreliable geolocation *** improve the accuracy and reliability of locating IP in real Internet,a street-level IP geolocation algorithm based on landmarks clustering is ***,we use the probes to measure the known landmarks to obtain their delay vectors,and cluster landmarks using ***,the landmarks are clustered again by their latitude and longitude,and the intersection of these two clustering results is taken to form training ***,we train multiple neural networks to get the mapping relationship between delay and location in each training ***,we determine one of the neural networks for the target by the delay similarity and relative hop counts,and then geolocate the target by this *** it brings together the delay and geographical coordinates clustering,the proposed algorithm largely improves the inconsistency between them and enhances the mapping relationship between *** evaluate the algorithm by a series of experiments in Hong Kong,Shanghai,Zhengzhou and New *** experimental results show that the proposed algorithm achieves street-level IP geolocation,and comparing with existing typical streetlevel geolocation algorithms,the proposed algorithm improves the geolocation reliability significantly.

关键词： IP geolocation neural network landmarks clustering delay similarity relative hop

来源：评论

学校读者我要写书评

暂无评论

Analysis of Instantaneous Angular Speed Accuracy Considering Encoder Errors

Analysis of Instantaneous Angular Speed Accuracy Considering...

引用

International Conference on Automation and computing (ICAC)

作者： Yuanhao Liu Fengshou Gu Qiang Zeng State Key Laboratory of Mechanical Transmissions for Advanced Equipment Chongqing University Chongqing China School of Computing and Engineering University of Huddersfield Huddersfield UK

ISBN: (数字)9798350360882

ISBN: (纸本)9798350360899

Instantaneous Angular Speed (IAS) is closely related to the dynamic behavior of rotating machinery and plays a crucial role in diagnosing faults. However, the measurement of the IAS is subject to various errors inevitably, which directly affect the accuracy of IAS estimation and diminish the precision of fault diagnosis in rotating machinery. Currently, the estimation of IAS primarily relies on time counting methods, and there has been limited research conducted on the application of Frequency Domain Demodulation (FDD) as an IAS estimation method, despite its potential for providing lower noise levels. The study of IAS errors based on the FFD method has received even less attention. This study undertakes pertinent research and investigates the issue identified. Firstly, it develops a model for IAS estimation using FDD, considering the specific characteristics of the encoder disk signal. Secondly, it establishes IAS models for eccentric and inclined encoder disks, considering the spatial geometric characteristics associated with different types of encoder disk errors. In conclusion, the experimental results successfully validate the accuracy and validity of the proposed theoretical models. This study lays a theoretical foundation for the precise measurement of IAS, thereby enhancing the reliability of using IAS for condition monitoring in rotating machinery.

关键词： Fault diagnosis Accuracy Frequency-domain analysis Measurement uncertainty Estimation Machining Reliability theory Machinery Rotation measurement Noise level

来源：评论

学校读者我要写书评

暂无评论

Self-Dual Hadamard Bent Sequences

引用

Journal of Systems Science & Complexity 2023年第2期36卷 894-908页

作者： SHI Minjia LI Yaya CHENG Wei CRNKOVIC Dean KROTOV Denis SOLéPatrick Key Laboratory of Intelligent Computing Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security(Institute of Information Engineering) Chinese Academy of SciencesBeijing 100093China. LTCI Télécom ParisParis91120 PalaiseauFrance Secure-IC S.A.S. 104 Bd du Montparnasse75014 Paris Faculty of Mathematics University of RijekaNovosibirsk 630090Russia Sobolev Institute of Mathematics Novosibirsk 630090Russia Aix Marseille Univ CNRSCentrale MarseilleI2MMarseilleFrance

A new notion of bent sequence related to Hadamard matrices was introduced recently,motivated by a security application(Solé,et al.,2021).The authors study the self-dual class in length at most *** authors use three competing methods of generation:Exhaustion,Linear Algebra and Gr?bner *** Hadamard matrices and Bush-type Hadamard matrices provide many *** authors conjecture that if v is an even perfect square,a self-dual bent sequence of length v always *** authors introduce the strong automorphism group of Hadamard matrices,which acts on their associated self-dual bent *** authors give an efficient algorithm to compute that group.

关键词： Bent sequences bush-type Hadamard matrices Hadanard matrices PUF functions regular Hadamard matrices

来源：评论

学校读者我要写书评

暂无评论

Simulation detection based on single photon quantum key distribution protocol

Simulation detection based on single photon quantum key dist...

引用

2020 International Conference on Electronics, Communications and Information Technology, CECIT 2020

作者： Liu, X.N. Hu, C.C. Yin, M.J. Jin, L. School of Information Engineering Zhengzhou University Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China School of Cyberspace and Security Information Engineering University Zhengzhou China

With the continuous development of quantum communication in recent years, quantum key distribution (QKD) has also become a key technology in the field of quantum communication. Due to the limitation of physical resources and experimental conditions, the effectiveness of different communication protocols cannot be accurately analyzed. To solve this problem, a protocol simulation method is proposed, BB84 and B92 protocols are simulated and analyzed on a classic computer by this method. On the Eclipse IDE Developers platform, the simulation program of the quantum communication protocol was written using Java language, the simulation process under the ideal environment and the eavesdropping environment was analyzed with emphasis. The simulation results show that the key distribution efficiency of BB84 is about 50% without eavesdroppers, which is much higher than 25% of B92, and the key distribution efficiency under eavesdropping conditions is about 25% and 18%. The experimental results are consistent with theoretical expectations, verifying the correctness of the protocol simulation, and also proving the feasibility of using computers for quantum communication protocol simulation. © Published under licence by IOP Publishing Ltd.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Proximal Inexact Gradient Framework and Its Application to Per-Antenna Constrained Joint Beamforming and Compression Design

arXiv

引用

arXiv 2025年

作者： Fan, Xilai Jiang, Bo Liu, Ya-Feng 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 Ministry of Education Key Laboratory of NSLSCS School of Mathematical Sciences Nanjing Normal University Nanjing210023 China

In this paper, we propose an adaptive proximal inexact gradient (APIG) framework for solving a class of nonsmooth composite optimization problems involving function and gradient errors. Unlike existing inexact proximal gradient methods, the proposed framework introduces a new line search condition that jointly adapts to function and gradient errors, enabling adaptive stepsize selection while maintaining theoretical guarantees. Specifically, we prove that the proposed framework achieves an ϵ-stationary point within O(ϵ−2) iterations for nonconvex objectives and an ϵ-optimal solution within O(ϵ−1) iterations for convex cases, matching the best-known complexity in this context. We then custom-apply the APIG framework to an important signal processing problem: the joint beamforming and compression problem (JBCP) with per-antenna power constraints (PAPCs) in cooperative cellular networks. This customized application requires careful exploitation of the problem’s special structure such as the tightness of the semidefinite relaxation (SDR) and the differentiability of the dual. Numerical experiments demonstrate the superior performance of our custom-application over state-of-the-art benchmarks for the JBCP. © 2025, CC BY.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：