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

2023 SAR in Big Data Era, BIGSARDATA 2023

作者： Han, Fangzhou Zhang, Lamei Dong, Hongwei Harbin Institute of Technology Department of Information Engineering Harbin150001 China Institute of Software Chinese Academy of Sciences Science & Technology on Integrated Information System Laboratory Beijing China

ISBN: (纸本)9798350326239

Benefiting from the rapid advancements in Deep Learning (DL), data-driven features exhibit remarkable separability in PolSAR image classification. However, data-driven features are challenging to interpret and susceptible to resolution and noise. On the contrary, polarimetric features based on the target decomposition not only have high robustness, but also has physical interpretability. Consequently, researchers have begun to explore ways to integrate both types of features to achieve enhanced performance, which typically concat the data-driven features and polarimetric features directly. However, polarimetric features are not stable in separability, which is because the inherent defects of the target decomposition algorithm. To mitigate the adverse effects of low-quality features, this paper proposes a trusted polarimetric feature fusion (TPFF). The new paradigm calculates the confidence of features and employs a novel feature fusion method. The proposed method has been tested on the EMISAR Foulum dataset, with experimental results demonstrating improved classification performance and robustness. © 2023 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive 3D Routing Protocol for Flying Ad Hoc Networks Based on Prediction-Driven Q-Learning

引用

China Communications 2022年第5期19卷 302-317页

作者： Min Zhang Chao Dong Simeng Feng Xin Guan Huichao Chen Qihui Wu The Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information TechnologyNanjing University of Aeronautics and AstronauticsNanjing 210016China School of Software Engineering Tongji UniversityShanghai 201804China

The routing protocols are paramount to guarantee the Quality of Service(QoS)for Flying Ad Hoc Networks(FANETs).However,they still face several challenges owing to high mobility and dynamic *** paper mainly focuses on the adaptive routing protocol and proposes a Three Dimensional Q-Learning(3DQ)based routing protocol to guarantee the packet delivery ratio and improve the *** 3DQ routing,we propose a Q-Learning based routing decision scheme,which contains a link-state prediction module and routing decision *** link-state prediction module allows each Unmanned Aerial Vehicle(UAV)to predict the link-state of Neighboring UAVs(NUs),considering their Three Dimensional mobility and packet ***,UAV can produce routing decisions with the help of the routing decision module considering the *** evaluate the various performance of 3DQ routing,and simulation results demonstrate that 3DQ can improve packet delivery ratio,goodput and delay of baseline protocol at most 71.36%,89.32%and 83.54%in FANETs over a variety of communication scenarios.

关键词： routing unmanned aerial vehicles(UAVs) flying ad hoc networks(FANETs) prediction Q-Learning

来源：评论

学校读者我要写书评

暂无评论

Fast resistivity imaging of transient electromagnetic using an extreme learning machine

引用

Soft Computing 2025年第2期29卷 1121-1131页

作者： Li, Ruiyou Zhang, Yong Li, Guang Li, Ruiheng Hu, Jia Li, Min School of Software and Internet of Things Engineering Jiangxi University of Finance and Economics NanChang330013 China School of Geophysics and Measurement Control Technology East China University of Technology NanChang330013 China School of Information Engineering Hubei University of Economics Wuhan430205 China The State Key Laboratory of Power Transmission Equipment and System Security and New Technology Chongqing University Chongqing400044 China

The transient electromagnetic method (TEM) is widely used in geophysical exploration. In TEM data interpretation, nonlinear inversion plays an important role. However, traditional TEM nonlinear inversion adopts the OCCAM imaging method, which merely presents the approximate shape of the stratum model, with poor inversion accuracy and much iteration time. To solve the above problems, a novel nonlinear inversion approach based on extreme learning machine (ELM) is proposed in this paper. The ELM is required to establish the input–output mapping relationship of the inversion network only once through the analytical method, which is different from the traditional neural network method that demands iterative gradient learning and is prone to fall into the local optimum. Moreover, the ELM inversion network by randomly assigning the hidden layer parameters is capable of mapping the observed TEM data and quickly producing resistivity images, which avoids time-consuming iteration and inversion calculations. The presented approach is applied to both synthetic and field examples. The results show that compared with the traditional nonlinear inversion algorithms (BP and OCCAM), the proposed method achieves better inversion accuracy and significantly reduces the calculation time, which verifies the effectiveness of the ELM algorithm for TEM data interpretation. Additionally, the research provides a new method and technology for TEM data inversion. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Electromagnetic transients

来源：评论

学校读者我要写书评

暂无评论

RSP-gcForest: A Distributed Deep Forest via Random Sample Partition

RSP-gcForest: A Distributed Deep Forest via Random Sample Pa...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Li, Mark Junjie Cai, Wenzhu Lin, Yigang Huang, Sunjie Huang, Joshua Zhexue Peng, Patrick Xiaogang Shenzhen University College of Computer Science and Software Engineering Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen Academy of Inspection and Quarantine China

ISBN: (纸本)9798350324457

Deep Forest, a powerful alternative to deep neural networks, has gained much attention due to its advantages, such as low complexity, minimal hyperparameter requirements, and strong application performance. In the current big data environment, where data volumes and model complexities are growing rapidly, distributed computing is needed to increase computational efficiency. Recently, a distributed deep forest approach, called BLB-gcForest (Bag of Little Bootstraps-gcForest), has been successful in reducing training instances within cascade forests, combining BLB and granularity segmentation, thus improving the computational efficiency and scalability of distributed deep forests. However, it still transmits the entire data set between layers and requires double sampling with BLB, limiting the amount of data and the scalability of resource utilization. This paper introduces a novel algorithm, RSP-gcForest, based on Random Sample Partition (RSP) to improve distributed deep forests computational efficiency and scalability. RSP-gcForest uses block-level samples that replace the full dataset, significantly reducing interlayer instance transmission and prediction within cascade forests. Additionally, RSP blocks are integrated with the segmentation granularity of cascade forests for ensemble learning, effectively addressing computational efficiency and resource constraints. We conducted experiments on four extensive datasets using Spark and evaluated performance across five key metrics. The results clearly show that RSP-gcForest, while maintaining high classification quality, surpasses state-of-the-art methods in terms of computational efficiency and resource utilization. Furthermore, it achieves superior load balancing, demonstrating its potential as a powerful tool in big data and distributed computing. © 2023 IEEE.

关键词： Deep forest Distributed Computing Ensemble Learning Random Sample Partition

来源：评论

学校读者我要写书评

暂无评论

DasAtom: A Divide-and-Shuttle Atom Approach to Quantum Circuit Transformation

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and systems 2025年

作者： Huang, Yunqi Gao, Dingchao Ying, Shenggang Li, Sanjiang Faculty of Engineering and Information Technology SydneyNSW2007 Australia Institute of Software Chinese Academy of Sciences Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science China

Neutral atom (NA) quantum systems are emerging as a leading platform for quantum computation, offering superior or competitive qubit count and gate fidelity compared to superconducting circuits and ion traps. However, the unique features of NA devices, such as long-range interactions, long qubit coherence time, and the ability to physically move qubits, present distinct challenges for quantum circuit compilation. In this paper, we introduce DasAtom, a novel divide-and-shuttle atom approach designed to optimise quantum circuit transformation for NA devices by leveraging these capabilities. DasAtom partitions circuits into subcircuits, each associated with a qubit mapping that allows all gates within the subcircuit to be directly executed. The algorithm then shuttles atoms to transition seamlessly from one mapping to the next, enhancing both execution efficiency and overall fidelity. For a 30-qubit Quantum Fourier Transform (QFT), DasAtom achieves a 415.8x improvement in fidelity over the move-based algorithm Enola and a 10.6x improvement over the SWAP-based algorithm Tetris. Notably, this improvement is expected to increase exponentially with the number of qubits, positioning DasAtom as a highly promising solution for scaling quantum computation on NA platforms. © 1982-2012 IEEE.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Bi-Directional and Triangular Circulation Fusion Neural Networks for Small Object Detection

引用

IEEE Transactions on Circuits and systems for Video Technology 2024年第6期35卷 5140-5152页

作者： Li, Fangyu Duan, Junzhu Zhang, Qiyu Shan, Caifeng Han, Honggui the School of Information Science and Technology Beijing Key Laboratory of Computational Intelligence and Intelligent System Engineering Research Center of Digital Community Ministry of Education Beijing Artificial Intelligence Institute Beijing University of Technology Beijing100124 China the State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China the School of Intelligence Science and Technology Nanjing University Suzhou215163 China

Deep learning-driven object detection models are capable of accurately identifying and localizing objects. However, small objects contain limited information relative to global features, resulting in the fact that detection models often do not learn small object features adequately. To enhance the precision in detecting small objects, we propose a bi-directional and triangular circulation fusion neural network (BTFN). First, to selectively strengthen the position features of small objects, we propose a feature circulation extraction module composed of a bi-directional triangular densely nested convolutional network (BTF), thus achieving repetitive multi-layer feature fusion. Second, to fill up the semantic gaps between different scales of features, we design a mixed dual attention module (MDA) in the bi-directional triangular densely nested network. Third, to mitigate the lost information in the neural networks with deep layers as well as improve the inference time, we design a re-parameterization bi-directional composite feature fusion module (Rep-BFM) that fuses the features of multiple scales. The proposed model is evaluated extensively on the MS COCO, Tsinghua-Tencent 100k, and Haier dismantled parts of used home appliances datasets. The experiment results show that the proposed model improves the AP on MS COCO by 4%, especially the APS of small objects is improved by 7.7% compared with SOTA models. © 2024 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Domestic appliances

来源：评论

学校读者我要写书评

暂无评论

EagerLog: Active Learning Enhanced Retrieval Augmented Generation for Log-based Anomaly Detection

EagerLog: Active Learning Enhanced Retrieval Augmented Gener...

引用

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

作者： Duan, Chiming Jia, Tong Yang, Yong Liu, Guiyang Liu, Jinbu Zhang, Huxing Zhou, Qi Li, Ying Huang, Gang School of Software and Microelectronics Peking University Beijing China Institute for Artificial Intelligence Peking University Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China National Key Laboratory of Data Space Technology and System Beijing China Alibaba Cloud Computing Company Hangzhou China

ISBN: (纸本)9798350368741

Logs record essential information about system operations and serve as a critical source for anomaly detection, which has generated growing research interest. Utilizing large language models (LLMs) within a retrieval-augmented generation (RAG) framework for log-based anomaly detection is an effective approach due to its strong generalization capabilities and efficient few-shot performance. However, the effectiveness of this method hinges on the quality of the knowledge source, which can be impacted by noise and changes within the software systems. Facing these problems, in this paper, we propose a novel log-based anomaly detection method named EagerLog, employing active learning to choose the logs for humans to label, thereby adding them to the knowledge source, thus enhancing the knowledge source and maintaining its quality. Our experiments on three open datasets (BGL, Thunderbird, Zookeeper) and one industrial dataset demonstrate that EagerLog can achieve 93.65% F1 score with approximately 10 labeled log sequences, surpassing existing methods by 15.32%. © 2025 IEEE.

关键词： Active Learning Anomaly Detection Log Analysis Retrieval Augmented Generation

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of Computer Science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need 38

Unlearnable 3D Point Clouds: Class-wise Transformation Is Al...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：