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

Bioinspired polarized light compass in moonlit sky for heading determination based on probability density estimation

引用

Chinese Journal of Aeronautics 2022年第3期35卷 1-9页

作者： Yueting YANG Yan WANG Lei GUO Bo TIAN Jian YANG Wenshuo LI Taihang CHEN School of Automation Science and Electrical Engineering Beihang UniversityBeijing 100083China Beijing Advanced Innovation Center for Big Data-Based Precision Medicine School of Medicine and EngineeringBeihang UniversityBeijing 100083China Key Laboratory of Big Data-Based Precision Medicine Ministry of Industry and Information TechnologyBeihang UniversityBeijing 100083China Hangzhou Innovation Institute Beihang UniversityBeijing 100083China School of Cyber Science and Technology Beihang UniversityBeijing 100083China

Bioinspired polarized skylight navigation,which can be used in unfamiliar territories,is an important alternative autonomous navigation technique in the absence of Global Navigation Satellite System(GNSS).However,the polarization pattern in night environment with noise effects and model uncertainties is a less explored *** several decades have passed since the first publication about the polarization of the moonlit night sky,the usefulness of nocturnal polarization navigation is only sporadic in previous *** study demonstrates that the nocturnal polarized light is capable of providing accurate and stable navigation information in dim light outdoor *** on the statistical characteristics of Angle of Polarization(Ao P)error,a probability density estimation method is proposed for heading *** illustrate the application potentials,the simulation and outdoor experiments are ***,the proposed method robustly models the distribution of Ao P error and gives accurate heading estimation evaluated by Standard Deviation(STD)which is 0.32°in a clear night sky and 0.47°in a cloudy night sky.

关键词： Nocturnal polarization Moonlit sky Angle of Polarization(AoP) Probability density estimation Navigation

来源：评论

学校读者我要写书评

暂无评论

Detecting Ethereum Phishing Scams via Multi-transaction-view Graph Attention Network 29

Detecting Ethereum Phishing Scams via Multi-transaction-view...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zhuo, Shaoxuan Li, Guang Wu, Weigang Bian, Jing Sun Yat-Sen University School of Computer Science and Engineering Guangzhou China Guangdong Province Key Laboratory of Big Data Analysis and Processing China Sun Yat-Sen University Guangdong Province Key Laboratory of Computational Science Guangzhou China

ISBN: (纸本)9798350330717

Cryptocurrency phishing scams is a significant treat to Ethereum, one of the most popular blockchain platforms. Most of existing Ethereum phishing detection methods are based on traditional machine learning or graph representation learning, which mostly rely on only statistical and structural features in local scope. In this paper, we propose Multi-transaction-view Graph Attention Network (MTvGAT), a novel phishing scam detection model that can make use of transaction patterns of different scopes. To obtain global-view information, we apply graph clustering and construct the global-view graph with multiple clusters, including all the nodes of the original transaction network. To obtain local view information, we apply neighborhood sampling, and construct local-view graphs with target nodes and their neighborhood nodes. Then, node features, edge features, and attention coefficients are aggregated to merge multi-view information into representation of nodes. We further combine global-view and local-view representations to finally identify phishing addresses from target nodes. Extensive experiments demonstrate that the proposed method can outperform existing ones with significant improvement. © 2023 IEEE.

关键词： Ethereum Graph neural network Phishing scams

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

A new method for predicting plant proteins function based on multi label classification algorithm

A new method for predicting plant proteins function based on...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Chen, Shuai Wang, Juan Guo, Maozu Inner Mongolia University School of Computer Science Hohhot China Beijing University of Civil Engineering and Architecture School of Electrical and Information Engineering Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing China

ISBN: (纸本)9781665468190

Protein function annotation is an important content of bioinformatics. It is unrealistic to experimentally annotate a large number of protein functions, so automated prediction of the functions of proteins is required. Studying plant proteins can help us cultivate new plant varieties. However, the existing methods mainly aim at predicting the single function of plant proteins. Most proteins only have sequence information. Therefore, the multi-function prediction method of plant protein based on sequence has become the focus of research. In this study, we propose a method based on sequence to predict the function of plant proteins, called PlantGO. We describe the functional annotation problem as a multi-label classification problem using Gene Ontology (GO) terminology, and predict multiple functions for plant proteins. PlantGO extracts features from three aspects and performs feature fusion respectively. To avoid redundant information in features, PlantGO uses the random forest to select features and obtains three groups of optimal features. PlantGO uses a multi-label learning algorithm MLKNN to predict protein function, which proves the effectiveness and accuracy of the algorithm. Finally, PlantGO adopts the ensemble learning method to integrate all models into a unified model, further improving the prediction performance. Therefore, PlantGO has achieved excellent performance. The performance metrics are Accuracy (0.936), F1 Score (0.944), Ranking loss (0.011), which is better than the previous method in the independent test. We have developed an online server to predict the functions of plant proteins. © 2022 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

GA-Net: Gated Attention Mechanism Based Global Refinement Network for Image Inpainting 29

GA-Net: Gated Attention Mechanism Based Global Refinement Ne...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Qiu, Ran Zhao, Shengrong Liang, Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

Underwater images are often affected by problems such as light attenuation, color distortion, noise and scattering, resulting in image defects. A novel image inpainting method is proposed to intelligently predict and fill damaged areas for complete and continuous visualization of the image. First, in order to effectively solve the problem of color distortion caused by light refraction in underwater environments, the improved gated attention mechanism is used. This mechanism improves the local details by learning and weighting the important features of the image. Second, gated convolution automatically determines the degree of restoration for each pixel based on local features of the original image. It eliminates distractions such as low contrast and scattering, retaining more original detailed information. By doing so, image inpainting techniques improve the quality and visualization of underwater images. © 2023 IEEE.

关键词： Gated convolution Image inpainting Underwater images

来源：评论

学校读者我要写书评

暂无评论

CoT-based Synthesizer: Enhancing LLM Performance through Answer Synthesis

arXiv

引用

arXiv 2025年

作者： Zhang, Bohan Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current inference scaling methods, such as Self-consistency and Best-of-N, have proven effective in improving the accuracy of LLMs on complex reasoning tasks. However, these methods rely heavily on the quality of candidate responses and are unable to produce correct answers when all candidates are incorrect. In this paper, we propose a novel inference scaling strategy, CoT-based Synthesizer, which leverages CoT reasoning to synthesize superior answers by analyzing complementary information from multiple candidate responses, even when all candidate responses are flawed. To enable a lightweight and cost-effective implementation, we introduce an automated data generation pipeline that creates diverse training data. This allows smaller LLMs trained on this data to improve the inference accuracy of larger models, including API-based LLMs. Experimental results across four benchmark datasets with seven policy models demonstrate that our method significantly enhances performance, with gains of 11.8% for Llama3-8B and 10.3% for GPT-4o on the MATH dataset. The corresponding training data and code are publicly available on the repository. Copyright © 2025, The Authors. All rights reserved.

关键词： data accuracy

来源：评论

学校读者我要写书评

暂无评论

Efficient Node Selection for Coding-based Timely Computation over Heterogeneous Systems 21

Efficient Node Selection for Coding-based Timely Computation...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on big data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Lin, Yuxuan Tang, Bin Zhou, Siyuan Xie, Zaipeng Ye, Baoliu Hohai University Key Laboratory of Water Big Data Technology Ministry of Water Resources Nanjing211100 China Hohai University School of Computer and Information Nanjing211100 China Nanjing University National Key Laboratory for Novel Software Technology Nanjing210023 China

ISBN: (纸本)9798350329223

In large-scale distributed systems, computational nodes often experience random slowdown which can degrade the performance of timely computation tasks significantly. Recently, coded computing has emerged as a promising approach where coded subtasks are generated for parallel execution over different nodes. In this paper, we focus on exploring the tradeoff between the performance of coding-based timely computation tasks and the computation cost in distributed systems with heterogeneous nodes. We introduce a node selection problem (NSP), which aims at minimizing the task failure probability by selecting proper participating nodes under a total cost constraint. We show that NSP is NP-hard due to the total cost constraint, and is more challenging since the task failure probability is a complicated multivariate polynomial. By approximating the task failure probability using central limit theorem and establishing relationships with certain integer linear programming problems, we then propose a linear programming relaxation based algorithm with performance guarantee, as well as an efficient Lagrangian relaxation inspired heuristic algorithm. The effectiveness of the proposed node selection algorithms is further demonstrated via both trace-driven and model-driven simulations. © 2023 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Advance of Thyroid Nodule Ultrasound Diagnosis Based on Deep Learning 29th

Advance of Thyroid Nodule Ultrasound Diagnosis Based on Deep...

引用

29th International Conference on Computational and Experimental engineering and Sciences, ICCES 2023

作者： Wan, Huiling Chen, Shuwen Ni, Yiyang Qi, Shaojia Qu, Hui School of Physics and Information Engineering Jiangsu Second Normal University Nanjing211200 China State Key Laboratory of Millimeter Waves Southeast University Nanjing210096 China Jiangsu Province Engineering Research Center of Basic Education Big Data Application Nanjing211200 China

ISBN: (纸本)9783031449468

The incidence of thyroid nodules is increasing rapidly worldwide. In order to reduce the burden on doctors and improve the accuracy of diagnosis, ultrasound imaging plays an important role in the diagnosis and follow-up of thyroid nodules. In recent years, artificial intelligence (AI) technology based on machine learning and deep learning has improved significantly. With the help of medical imaging screening tools, physicians can make clinical decisions about thyroid nodules more efficiently and provide the best protection for patients as early as possible. This paper mainly discusses the research progress of computer vision and related algorithms in ultrasonic imaging of thyroid nodules in recent years from the aspects of image preprocessing, detection and segmentation of focal areas, feature extraction, and identification of benign/malignant nodules. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

TransD-based Multi-hop Meta Learning for Few-shot knowledge Graph Completion

TransD-based Multi-hop Meta Learning for Few-shot Knowledge ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jindi Li Kui Yu Yuling Li Yuhong Zhang Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Few-shot knowledge graph completion (FKGC), which aims to infer missing facts about a relation from only a few reference triples, has recently attracted great attention. The core of solving the FKGC task is to learn a vector representation for each few-shot relation using the corresponding entity represen-tations. To this end, existing models generally enhance entity representations with their direct neighbors. However, a large number of entities have few direct neighbors. Hence, encoding only direct neighborhood is insufficient to obtain satisfactory en-tity representations. In addition, current models typically utilize static embeddings to represent entities, ignoring their diverse semantics, i.e., an entity may show distinct semantics within different few-shot relations. To address these issues, we propose a new FKGC framework, namely TransD-based Multi-hop Meta Learning (TDML). TDML consists of three main components: a multi-hop neighbor encoder to enhance entity representations by aggregating heterogeneous multi-hop neighbors, a transformer encoder to generate the relation meta representations, and a TransD-based relation representation updater that allows each entity to exhibit relation-specific semantics and tune the relation meta representations. Extensive experiments on two public datasets demonstrate that our model outperforms state-of-the-art FKGC methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How to Mitigate information Loss in knowledge Graphs for GraphRAG: Leveraging Triple Context Restoration and Query-Driven Feedback

arXiv

引用

arXiv 2025年

作者： Huang, Manzong Bu, Chenyang He, Yi Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data [Hefei University of Technology Ministry of Education China School of Data Science William & Mary WilliamsburgVA United States

knowledge Graph (KG)-augmented Large Language Models (LLMs) have recently propelled significant advances in complex reasoning tasks, thanks to their broad domain knowledge and contextual awareness. Unfortunately, current methods often assume KGs to be complete, which is impractical given the inherent limitations of KG construction and the potential loss of contextual cues when converting unstructured text into entity-relation triples. In response, this paper proposes the Triple Context Restoration and Query-driven Feedback (TCR-QF) framework, which reconstructs the textual context underlying each triple to mitigate information loss, while dynamically refining the KG structure by iteratively incorporating query-relevant missing knowledge. Experiments on five benchmark question-answering datasets substantiate the effectiveness of TCR-QF in KG and LLM integration, where it achieves a 29.1% improvement in Exact Match and a 15.5% improvement in F1 over its state-of-the-art GraphRAG competitors. © 2025, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：