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

Cooperative differential games guidance laws for multiple attackers against an active defense target

Chinese Journal of Aeronautics 2022年第5期35卷 374-389页

作者： Fei LIU Xiwang DONG Qingdong LI Zhang REN School of Automation Science and Electrical Engineering Science and Technology on Aircraft Control LaboratoryBeihang UniversityBeijing 100083China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang UniversityBeijing 100083China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of ChinaChongqing UniversityChongqing 400044China

This paper is concerned with a scenario of multiple attackers trying to intercept a target with active *** types of agents are considered in the guidance:The multiple attackers,the target and the defender,where the attackers aim to pursuit the target from different directions and evade from the defender *** guidance engagement is formulated in the framework of a zero-sum two-person differential game between the two opposing teams,such that the measurements on the maneuver of the target or estimations on the defending strategy of the defender can be *** of the attackers resides in two aspects:redundant interception under the threat of the defender and the relative intercept geometry with the *** miss distances,the relative intercept angle errors and the costs of the agents are combined into a single performance index of the *** formulation enables a unitary approach to the design of guidance laws for the *** minimize the control efforts and miss distances for the attackers,an optimization method is proposed to find the best anticipated miss distances to the defender under the constraint that the defender is endowed with a capture *** simulations with two cases are conducted to illustrate the effectiveness of the proposed cooperative guidance law.

关键词： Active defense Cooperative guidance Differential games Minimum effort optimization Relative intercept angle

来源：评论

学校读者我要写书评

暂无评论

Large Model for Small data: Foundation Model for Cross-Modal RF Human Activity Recognition 24

Large Model for Small Data: Foundation Model for Cross-Modal...

引用

22nd ACM Conference on Embedded Networked Sensor Systems, SenSys 2024

作者： Weng, Yuxuan Wu, Guoquan Zheng, Tianyue Yang, Yanbing Luo, Jun Department of Computer Science and Engineering Southern University of Science and Technology China Smart City Center Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology China College of Computer Science Sichuan University China College of Computing and Data Science Nanyang Technological University Singapore Singapore

ISBN: (纸本)9798400706974

Radio-Frequency (RF)-based Human Activity Recognition (HAR) rises as a promising solution for applications unamenable to techniques requiring computer visions. However, the scarcity of labeled RF data due to their non-interpretable nature poses a significant obstacle. Thanks to the recent breakthrough of foundation models (FMs), extracting deep semantic insights from unlabeled visual data become viable, yet these vision-based FMs fall short when applied to small RF datasets. To bridge this gap, we introduce FM-Fi, an innovative cross-modal framework engineered to translate the knowledge of vision-based FMs for enhancing RF-based HAR systems. FM-Fi involves a novel cross-modal contrastive knowledge distillation mechanism, enabling an RF encoder to inherit the interpretative power of FMs for achieving zero-shot learning. It also employs the intrinsic capabilities of FM and RF to remove extraneous features for better alignment between the two modalities. The framework is further refined through metric-based few-shot learning techniques, aiming to boost the performance for predefined HAR tasks. Comprehensive evaluations evidently indicate that FM-Fi rivals the effectiveness of vision-based methodologies, and the evaluation results provide empirical validation of FM-Fi's generalizability across various environments. © 2024 Copyright is held by the owner/author(s).

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

MODFuzz: A Multi-Objective Directed Fuzzer for USB Drivers

引用

IEEE Internet of Things Journal 2025年第12期12卷 21364-21378页

作者： Zhou, Yilin Peng, Guojun Wang, Xingliang Wang, Chenyang Li, Zichuan Liu, Side Wang, Yanhao Yang, Xiuzhang Fu, Jianming Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Indiana University Bloomington BloomingtonIN United States Nio Inc Beijing China Guizhou University Guizhou Big Data Academy Guiyang China

USB interfaces have become ubiquitous in various Internet of Things (IoT) devices, all adhering to the same USB protocol. While enhancing convenience, they also widen the potential attack surface. Fuzzing is a proactive way to identify potential security threats for USB drivers. However, existing USB driver fuzzers primarily prioritize the code coverage of USB drivers, leading to a significant waste of computational resources on irrelevant code segments. To this end, we combine directed fuzzing and USB driver fuzzing for the first time, and present MODFuzz, a pioneering multi-objective directed fuzzing method for USB drivers. MODFuzz autonomously locates the most vulnerable parts within USB drivers, concentrating fuzzing efforts on these areas. Diverging from the existing directed fuzzers, MODFuzz employs a dynamic direction instead of predetermined addresses to guide the fuzzing campaign toward the triggered execution traces with a greater probability of containing vulnerabilities. MODFuzz outperforms the strong baseline in terms of execution speed (about 14% improvement) and crash generation capabilities (about 69% improvement). Meanwhile, we found six previously unknown bugs (all confirmed and assigned vulnerability IDs) in Linux kernel v6.4.10 and received acknowledgment from Red Hat. © 2025 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret 41

Provably Efficient Exploration in Quantum Reinforcement Lear...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Zhong, Han Hu, Jiachen Xue, Yecheng Li, Tongyang Wang, Liwei Center for Data Science Peking University China School of Computer Science Peking University China Center on Frontiers of Computing Studies Peking University China National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University China

While quantum reinforcement learning (RL) has attracted a surge of attention recently, its theoretical understanding is *** particular, it remains elusive how to design provably efficient quantum RL algorithms that can address the exploration-exploitation *** this end, we propose a novel UCRL-style algorithm that takes advantage of quantum computing for tabular Markov decision processes (MDPs) with S states, A actions, and horizon H, and establish an O(poly(S, A, H, log T)) worst-case regret for it, where T is the number of ***, we extend our results to quantum RL with linear function approximation, which is capable of handling problems with large state ***, we develop a quantum algorithm based on value target regression (VTR) for linear mixture MDPs with d-dimensional linear representation and prove that it enjoys O(poly(d, H, log T)) *** algorithms are variants of UCRL/UCRL-VTR algorithms in classical RL, which also leverage a novel combination of lazy updating mechanisms and quantum estimation *** is the key to breaking the Ω(√T)-regret barrier in classical *** the best of our knowledge, this is the first work studying the online exploration in quantum RL with provable logarithmic worst-case regret. Copyright 2024 by the author(s)

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

A nearly optimal distributed algorithm for computing the weighted girth

引用

science China(Information sciences) 2021年第11期64卷 80-94页

作者： Qiang-Sheng HUA Lixiang QIAN Dongxiao YU Xuanhua SHI Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology School of Computer Science and Technology Shandong University

computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle,is an important problem in network analysis. The problem for distributively computing girth in unweighted graphs has garnered lots of attention, but there are few studies in weighted graphs. In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, nc], where n is the number of vertices and c is a constant. The algorithm is devised under the standard synchronous CON GE S T model, which limits each vertex can only transfer O（log n） bits information along each incident edge in a round. The upper bound of the algorithm is O（n log2n） rounds. We also prove the lower bound for computing the weighted girth is ?（D + n/log n） where D is the hop diameter of the weighted graph. This means our distributed algorithm is optimal within a factor of O（log3n）.

关键词： distributed algorithms weighted girth $\mathcal{CONGEST}$ model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

DeepRisk:A deep learning approach for genome-wide assessment of common disease risk

引用

Fundamental Research 2024年第4期4卷 752-760页

作者： Jiajie Peng Zhijie Bao Jingyi Lia Ruijiang Han Yuxian Wang Lu Han Jinghao Peng Tao Wang Jianye Hao Zhongyu Wei Xuequn Shang AI for Science Interdisciplinary Research Center Schoolof Computer ScienceNorthwestern Polyechnical UniversityXi'an 129China Key Laboratoryof Bg Data Sorage and Management Northwestern Polytechnical UniversityMinisty of Industy and Information TechnologyX'an 129Chin College of Intelligence and Computing Tianjin UniversityTianjin 300072China School of Data Science Fudan UniversityShanghai 200433China Research and Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen 518000China

The potential for being able to identify individuals at high disease risk solely based on genotype data has garnered significant *** widely applied,traditional polygenic risk scoring methods fall short,as they are built on additive models that fail to capture the intricate associations among single nucleotide polymorphisms(SNPs).This presents a limitation,as genetic diseases often arise from complex interactions between multiple *** address this challenge,we developed DeepRisk,a biological knowledge-driven deep learning method for modeling these complex,nonlinear associations among SNPs,to provide a more effective method for scoring the risk of common diseases with genome-wide genotype *** demonstrated that DeepRisk outperforms existing PRs-based methods in identifying individuals at high risk for four common diseases:Alzheimer's disease,inflammatory bowel disease,type 2diabetes,and breast cancer.

关键词： Disease risk prediction Deep learning Polygenic risk score Common disease risk Disease prevention

来源：评论

学校读者我要写书评

暂无评论

Post-Quantum Encryption for Mathematical Model Using Quantum Machine Learning Approach 1

Post-Quantum Encryption for Mathematical Model Using Quantum...

引用

1st International Conference for Women in computing, InCoWoCo 2024

作者： Kavitha, J. Gayatri, V. Rajani, R. Sharmila, L. Harilakshmi, V.S. Misba, M. School of Computing Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology Chennai India Geethanjali Institute of Science and Technology Department of CSE Andhra Pradesh India Department of Artifical Intelligence and Data Science Nagercoil India

ISBN: (纸本)9798331518943

Because of the increasing emphasis put on the aviation industry in as a main industry of the global transportation industry, a number of organizations depend on different flight companies to get in touch with parts of the world which may be an effective measure to control the disease from spreading to other areas of the world. However, severe conditions can actually influence airline services in a given area of operation most significantly, flight delays. In this case, service encounters took place between the airline as a large organizational sector and the individual traveling as customers. The working for this issue is to accurately expect such flight delays though enables enhanced performers while in travel in order to be fit for destinations. Disability which will be occasioned by the existence of the aforementioned impediment. Quantum machine learning is used to examine the measures that were used in building models to analyze probability of flights. Problems associated with late and early arrival and;Delays due to unfavorable weather conditions. In the initial the process of project management, in which at the planned stage of the work, we study the feasibility of integration of Support Vector Machine with Python-based linear Regression. © 2024 IEEE.

关键词： Project management

来源：评论

学校读者我要写书评

暂无评论

3D Based CNN for Improved Segmentation from the Hyperspectral Images 1

3D Based CNN for Improved Segmentation from the Hyperspectra...

引用

1st International Conference on Computer science and Emerging Technologies, CSET 2023

作者： Narmadha, T. Arockia Raj, A. Saravanan, P. Kumar, A. Suresh Sekaran, Ramesh Gowri Shankar, J. School of Computer Science and Engineering Jain Deemed to Be University Bengaluru India Madanapalle Institute of Technology and Science Department of Computer Science and Engineering - Data Science Madanapalle India School of Computing Science and Engineering Galgotias University Delhi NCR India

ISBN: (纸本)9798350341737

In this paper, we develop a 3D based CNN for Improved Segmentation of Paddy Fields from the HSI. Within the scope of this research, we will investigate a unique deep learning model, specifically 3D-CNN. In order to evaluate the validity of the model, it is applied to three separate datasets, each of which is then subjected to one of four distinct dimensionality reduction strategies. The purpose of this is to determine which of these four models is the most effective at reducing the number of dimensions. According to the findings, the 3D-CNN model is superior to both the AlexNet and CNN models in terms of the accuracy of its segmentations. In addition to this, the findings demonstrate that the 3D-CNN models perform better than the other approaches in terms of segmentation accuracy with a smaller number of datasets. © 2023 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

On Error-Based Step Size Control for Discontinuous Galerkin Methods for Compressible Fluid Dynamics

引用

应用数学与计算数学学报 2025年第1期7卷 3-39页

作者： Hendrik Ranocha Andrew R.Winters Hugo Guillermo Castro Lisandro Dalcin Michael Schlottke-Lakemper Gregor J.Gassner Matteo Parsani Applied Mathematics University of HamburgBundesstr.5520146 HamburgGermany Department of Mathematics Applied Mathematics Linköping UniversityLinköpingSweden Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Applied and Computational Mathematics RWTH Aachen UniversityAachenGermany High-Performance Computing Center Stuttgart University of StuttgartStuttgartGermany Department of Mathematics and Computer Science University of CologneCologneGermany Center for Data and Simulation Science University of CologneCologneGermany Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Physical Science and Engineering Division(PSE) King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia

We study a temporal step size control of explicit Runge-Kutta(RK)methods for com-pressible computational fluid dynamics(CFD),including the Navier-Stokes equations and hyperbolic systems of conservation laws such as the Euler *** demonstrate that error-based approaches are convenient in a wide range of applications and compare them to more classical step size control based on a Courant-Friedrichs-Lewy(CFL)*** numerical examples show that the error-based step size control is easy to use,robust,and efficient,e.g.,for(initial)transient periods,complex geometries,nonlinear shock captur-ing approaches,and schemes that use nonlinear entropy *** demonstrate these properties for problems ranging from well-understood academic test cases to industrially relevant large-scale computations with two disjoint code bases,the open source Julia pack-ages *** with *** and the C/Fortran code SSDC based on PETSc.

关键词： Explicit Runge-Kutta(RK)methods Step size control Compressible fluid dynamics Adaptivity in space and time Shock capturing

来源：评论

学校读者我要写书评

暂无评论

ACSLs for Large-Scale Bounded Single Depot Multiple Travelling Salesman Problem 13

ACSLs for Large-Scale Bounded Single Depot Multiple Travelli...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Verma, Shanu Pant, Millie Indian Institute of Technology Roorkee Department of Applied Mathematics & Scientific Computing Uttarakhand Roorkee247667 India Mehta Family School of Data Science & Artificial Intelligence Indian Institute of Technology Roorkee Department of Applied Mathematics & Scientific Computing Uttarakhand Roorkee247667 India

ISBN: (纸本)9798350308365

Bounded single depot multiple travelling salesman problem (BSD-MTSP) optimizes salesmen tours with constraints on the number of cities visiting per salesman, which ensures balanced routes. BSD-MTSP presents challenges due to its combinatorial nature and additional complexities arising from multiple salesmen and depot-related constraints. Exact solutions for BSD-MTSP via classical methods are computationally expensive, prompting the use of heuristics and metaheuristics for practical solutions. This paper presents ACSLs, a hybrid algorithm combining initialization heuristic, Ant colony system, and Local search operators. ACSLs efficiently tackles large-scale BSD-MTSPs, demonstrating a superiority of up to 9.964% over the most advanced algorithms through comparative analysis. © 2024 IEEE.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：