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

Underwater acoustic intelligent spectrum sensing with multimodal data fusion: An Mul-YOLO approach

学校读者我要写书评

暂无评论

Future Generation Computer Systems 2025年 173卷

作者： Li, Yufang Zhang, Liliang Wang, Kai Xu, Lingwei Gulliver, T. Aaron Department of Information Science and Technology Qingdao University of Science and Technology Qingdao266061 China Xiangyang Sub-center of National Engineering Research Center for Water Transport Safety Hubei University of Arts and Science Xiangyang441053 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Nanning530006 China Department of Electrical and Computer Engineering University of Victoria VictoriaBC V8W 2Y2 Canada

Realizing the Ocean Internet of Things (OIoT) requires diverse and comprehensive real-time marine data. This creates significant demands on spectrum resources for effective underwater communication. Coexisting users in the OIoT can generate massive amounts of data, which results in competition for underwater acoustic spectrum. To address the problem of poor utilization of this spectrum in complex and dynamic ocean environments, this paper proposes an intelligent spectrum sensing scheme based on multimodal data fusion. First, the system obtains time series data for the underwater acoustic signals and a wavelet transform is used to obtain the corresponding image data. The time series and image data constitute multimodal data that provide a more comprehensive time and space perspective and improve the diversity of features. Then, unsupervised learning with a Denoising Autoencoder is used to extract high-quality features from the time series data. Finally, a parallel dual Backbone YOLO network is constructed to compensate for the inability of traditional YOLO to extract multimodal features. One branch captures key temporal features through a network built with deep separable convolutions, while the other branch captures key spatial features using an improved CSPDarknet. This Mul-YOLO network can extract hierarchical structure information from underwater acoustic signals and integrate the diverse multilevel features of the data to achieve accurate spectrum sensing. Compared with Convolutional Neural Network (CNN), ResNet, Swin-Transformer, ConvNext and YOLOv5 algorithms, the average detection probability of the Mul-YOLO algorithm is increased by about 5.9% to 18.9%, and the average false alarm probability is optimized by about 7% to 12.7% in the range of signal-to-noise ratio from −12 dB to 0 dB. The results given show that the proposed algorithm can detect spectrum holes with high accuracy and effectively avoid interference between users. © 2025 Elsevier B.V.

关键词： Image fusion

Aerial Active STAR-RIS-assisted Satellite-Terrestrial Covert Communications

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wang, Jiacheng Zhang, Ruichen Niyato, Dusit Mao, Shiwen Quek, Tony Q.S. Computer Science and Technology Jilin University Changchun130012 China Singapore University of Technology and Design Singapore487372 Singapore College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in dense urban environments. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active simultaneous transmitting and reflecting reconfigurable intelligent surface (AASTAR-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information (CSI). Then, we formulate an AASTAR-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AASTAR-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning (DRL) method to solve the ASCCOP. Concretely, the generative diffusion model (GDM) is utilized as the policy representation of the algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the performance and practicality under different algorithm parameters and environment settings. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

Error Formulas for Lagrange Projectors Determined by Cartesian Sets

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2018年第4期31卷 1090-1102页

作者： LI Zhe ZHANG Shugong DONG Tian GONG Yihe School of Science Changchun University of Science and Technology Changchun 130022 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University Changchun 130012 China Northeast Electric Power University Jilin 132012 China School of Mathematics Jilin University Changchun 130012 China

This paper studies error formulas for Lagrange projectors determined by Cartesian sets. Cartesian sets are properly subgrids of tensor product grids. Given interpolated functions with all order continuous partial derivatives, the authors directly construct the good error formulas for Lagrange projectors determined by Cartesian sets. Owing to the special algebraic structure, such a good error formula is useful for error estimate.

关键词： Cartesian sets error formulas ideal interpolation multivariate polynomial interpolation

GEOM-GCN: Geometric graph convolutional networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Lei, Yu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education China

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Graphic methods

Curvature regularization to prevent distortion in graph embedding

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Zhang, Chunxu Chang, Kevin Chen-Chuan Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China

Recent research on graph embedding has achieved success in various applications. Most graph embedding methods preserve the proximity in a graph into a manifold in an embedding space. We argue an important but neglected problem about this proximity-preserving strategy: Graph topology patterns, while preserved well into an embedding manifold by preserving proximity, may distort in the ambient embedding Euclidean space, and hence to detect them becomes difficult for machine learning models. To address the problem, we propose curvature regularization, to enforce flatness for embedding manifolds, thereby preventing the distortion. We present a novel angle-based sectional curvature, termed ABS curvature, and accordingly three kinds of curvature regularization to induce flat embedding manifolds during graph embedding. We integrate curvature regularization into five popular proximity-preserving embedding methods, and empirical results in two applications show significant improvements on a wide range of open graph datasets. Copyright © 2020, The Authors. All rights reserved.

关键词： Topology

An unmanned aerial vehicle pose estimation system based on SLAM 2

学校读者我要写书评

暂无评论

An unmanned aerial vehicle pose estimation system based on S...

2019 2nd International Conference on Advanced Materials, Intelligent Manufacturing and Automation, AMIMA 2019

作者： Dou, Xinglei Huo, Yuzhou Liu, Yongchang Wang, Xin College of Software Engineering Jilin University Changchun Jilin130012 China College of Computer Science and Technology Jilin University Changchun Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education Jilin University Changchun Jilin130012 China

This paper presents an unmanned aerial vehicle (UAV) pose estimation system based on monocular simultaneous localization and mapping (SLAM) guided by the desired shot. The system enables UAV to automatically adjust the pose to achieve a shot close to the desired shot provided by the user. The SLAM module in the system includes ORB feature-based visual odometry and Levenberg-Marquardt method-based optimizer. To ensure the reliability of the camera pose estimation result, the bag of words model is used to select an image which has enough good matches with the desired shot. The experimental results prove that the system is valid and effective. © Published under licence by IOP Publishing Ltd.

关键词： Antennas

Affine-periodic solutions by averaging methods

学校读者我要写书评

暂无评论

Science China Mathematics 2018年第3期61卷 439-452页

作者： Jiamin Xing Xue Yang Yong Li College of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Mathematics and Statistics Northeast Normal University Center for Mathematics and Interdisciplinary Sciences Northeast Normal University

This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-periodic when Q is an orthogonal matrix. It can be even unbounded but x(t)/|x(t)| is quasi-periodic,like a helical line. for example x(t)=e^(at)(cos ωt, sin ωt), when Q is not an orthogonal matrix. The averaging method of higher order for finding affine-periodic solutions is given by topological degree.

关键词： affine-periodic solutions averaging method topological degree

Weighted partial order oriented three-way decisions under score-based common voting rules

学校读者我要写书评

暂无评论

International Journal of Approximate Reasoning 2020年 123卷 41-54页

作者： Li, Lei Wu, Xindong Chen, Huanhuan Zhou, Chuan Liu, Guanfeng Jiang, Yongkang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei 230601 China Mininglamp Academy of Sciences Mininglamp Technologies Beijing 100084 China School of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China Computing Dept Macquarie University Sydney A1C 5S7 Australia

Recently, with the trisecting and acting models of human cognitive behaviors, three-way decisions are introduced to deal with uncertain decisions in many applications. To define and conduct the three-way decisions on the possible or necessary loser or co-loser and/or winner or co-winner, we first define the score-based common voting rules, where a score-based function is introduced to evaluate certain utility, including positional scoring rules, maximin, Bucklin, and so on. Then on one hand, it has been proved that under certain conditions three-way decisions on the possible loser or co-loser and/or winner or co-winner are NP-complete with positional scoring rules, maximin, and Bucklin, respectively. On the other hand, we have presented algorithms whose time complexity is polynomial to conduct three-way decisions on the necessary winner or co-winner and/or necessary loser or co-loser with positional scoring rules, maximin, and Bucklin in time O(nm²), O(nm³), and O(nm²), respectively, which has been validated experimentally. © 2020 Elsevier Inc.

关键词： Common voting rules Three-way decisions Weighted partial orders

Deep neural architecture search with deep graph bayesian optimization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Ma, Lizheng Cui, Jiaxu Yang, Bo College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education

Bayesian optimization (BO) is an effective method of finding the global optima of black-box functions. Recently BO has been applied to neural architecture search and shows better performance than pure evolutionary strategies. All these methods adopt Gaussian processes (GPs) as surrogate function, with the handcraft similarity metrics as input. In this work, we propose a Bayesian graph neural network as a new surrogate, which can automatically extract features from deep neural architectures, and use such learned features to fit and characterize black-box objectives and their uncertainty. Based on the new surrogate, we then develop a graph Bayesian optimization framework to address the challenging task of deep neural architecture search. Experiment results show our method significantly outperforms the comparative methods on benchmark tasks. Copyright © 2019, The Authors. All rights reserved.

关键词： Evolutionary algorithms