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

2025 IEEE International Conference on Mechatronics, ICM 2025

作者： Li, Zhenyu Wu, Ruixin Wang, Jin Hu, Chuanqi Zheng, Zhi Meng, Jun Lu, Guodong Zhejiang University State Key Laboratory of Fluid Power and Mechatronic Systems Hangzhou310058 China Zhejiang University Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Hangzhou310058 China Robotics Research Center of Yuyao City Ningbo315400 China College of Electrical Engineering Zhejiang University Hangzhou310027 China Center for Data Mining and Systems Biology College of Electrical Engineering Zhejiang University Hangzhou310027 China

ISBN: (纸本)9798331533892

This article proposes an algorithm designed for autonomous quadrotors to capture target quadrotors in complex obstacle environments, enabling multiple pursuers to perform distributed capture while simultaneously avoiding obstacles and collisions. We first introduce a 3D obstacle space representation method based on safety-priority reachable region (SPRR) and implement real-time construction for general point cloud maps. Subsequently, leveraging SPRR, we employ an area minimization approach to ensure the effective capture of the evader within a limited time. The outcomes are then integrated into a MINCO-based trajectory planning framework to ensure their practical execution by real quadrotors. Relying on SPRR, the optimization problem is simplified and the solution efficiency is improved. In the scenario of simulating the dynamics of real quadrotors, we compare the proposed algorithm with state-of-the-art evasion and pursuit methods, validating its effectiveness and advancements. This work presents a practical solution for multi-quadrotor collaborative capture. © 2025 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

First-principles investigation of adhesion strength and interfacial bonding in Mg/X(X=Ti,Zr,Hf,V,Nd,Cr,Mo,Mn,and Fe)interface

引用

Journal of Magnesium and Alloys 2025年第1期13卷 83-89页

作者： Longke Bao Zhifu Yao Yuhui Zhang Cuiping Wang Kaihong Zheng Rongpei Shi Xingjun Liu Fusheng Pan State Key Laboratory of Advanced Welding and Joining Harbin Institute of TechnologyShenzhen 518055China College of Materials Science and Engineering and Institute of Materials Genome and Big DataHarbin Institute of TechnologyShenzhen 518055China Institute of New Materials Guangdong Academy of SciencesGuangzhou 510650China College of Materials Science and Engineering Xiamen UniversityXiamen 361005China College of Materials Science and Engineering Chongqing UniversityChongqing 400045China

Magnesium alloys have gained extensive applications across various industries,including aerospace,transportation,and civil construction,owing to their excellent combinations of high specific strength and stiffness[1].However,their lim-ited strength due to the lack of effective strengthening phases has hindered their broader industrial applications[2].Never-theless,it has been challenging to achieve significant strength-ening due to the restricted solubility of alloying elements in magnesium[3].Thus,more and more efforts have been made to explore the concept of secondary phase-reinforced magne-sium alloys[2,4,5],where the secondary phase acts as re-inforcing agents within the magnesium matrix,resembling a composite material.

关键词： adhesion strength interfacial bonding aluminum alloys industrial applications solubility strengthening phases alloying elements Mg X interfaces

来源：评论

学校读者我要写书评

暂无评论

T2R-GAN: A CGAN-based model for rural thematic road extraction 27th

T2R-GAN: A CGAN-based model for rural thematic road extracti...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Ni, Zixiang Zhai, Weixin College of Information and Electrical Engineering China Agricultural University Beijing100083 China Key Laboratory of Agricultural Machinery Monitoring and Big Data Application Ministry of Agriculture and Rural Affairs Beijing100083 China

ISBN: (纸本)9783031783883

Rural roads extracted from agricultural machinery trajectories have significant research value. Due to the intricate network of rural roads and the large difference in the density of agricultural machinery trajectories, traditional road extraction methods struggle to perform effectively on rural roads with complex topology and on agricultural machinery trajectories with obscure road features. Therefore, this paper proposes a CGAN-based model named T2R-GAN (Trajectory to Road-GAN) for rural thematic road extraction, which learns the trajectory-to-road feature mapping through continuous adversarial training between the ELAU-Net generator and the PatchGAN discriminator to adapt to trajectories of various densities. ELAU-Net is an efficient network that utilizes an encoder-decoder structure and ELA modules to enhance the capture of obscure road features between sparse trajectories. To enhance model performance and reduce the risk of overfitting, bilateral hinge loss is designed to train our model to enhances the discriminator’s discriminative ability to facilitate the generator to generate more realistic roads improve the generalization of the model. To verify the effectiveness of T2R-GAN in extracting roads from agricultural trajectory data, this paper selects the real agricultural trajectory data from Henan Province, China in June 2021 as the dataset for verification. The experimental results show that the proposed method achieves 79.23% F1score, which is 5.53% higher than the previous state-of-art. The proposed T2R-GAN provides a novel and effective approach for extracting rural thematic roads from agricultural machinery trajectories for the first time. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Enhancing Weakly Supervised Medical Segmentation via Heterogeneous Co-training with Box-Wise Augmentation and Pseudo-Label Filtering 6th

Enhancing Weakly Supervised Medical Segmentation via Hetero...

引用

6th IFIP TC 12 International Conference on Intelligence Science, ICIS 2024

作者： Wang, You Qi, Lei Yu, Qian Shi, Yinghuan Gao, Yang State Key Laboratory of Novel Software Technology National Insititute of Health-care Data Science Nanjing University Nanjing China School of Computer Science and Engineering Southeast University Nanjing China School of Data and Computer Science Shandong Woman’s University Jinan China

ISBN: (纸本)9783031712524

In this paper, we introduce an innovative approach to weakly supervised medical image segmentation with box annotations. Different from the previous methods which simply utilize a single conventional network with the same augmentation techniques widely used in supervised segmentation, we aim to introduce diverse augmentations and heterogenous networks to leverage the box annotations for promising generalization ability. Specifically, to amplify the diversity between the contents within the box and its surroundings, we propose the interior and exterior box augmentation (IEBA) technique, in which distinct augmentation techniques are employed for regions inside and outside the bounding boxes. Also, for the purpose of selecting pseudo-labels of superior quality, we propose the pseudo-label filter module (PLFM) to eliminate unreliable pseudo-labels. Besides, as CNN demonstrates superior capabilities in acquiring local information, and ViT specializes in capturing global context, we facilitate a bidirectional learning process between CNN and ViT through quadruple cross consistency losses (QCCL). In inference, we only employ the superior model from the validation set to obtain parameter efficiency. Our approach is evaluated across four tasks on two public datasets, utilizing the 3D dice similarity coefficient as the evaluation metric. The experimental results show that the proposed method outperforms the state-of-the-art comparison methods. © IFIP International Federation for Information Processing 2025.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Learned Video Compression With Refined Adaptive Flow Pyramid And Coordinate-Aware Attention

Learned Video Compression With Refined Adaptive Flow Pyramid...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Huang, Qian Liu, Wenting Li, Xin Wang, Yiming College of Computer Science and Software Engineering Hohai University Nanjing China Key Laboratory of Water Big Data Technology Ministry of Water Resources Hohai University Nanjing China

ISBN: (纸本)9798350368741

In video compression, motion estimation and motion compensation are critical for achieving efficient encoding. Although the commonly used SpyNet and bilinear interpolation have contributed in improving the compression efficiency, they still have limitations. SpyNet often loses details and fails to fully utilize the feature extraction capabilities of deep networks. Furthermore, bilinear interpolation inherently attenuates high-frequency information, leading to frame blurring and distortion. In this paper, we propose a novel video compression algorithm. To overcome the limitations of SpyNet, we propose a refined adaptive flow pyramid network. This network uses a multi-scale feature pyramid to capture more details. Moreover, we use an iterative cost volume refinement engine that improves the feature representation of the network and iteratively improve the accuracy of motion estimation. In addition, to overcome the limitation of bilinear interpolation, we propose a coordinate-aware attention module, which captures more high-frequency information to improve the accuracy of motion compensation. Experimental results show that our method outperforms VTM-13.2 (LDP) in terms of PSNR. © 2025 IEEE.

关键词： coordinate network cross attention flow pyramid learned video compression

来源：评论

学校读者我要写书评

暂无评论

Five-user quantum virtual local area network with an AlGaAs entangled photon source

引用

Science China(Physics,Mechanics & Astronomy) 2025年第3期68卷 61-73页

作者： Cheng Qian Hongkai Tian Xu Jing Yichen Liu Zhe Chen Huiran Luo Yuan Du Xiaodong Zheng Tangsheng Chen Yuechan Kong Hua-Lei Yin Dong Jiang Bin Niu Liangliang Lu Key Laboratory of State Manipulation and Advanced Materials in Provincial Universities School of Physical Science and TechnologyNanjing Normal UniversityNanjing210023China School of Internet Anhui UniversityHefei230039China National Key Laboratory of Solid-State Microwave Devices and Circuits Nanjing Chip Valley Industrial Technology InstituteNanjing Electronic Devices InstituteNanjing210016China Research Center for Quantum Optics and Quantum Communication School of ScienceQingdao University of TechnologyQingdao266520China Department of Physics and Beijing Key Laboratory of Opto-electronic Functional Materials and Micro-nano Devices Key Laboratory of Quantum State Construction and Manipulation(Ministry of Education)Renmin University of ChinaBeijing100872China Beijing Academy of Quantum Information Sciences Beijing100193China National Engineering Research Center of Agro-Ecological Big Data Analysis and Application Anhui UniversityHefei230601China National Laboratory of Solid-State Microstructures and School of Physics Nanjing UniversityNanjing210093China Hefei National Laboratory Hefei230088China

The promotion of quantum network applications demands the scalable connection of quantum *** is preferable to set up multiple logical networks coexisting on a single physical network infrastructure to accommodate a larger number of *** we present a quantum virtual network architecture that offers this level of scalability,without being constrained to a fixed physical-layer network relying solely on passive multiplexing *** architecture can be understood as arising from the superposition of a fully connected entanglement distribution network and port-based virtual local area network,which group multiusers by access *** terms of hardware,we leverage a semiconductor chip with a high figure-of-merit modal overlap to directly generate high-quality polarization entanglement,and a streamlined polarization analysis module,which requires only one single-photon detector for each end *** experimentally perform the BBM92 QKD protocol on the five-user quantum virtual network and demonstrate voice and image encryption on a campus area *** results may provide insights into the realization of large-scale quantum networks with integrated and cost-efficient photonic architecture.

关键词： quantum network quantum entanglement distribution integrated photonics image and voice encryption

来源：评论

学校读者我要写书评

暂无评论

Deduplication and Approximate Analytics for Encrypted IoT data in Fog-Assisted Cloud Storage 24th

Deduplication and Approximate Analytics for Encrypted IoT ...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wang, Rongxi Ha, Guanxiong Jia, Chunfu Li, Ruiqi Su, Zhen The College of Cyber Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China The College of Safety Science and Engineering Civil Aviation University of China Tianjin China

ISBN: (纸本)9789819615476

With the advancement of the Internet of Things (IoT) technologies, there has been a rapid increase in the volume of IoT data, leading to escalating costs in storage, transmission, and analytics. The benefits of conventional data deduplication schemes are diminishing when applied to IoT data that is similar but distinct, necessitating the development of new approaches to accommodate these new scenarios. This paper proposes a deduplication and approximate analytics scheme for encrypted IoT data in fog-assisted cloud storage. The scheme is based on Generalized Deduplication (GD), Message Locked Encryption (MLE), Homomorphic Encryption (HE), and ciphertext conversion techniques. We employ GD to divide similar but distinct IoT data into bases and deviations, and perform deduplication on the encrypted base to achieve efficient storage while protecting data privacy. Additionally, we utilize Hybrid Homomorphic Encryption (HHE) techniques to convert the symmetric ciphertext of IoT data into homomorphic ciphertext, facilitating approximate analytics while ensuring privacy protection of IoT data in fog-assisted cloud storage and reducing the computation overhead on IoT devices. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

Optimizing Indoor Network Element Layout for Enhanced Signal Coverage and Security in Location-Based Services 7th

Optimizing Indoor Network Element Layout for Enhanced Signa...

引用

7th International Conference on Attacks and Defenses for Internet-of-Things, ADIoT 2024

作者： Yu, Xiaomin Yu, Xiaokun College of Computer and Control Engineering Qiqihar University Qiqihar China Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis Qiqihar University Qiqihar China Heilongjiang Jiaotong Polytechnic Qiqihar China

ISBN: (纸本)9783031855924

Recently, with the rapid development of communication technology, location-based services (LBS) in indoor environments have penetrated into various aspects of people’s daily lives. Wireless local area networks (WLAN) have become the preferred choice for location-based services due to their broad deployment and low cost. However, the typical non-line-of-sight characteristics of indoor environments result in severe fluctuations in received signal strength (RSS), signal coverage vulnerabilities can exacerbate environmental interference, making positioning results more vulnerable to attacks or tampering. The layout of indoor network elements is a key factor that constrains signal coverage rate. This paper focuses on the optimization of indoor network element layout, proposes an indoor network element layout optimization model based on signal coverage and quality in indoor environments and introduces an Adaptive Simulation Annealing Non-inertial Opposite Particle Swarm Optimization algorithm (ASA-NRPSO). Firstly, a reverse strategy is introduced into the particle flight process of the Particle Swarm Optimization (PSO) algorithm, and high-quality particles are selected for the next generation iteration. In the selection of the reverse strategy, the simulated annealing idea is integrated to adaptively select the reverse strategy based on the needs of the particles at different stages, which avoids the particles falling into local optima. The inertia term in the particle swarm velocity update formula is replaced with group information for non-inertial updates. This can more fully utilize the global information of the population to guide the movement of the next generation of particles and improve the convergence speed of the particle swarm. The elite mutation strategy is used to increase the diversity of particles and improve the global search capability of the algorithm. This method ensures the rapid generation of network element layout to improve the signal coverage rate

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Solving Overlapping Coalition Structure Generation in Task-Based Settings

引用

Journal of Artificial Intelligence Research 2025年 82卷 2125-2166页

作者： Zhang, Guofu Su, Zhaopin Song, Xiaoxiao Gao, Zixuan Li, Miqing Yao, Xin School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Anhui Hefei China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Anhui Hefei China CERCIA School of Computer Science University of Birmingham Birmingham United Kingdom School of Data Science Lingnan University Hong Kong

The overlapping coalition structure generation problem (OCSGP) is a challenging computational problem in multi-agent systems. It focuses on selecting possibly overlapping coalitions from a set of agents to maximize the social welfare of all coalitions while containing all agents. However, in practical applications, coalitions may be formed to selectively respond to tasks from a pool of potential tasks assigned to agents. Consequently, this study considers OCSGP in a task-based setting, where each agent has finite resources and can only respond to tasks of interest, and each coalition can only take on mutually disjoint subsets of tasks. Specifically, we first present a model of the task-based OCSGP and investigate its computational complexity. Our theoretical results demonstrate that this specific OCSGP remains intractable even under restrictive assumptions. Subsequently, we develop a generic evolutionary algorithm framework (EAF) to find an approximately optimal overlapping coalition structure (OCS) in time quartic polynomial in the size of the instance. Particularly, we devise a specific solution-repair based heuristic of cubic time complexity to generate a feasible OCS. Finally, we compare the proposed EAF with a task-oriented heuristic and a hybrid algorithm for OCSGP, and examine its applicability in the pursuit-evasion problem. The experimental results reveal that the proposed EAF exhibits superior performance in finding feasible OCSs and demonstrates flexible adaptability to problem size and resource status. ©2025 The Authors.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

On Strong Secrecy for Multiple Access Channels With States and Causal CSI

引用

IEEE Transactions on Information Theory 2025年第4期71卷 3070-3099页

作者： Chen, Yiqi Oechtering, Tobias J. Skoglund, Mikael Luo, Yuan Technical University of Munich Chair of Theoretical Information Technology Munich80333 Germany Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China KTH Royal Institute of Technology Division of Information Science and Engineering School of Electrical Engineering and Computer Science Stockholm100 44 Sweden Shanghai Key Laboratory of Trusted Data Circulation and Governance and Web3 Shanghai200240 China

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states, and the channel state information (CSI) is revealed to the encoders in a causal manner. The main results of this paper are inner and outer bounds of the capacity region, for which we investigate coding schemes incorporating wiretap coding and secret key agreements between the sender and the legitimate receiver. Two kinds of block Markov coding schemes are proposed. The first is a new coding scheme that uses backward decoding and the Wyner-Ziv coding, and the secret key is constructed from a lossy description of the CSI. The other is an extended version of an existing coding scheme for point-to-point wiretap channels with causal CSI. A numerical example shows that the achievable region given by the first coding scheme can be strictly larger than the second one. However, these two schemes do not outperform each other in general, and there exist some numerical examples in which each coding scheme achieves some rate pairs that cannot be achieved by another scheme. Our established inner bound reduces to some best-known results in the literature as special cases. We further investigate some capacity-achieving cases for state-dependent multiple access wiretap channels (SD-MAWCs) with degraded message sets. It turns out that the two coding schemes are both optimal in these cases. © 1963-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：