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

arXiv 2023年

作者： Yang, Jing Chen, Yuehai Du, Shaoyi Chen, Badong Principe, Jose C. School of Automation Science and Engineering Faculty of Electronic and Information Engineering Xi'an Jiaotong Xi'An710049 China Institute of Articial Intelligence and Robotics College of Articial Intelligence Xi'an Jiaotong University Shanxi Xi'An710049 China The Computational NeuroEngineering Laboratory Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Predicting the trajectory of pedestrians in crowd scenarios is indispensable in self-driving or autonomous mobile robot field because estimating the future locations of pedestrians around is beneficial for policy decision to avoid collision. It is a challenging issue because humans have different walking motions, and the interactions between humans and objects in the current environment, especially between humans themselves, are complex. Previous researchers focused on how to model human-human interactions but neglected the relative importance of interactions. To address this issue, a novel mechanism based on correntropy is introduced. The proposed mechanism not only can measure the relative importance of human-human interactions but also can build personal space for each pedestrian. An interaction module including this data-driven mechanism is further proposed. In the proposed module, the data-driven mechanism can effectively extract the feature representations of dynamic human-human interactions in the scene and calculate the corresponding weights to represent the importance of different interactions. To share such social messages among pedestrians, an interaction-aware architecture based on long short-term memory network for trajectory prediction is designed. Experiments are conducted on two public datasets. Experimental results demonstrate that our model can achieve better performance than several latest methods with good performance. © 2023, CC BY-NC-ND.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Joint Design of Radar Receive Filter and Unimodular ISAC Waveform with Sidelobe Level Control

arXiv

引用

arXiv 2025年

作者： Zhang, Kecheng Liu, Ya-Feng Wang, Zhongbin Yuan, Weijie Keskin, Musa Furkan Wymeersch, Henk Xia, Shuqiang School of System Design and Intelligent Manufacturing The Shenzhen Key Laboratory of Robotics and Computer Vision Southern University of Science and Technology Shenzhen518055 China 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 Department of Electrical Engineering Chalmers University of Technology Gothenburg41296 Sweden ZTE Corporation The State Key Laboratory of Mobile Network and Mobile Multimedia Technology Shenzhen518055 China

Integrated sensing and communication (ISAC) has been considered a key feature of next-generation wireless networks. This paper investigates the joint design of the radar receive filter and dual-functional transmit waveform for the multiple-input multiple-output (MIMO) ISAC system. While optimizing the mean square error (MSE) of the radar receive spatial response and maximizing the achievable rate at the communication receiver, besides the constraints of full-power radar receiving filter and unimodular transmit sequence, we control the maximum range sidelobe level, which is often overlooked in existing ISAC waveform design literature, for better radar imaging performance. To solve the formulated optimization problem with convex and nonconvex constraints, we propose an inexact augmented Lagrangian method (ALM) algorithm. For each subproblem in the proposed inexact ALM algorithm, we custom-design a block successive upper-bound minimization (BSUM) scheme with closed-form solutions for all blocks of variable to enhance the computational efficiency. Convergence analysis shows that the proposed algorithm is guaranteed to provide a stationary and feasible solution. Extensive simulations are performed to investigate the impact of different system parameters on communication and radar imaging performance. Comparison with the existing works shows the superiority of the proposed algorithm. © 2025, CC BY-NC-SA.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

A Multiple Ant Colony System for the Electric Vehicle Routing Problem with Time Windows

A Multiple Ant Colony System for the Electric Vehicle Routin...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Michalis Mavrovouniotis Georgios Ellinas Changhe Li Marios Polycarpou Department of Electrical and Computer Engineering KIOS Research and Innovation Center of Excellence University of Cyprus Nicosia Cyprus School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China

ISBN: (纸本)9781665487696

Ant colony optimization (ACO) has been found to be useful on several vehicle routing problem variations. In this work, ACO is applied to the electric vehicle routing problem with time windows (E-VRPTW). The E-VRPTW has a hierarchical multiple objective function, which is to minimize the number of electric vehicles and the total distance traveled. A multiple ACO is applied to E-VRPTW in which two colonies cooperate to minimize the objectives in parallel. A local search is embedded in ACO to improve the quality of the output. The experimental results on a set of benchmark instances show that the multiple ACO is competitive with existing methods.

关键词： Ant colony optimization Vehicle routing Benchmark testing Electric vehicles Routing Search problems Linear programming

来源：评论

学校读者我要写书评

暂无评论

Energy Efficiency Optimization for Full-Duplex D2D Communications Underlaying Distributed Antenna Systems

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2024年

作者： Liu, Zhan Liao, Zhiyuan Li, Chunquan Zhang, Zhijun Yu, Junzhi Liu, P.X. Hunan University of Humanities Science and Technology School of Information Loudi417000 China Nanchang University School of Information Engineering Nanchang330031 China Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction Nanchang330031 China South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Peking University State Key Laboratory for Turbulence and Complex Systems Department of Advanced Manufacturing and Robotics College of Engineering Beijing100871 China Carleton University Department of Systems and Computer Engineering OttawaONK1S 5B6 Canada

In this paper, we investigate the total system energy efficiency (EE) of full-duplex (FD) device-to-device (D2D) communications underlaying distributed antenna systems (DAS), where remote access units (RAUs), D2D users (DUs), and cellular users (CUs) are all capable of FD operation. Specifically, we jointly optimize subcarrier assignment and power allocation under the quality of service (QoS) requirements of CUs and DUs and the maximum power constraints of RAUs, CUs, and DUs. In addition, we propose a novel spectrum sharing strategy that allows each subcarrier to be assigned to multiple CUs and/or multiple D2D pairs (DPs) for flexibility. To solve the formulated non-convex optimization problem, we first employ fractional programming to transform the objective function in the optimization problem from the fractional form into the equivalent subtractive form. Then, an efficient iterative resource allocation algorithm is proposed, which needs to solve an inner problem in each iteration. After relaxing the variables and introducing penalty factors, the non-convex inner problem is transformed into a convex problem through the successive convex approximation (SCA) method and solved by iterative algorithm. Simulation results demonstrate that the proposed algorithm can considerably improve the system EE compared to other benchmark schemes. Furthermore, the proposed spectrum sharing strategy is superior to the existing sharing strategies. © 2017 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

SVM-based Extended Kalman Filter State Estimation of Biped Robot

SVM-based Extended Kalman Filter State Estimation of Biped R...

引用

IEEE International Conference on robotics and Biomimetics

作者： Chengzhi Gao Ye Xie Shiqiang Zhu Guanyu Huang Lingyu Kong Anhuan Xie Jianjun Gu Dan Zhang Zhejiang Laboratory Research Center for Intelligent Robotics Research Institute of Interdisciplinary Innovation Hangzhou China Zhejiang Engineering Research Center for Intelligent Robotics Hangzhou China Zhejiang University Hangzhou Zhejiang China Department of Electrical and Computer Engineering Dalhousie University Halifax NS Canada York University North York Toronto Canada

ISBN: (纸本)9781665481106

At present, more and more attention has been paid to the exploration of biped robots. As the precondition of biped stable walking, the state estimation of robot has also received the attention of many experts. Biped robot has special motion characteristics, has a hybrid dynamic system and belongs to a floating base, so it must obtain the contact information of two feet before realizing the motion state estimation of the robot. The contribution of this paper is to introduce soft support vector machine to detect contact phase. This method based on support vector machine (SVM) eliminates the need for force sensors on two feet because they are vulnerable to the impact between the foot and the contact surface. In addition, precise dynamic modeling is not required. Furthermore, this paper uses SVM to obtain the touchdown information, and proposes a state estimation method using extended Kalman filter to combine motion estimation with IMU data. Finally, the touchdown detection algorithm and the state estimation algorithm are verified through experiments, and the accuracy and feasibility of the SVM method are proved through the touchdown detection experiments. Based on this, the full state estimation of the robot is realized through the state estimation experiments.

关键词： Support vector machines Legged locomotion Technological innovation Motion estimation Switches Robot sensing systems Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Learning Probabilistic Coordinate Fields for Robust Correspondences

arXiv

引用

arXiv 2023年

作者： Zhao, Weiyue Lu, Hao Ye, Xinyi Cao, Zhiguo Li, Xin Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Lane Department of Computer Science and Electrical Engineering West Virginia University MorgantownWV26506-6109 United States

We introduce Probabilistic Coordinate Fields (PCFs), a novel geometric-invariant coordinate representation for image correspondence problems. In contrast to standard Cartesian coordinates, PCFs encode coordinates in correspondence-specific barycentric coordinate systems (BCS) with affine invariance. To know when and where to trust the encoded coordinates, we implement PCFs in a probabilistic network termed PCF-Net, which parameterizes the distribution of coordinate fields as Gaussian mixture models. By jointly optimizing coordinate fields and their confidence conditioned on dense flows, PCF-Net can work with various feature descriptors when quantifying the reliability of PCFs by confidence maps. An interesting observation of this work is that the learned confidence map converges to geometrically coherent and semantically consistent regions, which facilitates robust coordinate representation. By delivering the confident coordinates to keypoint/feature descriptors, we show that PCF-Net can be used as a plug-in to existing correspondence-dependent approaches. Extensive experiments on both indoor and outdoor datasets suggest that accurate geometric invariant coordinates help to achieve the state of the art in several correspondence problems, such as sparse feature matching, dense image registration, camera pose estimation, and consistency filtering. Further, the interpretable confidence map predicted by PCF-Net can also be leveraged to other novel applications from texture transfer to multi-homography classification. Copyright © 2023, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

Generative AI-driven Cross-layer Covert Communication: Fundamentals, Framework and Case Study

arXiv

引用

arXiv 2025年

作者： Liu, Tianhao Liu, Jiqiang Zhang, Tao Wang, Jian Wang, Jiacheng Kang, Jiawen Niyato, Dusit Mao, Shiwen School of Cyberspace Science and Technology Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing100045 China School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education Guangzhou510006 China Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

Ensuring end-to-end cross-layer communication security in military networks by selecting covert schemes between nodes is a key solution for military communication security. With the development of communication technology, covert communication has expanded from the physical layer to the network and application layers, utilizing methods such as artificial noise, private networks, and semantic coding to transmit secret messages. However, as adversaries continuously eavesdrop on specific communication channels, the accumulation of sufficient data may reveal underlying patterns that influence concealment, and establishing a cross-layer covert communication mechanism emerges as an effective strategy to mitigate these regulatory challenges. In this article, we first survey the communication security solution based on covert communication, specifically targeting three typical scenarios: device-to-device, private network communication, and public network communication, and analyze their application scopes. Furthermore, we propose an end-to-end cross-layer covert communication scheme driven by Generative Artificial Intelligence (GenAI), highlighting challenges and their solutions. Additionally, a case study is conducted using diffusion reinforcement learning to sovle cloud edge internet of things cross-layer secure communication. © 2025, CC BY.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Unprecedented Smart Algorithm for Uninterrupted SDN Services During DDoS Attack

引用

computers, Materials & Continua 2022年第1期70卷 875-894页

作者： Muhammad Reazul Haque Saw Chin Tan Zulfadzli Yusoff Kashif Nisar Rizaludin Kaspin Iram Haider Sana Nisar J.P.C.Rodrigues Bhawani Shankar Chowdhry Muhammad AslamUqaili Satya Prasad Majumder Danda B.Rawat Richard Etengu Rajkumar Buyya Faculty of Computing&Informatics Multimedia UniversityPersiaranMultimediaCyberjaya63100SelangorMalaysia Faculty of Engineering Multimedia UniversityPersiaran MultimediaCyberjaya63100SelangorMalaysia Faculty of Computing and Informatics University Malaysia SabahJalan UMSKota Kinabalu Sabah88400Malaysia Telekom Malaysia Research&Development TM Innovation Centre63000CyberjayaSelangorMalaysia Federal University of Piauí(UFPI) TeresinaPIBrazil Instituto de Telecomunica珲es 6201-001Covilh?Portugal National Center of Robotics and Automation-Condition Monitoring Systems Lab MUETJamshoroPakistan Department of Electrical and Electronic Engineering BUETDhaka1205Bangladesh Department of Electrical Engineering and Computer Science Data Science and Cybersecurity CenterHoward UniversityWashingtonDCUSA Cloud Computing and Distributed Systems(CLOUDS)Laboratory School of Computing and Information SystemsThe University of MelbourneMelbourneVIC 3053Australia

In the design and planning of next-generation Internet of Things(IoT),telecommunication,and satellite communication systems,controller placement is crucial in software-defined networking(SDN).The programmability of the SDN controller is sophisticated for the centralized control system of the entire ***,it creates a significant loophole for the manifestation of a distributed denial of service(DDoS)attack ***,recently a Distributed Reflected Denial of Service(DRDoS)attack,an unusual DDoS attack,has been ***,minimal deliberation has given to this forthcoming single point of SDN infrastructure failure ***,recently the high frequencies of DDoS attacks have increased *** this paper,a smart algorithm for planning SDN smart backup controllers under DDoS attack scenarios has *** proposed smart algorithm can recommend single or multiple smart backup controllers in the event of DDoS *** obtained simulated results demonstrate that the validation of the proposed algorithm and the performance analysis achieved 99.99%accuracy in placing the smart backup controller under DDoS attacks within 0.125 to 46508.7 s in SDN.

关键词： SDN smart algorithm RTZLK-DAASCP DDoS attack DRDoS

来源：评论

学校读者我要写书评

暂无评论

A2B: Anchor to Barycentric Coordinate for Robust Correspondence

arXiv

引用

arXiv 2023年

作者： Zhao, Weiyue Lu, Hao Cao, Zhiguo Li, Xin The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Lane Department of Computer Science and Electrical Engineering West Virginia University Commonwealth of Virginia Morgantown 15461 United States

There is a long-standing problem of repeated patterns in correspondence problems, where mismatches frequently occur because of inherent ambiguity. The unique position information associated with repeated patterns makes coordinate representations a useful supplement to appearance representations for improving feature correspondences. However, the issue of appropriate coordinate representation has remained unresolved. In this study, we demonstrate that geometric-invariant coordinate representations, such as barycentric coordinates, can significantly reduce mismatches between features. The first step is to establish a theoretical foundation for geometrically invariant coordinates. We present a seed matching and filtering network (SMFNet) that combines feature matching and consistency filtering with a coarse-to-fine matching strategy in order to acquire reliable sparse correspondences. We then introduce DEGREE, a novel anchor-to-barycentric (A2B) coordinate encoding approach, which generates multiple affine-invariant correspondence coordinates from paired images. DEGREE can be used as a plug-in with standard descriptors, feature matchers, and consistency filters to improve the matching quality. Extensive experiments in synthesized indoor and outdoor datasets demonstrate that DEGREE alleviates the problem of repeated patterns and helps achieve state-of-the-art performance. Furthermore, DEGREE also reports competitive performance in the third Image Matching Challenge at CVPR 2021. This approach offers a new perspective to alleviate the problem of repeated patterns and emphasizes the importance of choosing coordinate representations for feature correspondences. Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：