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

NLOS/LOS Classification by Constructing Indirect Environment Interaction From GNSS Receiver Measurements Using a Transformer-Based Deep Learning Model

NLOS/LOS Classification by Constructing Indirect Environment...

引用

2023 International Technical Meeting of The Institute of Navigation, ITM 2023

作者： Li, Zhenni Zeng, Kungan Wang, Lujia Kan, Xie Yuan, Rong Xie, Shengli School of Automation Guangdong University of Technology Guangzhou510006 China Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China School of Software and Engineering Sun Yat-sen University Hong Kong Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong Techtotop Microelectronics Technology Co. Ltd Guangzhou510006 China Guangdong Key Laboratory of IoT Information Technology Guangzhou510006 China

ISBN: (纸本)9781713871378

The blockage of the direct signal by high-rise buildings degrades the positioning performance of the global navigation satellite system (GNSS) in urban canyons. Traditional methods usually distinguish the line-of-sight (LOS), and non-line-of-sight (NLOS) signals using the satellite’s elevation angle or signal strength to mitigate the issue, which cannot obtain satisfactory classification accuracy in complex urban environments. Recently, machine learning-based methods using GNSS measurements have been developed to improve GNSS signal classification. However, dynamic changes in environments and the limited features from the measurements raise a challenge to the classification performance of algorithms. To address the above issues, a transformer-based deep learning model in this paper is proposed for LOS and NLOS signal classification. The innovation of our proposed model is using the self-attention mechanism to construct the indirect environment interaction for learning the representation of environmental information. First, the measurements of captured satellites in the same epoch will be fed into the model. The model’s feature extraction layer can learn the fundamental representation. Then, the self-attention module can construct the indirect environment interaction by computing the relevance between the satellites. Finally, the module’s output is transferred to the output layer for classification. A comparative experimental study is conducted with real-world data collected in urban canyons. The results demonstrate that our model can keep more than 90% classification accuracy while support vector machine (SVM) and multilayer perception (MLP) decline to about 80% with the sites increasing. © 2023 Proceedings of the International Technical Meeting of The Institute of Navigation, ITM.

关键词： Satellites

来源：评论

学校读者我要写书评

暂无评论

Spatial Consistency and Feature Diversity Regularization in Transfer Learning for Fine-Grained Visual Categorization

Spatial Consistency and Feature Diversity Regularization in ...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Dai, Zhigang Chen, Junying Mian, Ajmal South China University of Technology Key Laboratory of Big Data and Intelligent Robot Ministry of Education School of Software Engineering Guangzhou China The University of Western Australia Department of Computer Science Perth Australia

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Fine-grained visual categorization is challenged by limited training data by localizing discriminative regions and learning diverse features. We propose an effective regularization method that simultaneously imposes spatial consistency and feature diversity on CNN feature maps from a unified perspective. The former guides different feature map channels to concentrate collaboratively on the discriminative areas while the latter ensures that the feature maps are diverse. The proposed method does not require additional supervision, and leverages the covariance matrix of multi-channel feature maps to regularize the loss at the last convolutional layer where the semantic information is the richest. This allows the influence to be backpropagated to update all convolutional layers. We perform experiments using four network architectures for transfer learning from two source domains to three target domains, and demonstrate that our regularization method improves accuracy in all different settings. The proposed regularization method achieves state-of-the-art performance on CUB-200-2011, Stanford-Cars, and Stanford-Dogs datasets with 89.8%, 94.6%, and 88.5% accuracy, respectively. © 2022 IEEE.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

AdvMask: A Sparse Adversarial Attack Based Data Augmentation Method for Image Classification

arXiv

引用

arXiv 2022年

作者： Yang, Suorong Li, Jinqiao Zhao, Jian Shen, Furao State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing210023 China The State Key Laboratory for Novel Software Technology School of Electronic Science and Engineering Nanjing University Nanjing210023 China

Data augmentation is a widely used technique for enhancing the generalization ability of convolutional neural networks (CNNs) in image classification tasks. Occlusion is a critical factor that affects on the generalization ability of image classification models. In order to generate new samples, existing data augmentation methods based on information deletion simulate occluded samples by randomly removing some areas in the images. However, those methods cannot delete areas of the images according to their structural features of the images. To solve those problems, we propose a novel data augmentation method, AdvMask, for image classification tasks. Instead of randomly removing areas in the images, AdvMask obtains the key points that have the greatest influence on the classification results via an end-to-end sparse adversarial attack module. Therefore, we can find the most sensitive points of the classification results without considering the diversity of various image appearance and shapes of the object of interest. In addition, a data augmentation module is employed to generate structured masks based on the key points, thus forcing the CNN classification models to seek other relevant content when the most discriminative content is hidden. AdvMask can effectively improve the performance of classification models in the testing process. The experimental results on various datasets and CNN models verify that the proposed method outperforms other previous data augmentation methods in image classification tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

3D Gaussian Splatting: Survey, Technologies, Challenges, and Opportunities

arXiv

引用

arXiv 2024年

作者： Bao, Yanqi Ding, Tianyu Huo, Jing Liu, Yaoli Li, Yuxin Li, Wenbin Gao, Yang Luo, Jiebo State Key Laboratory for Novel Software Technology Nanjing University 210023 China Applied Sciences Group Microsoft Corporation Redmond United States Department of Computer Science University of Rochester United States

3D Gaussian Splatting (3DGS) has emerged as a prominent technique with the potential to become a mainstream method for 3D representations. It can effectively transform multiview images into explicit 3D Gaussian through efficient training, and achieve real-time rendering of novel views. This survey aims to analyze existing 3DGS-related works from multiple intersecting perspectives, including related tasks, technologies, challenges, and opportunities. The primary objective is to provide newcomers with a rapid understanding of the field and to assist researchers in methodically organizing existing technologies and challenges. Specifically, we delve into the optimization, application, and extension of 3DGS, categorizing them based on their focuses or motivations. Additionally, we summarize and classify nine types of technical modules and corresponding improvements identified in existing works. Based on these analyses, we further examine the common challenges and technologies across various tasks, proposing potential research opportunities. © 2024, CC BY.

关键词： 3D modeling

来源：评论

学校读者我要写书评

暂无评论

Locating Framework-specific Crashing Faults with Compact and Explainable Candidate Set

Locating Framework-specific Crashing Faults with Compact and...

引用

International Conference on software Engineering (ICSE)

作者： Jiwei Yan Miaomiao Wang Yepang Liu Jun Yan Long Zhang Technology Center of Software Engineering Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

Nowadays, many applications do not exist independently but rely on various frameworks or libraries. The frequent evolution and the complex implementation of framework APIs induce lots of unexpected post-release crashes. Starting from the crash stack traces, existing approaches either perform application-level call graph (CG) tracing or construct datasets with similar crash-fixing records to locate buggy methods. However, these approaches are limited by the completeness of CG or dependent on historical fixing records, and some of them only focus on specific manually modeled exception types. To achieve effective debugging on complex framework-specific crashes, we propose a code-separation-based locating approach that weakly relies on CG tracing and does not require any prior knowledge. Our key insight is that one crash trace with the description message can be mapped to a definite exception-thrown point in the framework, the semantics analysis of which can help to figure out the root causes of the crash-triggering procedure. Thus, we can pre-construct reusable summaries for all the framework-specific exceptions to support fault localization in application code. Based on that idea, we design the exception-thrown summary (ETS) that describes both the key variables and key APIs related to the exception triggering. Then, we perform static analysis to automatically compute such summaries and make a data-tracking of key variables and APIs in the application code to get the ranked buggy candidates. In the scenario of locating Android framework-specific crashing faults, our tool CrashTracker exhibited an overall MRR value of 0.91 and outperforms the state-of-the-art tool Anchor with higher precision. It only provides a compact candidate set and gives user-friendly reports with explainable reasons for each candidate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PRAD: Unsupervised KPI Anomaly Detection by Joint Prediction and Reconstruction of Multivariate Time Series 19

PRAD: Unsupervised KPI Anomaly Detection by Joint Prediction...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Xiong, Zhiying Fan, Qilin Wang, Kai Li, Xiuhua Zhang, Xu Xiong, Qingyu Chongqing University School of Big Data and Software Engineering Chongqing China Chongqing University Chongqing Key Laboratory of Digital Cinema Art Theory and Technology Chongqing China Harbin Institute of Technology School of Computer Science and Technology Weihai China Harbin Institute of Technology Research Institute of Cyberspace Security Weihai China Haihe Laboratory of Information Technology Application Innovation Tianjin China University of Exeter Department of Computer Science Exeter United Kingdom

ISBN: (纸本)9798350346558

Detecting anomalies for key performance indicator (KPI) data is of paramount importance to ensure the quality and reliability of network services. However, building the anomaly detection system for KPI is challenging due to the scarcity of abnormal labels and highly dynamic or even unseen patterns. In this paper, we propose an unsupervised KPI anomaly detection framework named PRAD by jointly optimizing prediction-based and reconstruction-based modules. Specifically, PRAD employs two parallel graph attention networks (GATs) to learn metric-oriented and time-oriented relationships. A temporal convolutional attention network (TCAN) is used to capture complex long-term dependencies. Furthermore, to tackle the overfitting issue in the variational auto-encoder (VAE), PRAD designs a reconstruction-based module that combines VAE with a generative adversarial network (GAN). The experimental results on the two public datasets demonstrate that the proposed PRAD outperforms existing anomaly detection methods. © 2022 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Weighted Poisson-disk Resampling on Large-Scale Point Clouds

arXiv

引用

arXiv 2024年

作者： Jiao, Xianhe Lv, Chenlei Zhao, Junli Yi, Ran Wen, Yu-Hui Pan, Zhenkuan Wu, Zhongke Liu, Yong-Jin College of Computer Science and Technology Qingdao University China College of Computer Science and Software Engineering Shenzhen University China Department of Computer Science and Engineering Shanghai Jiao Tong University China School of Computer Science & Technology Beijing Jiaotong University China School of Artificial Intelligence Beijing Normal University China Department of Computer Science and Technology MOE-Key Laboratory of Pervasive Computing Tsinghua University China

For large-scale point cloud processing, resampling takes the important role of controlling the point number and density while keeping the geometric consistency. However, current methods cannot balance such different requirements. Particularly with large-scale point clouds, classical methods often struggle with decreased efficiency and accuracy. To address such issues, we propose a weighted Poisson-disk (WPD) resampling method to improve the usability and efficiency for the processing. We first design an initial Poisson resampling with a voxel-based estimation strategy. It is able to estimate a more accurate radius of the Poisson-disk while maintaining high efficiency. Then, we design a weighted tangent smoothing step to further optimize the Voronoi diagram for each point. At the same time, sharp features are detected and kept in the optimized results with isotropic property. Finally, we achieve a resampling copy from the original point cloud with the specified point number, uniform density, and high-quality geometric consistency. Experiments show that our method significantly improves the performance of large-scale point cloud resampling for different applications, and provides a highly practical solution. Copyright © 2024, The Authors. All rights reserved.

关键词： Poisson distribution

来源：评论

学校读者我要写书评

暂无评论

Compromising Rechargeable Sensor Networks in Marine Environment

引用

IEEE Transactions on Mobile Computing 2025年

作者： Wang, Qiwei Lin, Chi Dai, Haipeng Obaidat, Mohammad S. Hsiao, Kuei-Fang Fan, Xin Dalian University of Technology School of Software Technology & DUT-RU International School of Information Science and Engineering China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian116620 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China SRM University Department of Computational Intelligence School of Computing SRM Nagar TN Kattankulathur603203 India The Amity University School of Engineering UP Noida201301 India The King Abdullah II School of Information Technology The University of Jordan Amman11942 Jordan

Marine Wireless Rechargeable Sensor Networks (MWRSNs), enhanced by recent Wireless Power Transfer (WPT) technology, present a significant advancement in extending network life. Traditional methods improve network performance through algorithm optimization, but neglect charging security, exposing networks to potential attacks. This paper addresses this problem from an adversarial view and develops a novel attack for MWRSN through Denying of Charge (DoC) to maximize network destructiveness. We start by establishing a generalized on-demand charging model, essential for developing DoC tactics. Subsequently, we unveil the Collaborative DoC (CoDoC) algorithm, capable of manipulating and falsifying charging requests. Central to CoDoC is the Request Prediction Method (RPM), which forecasts the initiation of charging requests and facilitates rapid request surges to enhance the attack's efficacy. CoDoC is able to disguise the presence of the attack, which is able to escape from being detected by the base station. Theoretical analyses are provided to explore the features of the proposed scheme. To demonstrate the outperformed features of the proposed schemes, extensive simulations and test-bed experiments are conducted. Our analysis and extensive simulations demonstrate that CoDoC increases sensor node failures by 20% to 142% compared to traditional methods, highlighting its effectiveness in marine environments. © 2002-2012 IEEE.

关键词： Charging stations

来源：评论

学校读者我要写书评

暂无评论

Policy Learning from Tutorial Books via Understanding, Rehearsing and Introspecting 38

Policy Learning from Tutorial Books via Understanding, Rehea...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Chen, Xiong-Hui Wang, Ziyan Du, Yali Jiang, Shengyi Fang, Meng Yu, Yang Wang, Jun National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China Cooperative AI Lab Department of Informatics King's College London United Kingdom AI Centre Department of Computer Science University College London United Kingdom University of Liverpool United Kingdom The University of Hong Kong Hong Kong

When humans need to learn a new skill, we can acquire knowledge through written books, including textbooks, tutorials, etc. However, current research for decision-making, like reinforcement learning (RL), has primarily required numerous real interactions with the target environment to learn a skill, while failing to utilize the existing knowledge already summarized in the text. The success of Large Language Models (LLMs) sheds light on utilizing such knowledge behind the books. In this paper, we discuss a new policy learning problem called Policy Learning from tutorial Books (PLfB) upon the shoulders of LLMs' systems, which aims to leverage rich resources such as tutorial books to derive a policy network. Inspired by how humans learn from books, we solve the problem via a three-stage framework: Understanding, Rehearsing, and Introspecting (URI). In particular, it first rehearses decision-making trajectories based on the derived knowledge after understanding the books, then introspects about the imaginary dataset to distill a policy network. We build two benchmarks for PLfB based on Tic-Tac-Toe and Football games. In the experiment, URI's policy achieves a minimum of 44% net winning rate against GPT-based agents without any real data. In the much more complex football game, URI's policy beat the built-in AIs with a 37% winning rate while GPT-based agents can only achieve a 6% winning rate. The project page: ***. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：