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

arXiv 2022年

作者： Shi, Minjia Liu, Na Kim, Jon-Lark Solé, Patrick Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Anhui Hefei230601 China School of Mathematical Sciences Anhui University Anhui Hefei230601 China Department of Mathematics Sogang University Seoul Korea Republic of Aix Marseille Univ CNRS Centrale Marseille I2M Marseille France

A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes over F4 are F4-codes that are stable by codeword addition but not necessarily by scalar multiplication. An additive code over F4 is additive complementary dual (ACD) if it meets its dual trivially. The aim of this research is to study such codes which meet their dual trivially. All the techniques and problems used to study LCD codes are potentially relevant to ACD codes. Interesting constructions of ACD codes from binary codes are given with respect to the trace Hermitian and trace Euclidean inner product. The former product is relevant to quantum *** Codes 94B05 © 2022, CC0.

关键词： Additives

来源：评论

学校读者我要写书评

暂无评论

A Deep Reinforcement Learning Framework for Vehicle Detection and Pose Estimation in 3D Point Clouds 6th

A Deep Reinforcement Learning Framework for Vehicle Detectio...

引用

6th International Conference on Artificial Intelligence and Security, ICAIS 2020

作者： Wang, Weipeng Luo, Huan Zheng, Quan Wang, Cheng Guo, Wenzhong Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350003 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350003 China Fujian Key Laboratory of Sensing and Computing for Smart City Xiamen University XiamenFJ361005 China

ISBN: (纸本)9783030578800

As for autonomous driving in urban environments, it is of significance to accurately capture the position and pose of vehicles. Those information can assist self-driving system in making right decisions to avoid potential risks. Currently, 3D point clouds captured by laser scanners are widely used in self-driving systems to sense the real environment. Therefore, in this paper, we propose a deep reinforcement learning framework for vehicle detection and pose estimation by using 3D point clouds. Specifically, to estimate the pose of vehicles, we propose to design a rotation action in Deep Q Network (DQN). In addition, by considering the whole detection procedure as Markov Decision Process (MDP), our intermediate detected results can further improve the detection performance of our proposed method. The evaluations are carried on outdoor point cloud scenes captured by VMX450 laser scanning system. The experimental results demonstrate the satisfied performance on vehicle detection and pose estimation. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Nucleation and phase transition of decagonal quasicrystals

arXiv

引用

arXiv 2024年

作者： Zhou, Tiejun Zhang, Lei Zhang, Pingwen Shi, An-Chang Jiang, Kai Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Beijing International Center for Mathematical Research Peking University Beijing100871 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China Department of Physics and Astronomy McMaster University HamiltonL8S 4M1 Canada

In this work, we study the nucleation of quasicrystals from liquid or periodic crystals by developing an efficient order-order phase transition algorithm, namely the nullspace-preserving saddle search method. Specifically, we focus on nucleation and phase transitions of the decagonal quasicrystal (DQC) based on the Lifshitz-Petrich model. We present the nucleation path of DQC from the liquid and demonstrate one- and two-stage transition paths between DQC and periodic crystals. We provide a perspective of the group-subgroup phase transition and nucleation rates to understand the nucleation and phase transition mechanisms involving DQC. These results reveal the one-step and stepwise modes of symmetry breaking or recovery in the phase transition from DQC, where the stepwise modes are more probable. Copyright © 2024, The Authors. All rights reserved.

关键词： Quasicrystals

来源：评论

学校读者我要写书评

暂无评论

EG-KGR: A Knowledge Graph Reasoning Model Based on Enhanced Graph Sample and Aggregate Inductive Learning Algorithm

EG-KGR: A Knowledge Graph Reasoning Model Based on Enhanced ...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Yuejia Wu Jian-Tao Zhou Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph is an important research field that involves the storage and management of knowledge, but the incompleteness and sparsity of Knowledge Graphs hinder their application in many fields. Knowledge Graph Reasoning aims to alleviate this problem by completing missing paths or identifying wrong paths between entities. Graph Convolution Network (GCN) based methods are one of the state-of-the-art approaches to this work. However, it is difficult to directly generalize to unknown nodes and utilizes valid information from the local neighborhood which results in poor flexibility and extensibility and will loss of important information. This paper presents EG-KGR, a plug-and-play knowledge reasoning model based on enhanced graph sampling and aggregate inductive learning algorithm to relieve the above problems and enhance existing GCN-based methods. Specifically, EG-KGR supports incremental characteristics, uses inductive learning to replace transductive learning, and designs random sampling and local information sampling optimization methods to improve the model's generalization ability, prediction accuracy, and running speed. Extensive experimental results show that our EG-KGR can achieve optimal results.

关键词： Training Knowledge engineering Convolution Aggregates Optimization methods Knowledge graphs Learning (artificial intelligence)

来源：评论

学校读者我要写书评

暂无评论

A Progressive Image Restoration Network for High-order Degradation Imaging in Remote Sensing

arXiv

引用

arXiv 2024年

作者： Feng, Yujie Yang, Yin Fan, Xiaohong Zhang, Zhengpeng Bu, Lijing Zhang, Jianping School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory for Intelligent Computing and Information Processing of the Ministry of Education Xiangtan411105 China School of Mathematics and Computational Science Xiangtan University National Center for Applied Mathematics in Hunan Hunan International Scientific and Technological Innovation Cooperation Base of Computational Science Xiangtan411105 China College of Mathematical Medicine Zhejiang Normal University Jinhua321004 China School of Automation and Electronic Information Xiangtan University Xiangtan411105 China

Recently, deep learning methods have gained remarkable achievements in the field of image restoration for remote sensing (RS). However, most existing RS image restoration methods focus mainly on conventional first-order degradation models, which may not effectively capture the imaging mechanisms of remote sensing images. Furthermore, many RS image restoration approaches that use deep learning are often criticized for their lacks of architecture transparency and model interpretability. To address these problems, we propose a novel progressive restoration network for high-order degradation imaging (HDI-PRNet), to progressively restore different image degradation. HDI-PRNet is developed based on the theoretical framework of degradation imaging, offering the benefit of mathematical interpretability within the unfolding network. The framework is composed of three main components: a module for image denoising that relies on proximal mapping prior learning, a module for image deblurring that integrates Neumann series expansion with dual-domain degradation learning, and a module for super-resolution. Extensive experiments demonstrate that our method achieves superior performance on both synthetic and real remote sensing images. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Graph Computation Model with Communication Equilibrium 15th

A Two-Stage Graph Computation Model with Communication Equil...

引用

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Dong, Yanmei Chen, Rongwang Guo, Kun College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China College of Mathematics and Computer Science Wuyi University Wuyishan Fujian354300 China Digital Fujian Tourism Big Data Institute Wuyishan Fujian354300 China

ISBN: (纸本)9789811625398

Distributed graph computing aims at performing in-depth analysis on large networks in a parallel manner. Iterative communication computation is an important model to perform graph analysis. Moreover, high-efficiency iterative communication computation is necessary for assuring the quality of graph partitioning. Many strategies to improve graph computing are usually based on the hypothesis of single communication iteration which focuses on the optimization of load balance in a single graph partitioning and the improvement of parallel granularity or communication manners. However, a graph in the real-world usually requires complex communication iterations to achieve good analysis results, which often have the problems of data and communication tilting and low analysis efficiency. In this paper, we propose a two-stage graph computing model with communication equilibrium (TSMCE). The model employs a communication-equilibrated graph partitioning strategy (CEGP) for load balancing and a two-stage graph computing mode (TS) to reduce the crossing-partition communication. With the change of graph density, various factors such as load balancing, communication balancing, cross-partition transmission traffic, communication delay, and convergence speed can always maintain an efficient balance. The experiments conducted on the real-world datasets show that the communication-equilibrated graph partitioning strategy can divide a graph with high quality compared with Hash and Metis. Besides, the overall performance of our two-stage graph computing model with communication equilibrium is higher than that of the BSP model. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A Novel Compensation Inductance Structure for Suppressing Differential-to-Common Mode Conversion in Bended Differential Transmission Line 8

A Novel Compensation Inductance Structure for Suppressing Di...

引用

8th Asia-Pacific Conference on Antennas and Propagation, APCAP 2019

作者： Wang, Jiabao Sun, Yufa Zhu, Haoran Li, Fan Anhui University Key Lab of Intelligent Computing Signal Processing Ministry of Education Hefei230601 China

ISBN: (纸本)9781665400541

A novel compact compensation inductance structure optimized by genetic algorithm (GA) for right-angle bended transmission line is proposed to mitigate differential-to-common mode conversion noise in this paper. In comparison with the previous suppression method, high suppression level and large bandwidth are obtained with the proposed structure. Simultaneously, the differential return loss and insertion loss have been minimized by GA, leading to an overall improved signal integrity (SI). Furthermore, the proposed structure places inside the transmission line and does not occupy extra wiring space. Finally, the differential-to-common mode conversion can be prohibited from DC to 11 GHz with a suppression level of-23.13 dB. The measured results agree well with the simulated ones. © 2019 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Compact ultra-wideband MIMO antenna with double notch 8

Compact ultra-wideband MIMO antenna with double notch

引用

8th Asia-Pacific Conference on Antennas and Propagation, APCAP 2019

作者： Wang, Kang Sun, Yufa Anhui University Key Lab of Intelligent Computing Signal Processing Ministry of Education Hefei230601 China

ISBN: (纸本)9781665400541

In this paper, a compact multiple-input multiple-output (MIMO) antenna with two notches for wireless UWB applications is presented. The size of the proposed antenna is small, only 20 × 20 mm2. The radiating element of the antenna is a rectangular patch with a chamfered corner, and the inverted U-shaped slit on the patch is used to create the notches at wireless local area network and the downlink X-band of satellite communication. The isolation of more than 15 dB is achieved over the entire working frequency band (3.04-12.36 GHz). © 2019 IEEE.

关键词： Microwave antennas

来源：评论

学校读者我要写书评

暂无评论

FAS-UNet: A Novel FAS-driven Unet to Learn Variational Image Segmentation

arXiv

引用

arXiv 2022年

作者： Zhu, Hui Shu, Shi Zhang, Jianping The School of Mathematics and Computational Science Xiangtan University Key Laboratory of Intelligent Computing & Information Processing Ministry of Education China The School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center China

Solving variational image segmentation problems with hidden physics is often expensive and requires different algorithms and manually tunes model parameter. The deep learning methods based on the U-Net structure have obtained outstanding performances in many different medical image segmentation tasks, but designing such networks requires a lot of parameters and training data, not always available for practical problems. In this paper, inspired by traditional multi-phase convexity Mumford-Shah variational model and full approximation scheme (FAS) solving the nonlinear systems, we propose a novel variational-model-informed network (denoted as FAS-Unet) that exploits the model and algorithm priors to extract the multi-scale features. The proposed model-informed network integrates image data and mathematical models, and implements them through learning a few convolution kernels. Based on the variational theory and FAS algorithm, we first design a feature extraction sub-network (FAS-Solution module) to solve the model-driven nonlinear systems, where a skip-connection is employed to fuse the multi-scale features. Secondly, we further design a convolution block to fuse the extracted features from the previous stage, resulting in the final segmentation possibility. Experimental results on three different medical image segmentation tasks show that the proposed FAS-Unet is very competitive with other state-of-the-art methods in qualitative, quantitative and model complexity evaluations. Moreover, it may also be possible to train specialized network architectures that automatically satisfy some of the mathematical and physical laws in other image problems for better accuracy, faster training and improved generalization. The code is available at https://***/zhuhui100/FASUNet. Copyright © 2022, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A Novel Preference-Driven Dynamic Multi-Objective Evolutionary Algorithm for Solving Dynamic Multi-Objective Problems

SSRN

引用

SSRN 2023年

作者： Wang, Xueqing Zheng, Jinhua Hou, Zhanglu Liu, Yuan Zou, Juan Xia, Yizhang Yang, Shengxiang Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science School of Cyberspace Science Xiangtan University Hunan Province Xiangtan China School of Computer Science School of Cyberspace Science of Xiangtan University Xiangtan411105 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Most research on dynamic multi-objective optimization primarily concentrates on tracking the true Pareto optimal front (POF) and Pareto optimal set (POS) quickly and accurately when the environment undergoes changes. However, there are real-world scenarios where it is necessary to simultaneously solve changing objective functions and satisfy the preference of Decision Makers (DMs). Specifically, the DMs may be only interested in a partial region of the POF, known as the region of interest (ROI), rather than requiring the entire POF. To meet the challenge of simultaneously predicting a changing POF and/or POS and dynamic ROI, this paper proposes a new dynamic multi-objective evolutionary algorithm (DMOEAs) based on the preference. The proposed algorithm comprises three main components: an evolutionary direction adjustment strategy based on changing reference points to accommodate preference shifts, an angle-based search strategy for tracking the varying ROI, and a hybrid prediction strategy combining linear prediction models and population manifold estimation within the ROI to ensure convergence and distribution in unchanged preference scenarios. Experimental studies conducted on 16 widely used benchmark problems and empirical results demonstrate the significant advantages of the proposed algorithm over existing state-of-the-art DMOEAs. © 2023, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：