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

IEEE International Conference on Image Processing

作者： Xiao Jiang Fei Zhou College of Electronic and Information Engineering Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen China Guangdong-Hong Kong Joint Laboratory for Big Data Imaging and Communication China Peng Cheng Laboratory Shenzhen China

ISBN: (数字)9798350349399

ISBN: (纸本)9798350349405

Dynamic Vision Sensors (DVS) have recently generated great interest because of the advantages of wide dynamic range and low latency compared with conventional frame-based cameras. However, the complicated behaviors in dim light conditions are still not clear, restricting the applications of DVS. In this paper, we analyze the typical DVS circuit, and find that there exists discontinuity of event triggering time. In dim light conditions, the discontinuity becomes prominent. We point out that the discontinuity depends exclusively on the changing speed of intensity of light. Experimental results on real event data validate the analysis and the existence of discontinuity that reveals the non-first-order behaviors of DVS in dim light conditions.

关键词： Delay effects Image processing Vision sensors Cameras High dynamic range Voltage control Low latency communication

来源：评论

学校读者我要写书评

暂无评论

Dynamical relaxation of a long-range XY chain

arXiv

引用

arXiv 2023年

作者： Huang, Yu-Huan Zou, Yin-Tao Ding, Chengxiang School of Microelectronics & Data Science Anhui University of Technology Maanshan243002 China Anhui Provincial Joint Key Laboratory of Disciplines for Industrial Big Data Analysis and Intelligent Decision Maanshan243002 China

We study the universal real-time relaxation behaviors of a long-range quantum XY chain following a quench. Our research includes both the noncritical and critical quench. In the case of noncritical quench, i.e., neither the initial state nor the postquench Hamiltonian is at a critical point of equilibrium phase transition, a quench to the commensurate phase or incommensurate phase gives a scaling of t−3/2 or t−1/2, respectively, which is the same as the counterpart of the short-range XY model. However, for a quench to the boundary line between the commensurate and incommensurate phases, the scaling law t−µ may be different from the t−3/4 law of the counterpart of the short-range model. More interestingly, the decaying exponent µ may depend on the choice of the parameters of the postquench Hamiltonian because of the different asymptotic behaviors of the energy spectrum. Furthermore, in certain cases, the scaling behavior may be outside the range of predictions made by the stationary phase approximation, because an inflection point emerges in the energy spectrum. For the critical quench, i.e., the initial state or the postquench Hamiltonian is at a critical point of equilibrium phase transition, the aforementioned scaling law t−µ may be changed because of the gap-closing property of the energy spectrum of the critical point. © 2023, CC BY.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

FGPrompt: Fine-grained Goal Prompting for Image-goal Navigation

arXiv

引用

arXiv 2023年

作者： Sun, Xinyu Chen, Peihao Fan, Jugang Li, Thomas H. Chen, Jian Tan, Mingkui South China University of Technology China Pazhou Laboratory China Information Technology R&D Innovation Center of Peking University China Peking University Shenzhen Graduate School China Key Laboratory of Big Data and Intelligent Robot Ministry of Education Hong Kong

Learning to navigate to an image-specified goal is an important but challenging task for autonomous systems. The agent is required to reason the goal location from where a picture is shot. Existing methods try to solve this problem by learning a navigation policy, which captures semantic features of the goal image and observation image independently and lastly fuses them for predicting a sequence of navigation actions. However, these methods suffer from two major limitations. 1) They may miss detailed information in the goal image, and thus fail to reason the goal location. 2) More critically, it is hard to focus on the goal-relevant regions in the observation image, because they attempt to understand observation without goal conditioning. In this paper, we aim to overcome these limitations by designing a Fine-grained Goal Prompting (FGPrompt) method for image-goal navigation. In particular, we leverage fine-grained and high-resolution feature maps in the goal image as prompts to perform conditioned embedding, which preserves detailed information in the goal image and guides the observation encoder to pay attention to goal-relevant regions. Compared with existing methods on the image-goal navigation benchmark, our method brings significant performance improvement on 3 benchmark datasets (i.e., Gibson, MP3D, and HM3D). Especially on Gibson, we surpass the state-of-the-art success rate by 8% with only 1/50 model size. Copyright © 2023, The Authors. All rights reserved.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

CLSDRL:A routing optimization method for traffic feature extraction

CLSDRL:A routing optimization method for traffic feature ext...

引用

2021 International Conference on Networking and Network Applications, NaNA 2021

作者： Xia, Hong Li, Jianguo Chen, Yanping Lv, Ning Wang, ZhongMin Dong, Qingyi Xi'an University of Posts and Telecommunications School of Computer Science and Technology Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

ISBN: (纸本)9781665441582

In order to solve the impact of the temporal and spatial characteristics of traffic on network routing optimization, this paper proposes convolution long-short memory neural network deep reinforcement learning (CLSDRL) model for routing optimization. The CLSDRL model consists of deep deterministic policy gradients (DDPG) deep couple with convolution neural network (CNN) and long-short memory neural network (LSTM). After extracting the spatial and temporal characteristics of network traffic with CNN and LSTM, routing decisions are made with DDPG algorithm. Experiments are conducted under different load intensities, and the network performance is evaluated by the average network delay and packet loss rate, experimental results show that this method can improve significantly network performance. © 2021 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Incorporating Curiosity into Personalized Ranking for Collaborative Filtering 35

Incorporating Curiosity into Personalized Ranking for Collab...

引用

35th AAAI Conference on Artificial Intelligence / 33rd Conference on Innovative Applications of Artificial Intelligence / 11th Symposium on Educational Advances in Artificial Intelligence

作者： Ding, Qiqi Cai, Yi Xu, Ke Zhang, Huakui South China Univ Technol Sch Software Engn Guangzhou Peoples R China South China Univ Technol Minist Educ Key Lab Big Data & Intelligent Robot Guangzhou Peoples R China

ISBN: (纸本)9781577358664

Curiosity affects the users' selections of the items, and it motivates them to explore the items regardless of their preferences. This phenomenon is particularly common in the social networks. However, the existing social-based recommendation methods neglect users' curiosity in the social networks, and it may cause the accuracy decease in recommendation. What's more, only focusing on simulating the users' preferences can lead to information cocoons. In order to tackle the problems, we propose a Curiosity Enhanced Bayesian Personalized Ranking (CBPR) model. Our model makes full use of the theories of psychology to model the users' curiosity aroused when facing different opinions. The experimental results on two public datasets demonstrate the advantages of our CBPR model over the existing models.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Community Evolution Tracking Based on High-Order Neighbor Consideration and Node Change Identification 19th

Community Evolution Tracking Based on High-Order Neighbor C...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Zhang, Yunan Wang, Chaohui Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Community evolution tracking is widely used in complex network analysis, which analyzes and identifies how communities evolve over time based on dynamic community detection. However, the current incremental dynamic community detection method has the phenomenon of ’concept drift’, which leads to inaccurate tracking of community evolution. Although some studies on dynamic community detection have proposed to perform global community detection on the network by timing or when the error information accumulates to a certain extent, this method will lead to a sudden change in community division, which will interrupt the evolution sequence of some communities and bring great difficulties to the continuous tracking of community evolution. In addition, the current community evolution tracking methods match the communities of two adjacent snapshots, and it is difficult to capture the fine-grained evolution process within the community. This paper proposes a community evolution tracking algorithm based on high-order neighbor consideration and node change identification. Firstly, based on an incremental update strategy that considers high-order neighbors, we adaptively expand the scope of incremental updates to reduce the accumulation of error information. Secondly, through the node change identification strategy to mine fine-grained community evolution events. Experiments show that our method can effectively track the evolution of communities in dynamic networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Community evolution Complex network Dynamic network Evolution tracking

来源：评论

学校读者我要写书评

暂无评论

Community-Aware Heterogeneous Graph Contrastive Learning 19th

Community-Aware Heterogeneous Graph Contrastive Learning

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Li, Xinying Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Recently, heterogeneous graph contrastive learning, which can mine supervision signals from the data, has attracted widespread attention. However, most existing methods employ random data augmentation strategies to construct contrastive views, which may destroy the semantic information in heterogeneous graphs. Moreover, they often select positive and negative samples based solely on node-level proximity and overlook hard samples that are difficult to distinguish from anchors. To solve the above problems, we propose a Community-Aware Heterogeneous Graph Contrastive Learning model called CAHGCL. In particular, we design an adaptive data augmentation strategy to construct views, including feature augmentation and topology augmentation. To improve the quality of samples, we propose a dynamic sample weighting strategy based on node similarity and community information, capable of identifying both hard positive samples and hard negative samples. Finally, we introduce community-level contrast to improve community cohesion. Extensive experiments and analyses demonstrate that CAHGCL consistently outperforms state-of-the-art baselines on three datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

DBSSL: A Scheme to Detect Backdoor Attacks in Self-Supervised Learning Models

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Huang, Yuxian Yang, Geng Yuan, Dong Yu, Shui Nanjing University of Posts and Telecommunication College of Computer Science and Software China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing China University of Sydney School of Electrical and Information Engineering Australia University of Technology Sydney School of Computer Science Australia

Recently, self-supervised learning has garnered significant attention for its ability to extract high-quality features from unlabeled data. However, existing research indicates that backdoor attacks can pose significant threats to self-supervised learning. Additionally, due to the substantial training overhead, traditional backdoor detection methods in supervised learning, such as meta-learning, are not well-suited for self-supervised learning. Current backdoor detection methods for self-supervised learning can only defend against backdoor attacks triggered by patch. To address this challenge, we proposes DBSSL, a scheme that can efficiently detect backdoor attacks in self-supervised learning models. In DBSSL, we connect backdoor attacks with adversarial attacks and use adversarial perturbations for detection. Specifically, we first conduct targeted adversarial attacks on the samples, classifying them into different classes. Then, we employ the Z-Score method to analyze these adversarial perturbations. If outliers are present, we can infer that the self-supervised learning model has been backdoored. Unlike previous works, our scheme is better suited for downstream users with constrained computation resources and exhibits excellent detection capabilities for backdoor attacks caused by patch -type or global triggers. Abundant theoretical analysis has demonstrated the feasibility of our scheme. Moreover, extensive experiments show that our method performs well in detecting prevalent backdoor attacks in self-supervised learning, achieving detection accuracy exceeding 95%. © 2004-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

LogPal: A Generic Anomaly Detection Scheme of Heterogeneous Logs for Network Systems

引用

Security and Communication Networks 2023年第1期2023卷

作者： Sun, Lei Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China

As a key resource for diagnosing and identifying problems, network syslog contains vast quantities of information. And it is the main source of data for anomaly detection of systems. Syslog presents the characteristics of large scale, diverse types and sources, data noise, and quick evolvement, which makes the detection methods not generic enough. To effectively address problem of log anomaly labelling caused by massive heterogeneous logs, we propose LogPal, a generic anomaly detection scheme of heterogeneous logs for network systems, which innovatively combines template sequences and raw log sequences to construct and generate log pattern events. By improving the self-attention mechanism of transformer, LogPal proactively synthesizes self-attention and handles log pattern events in a unique way. The model can make full use of log template and sequence semantic information, by automatically becoming aware of the pattern of logs. We implemented experiments to evaluate the performance of LogPal on publicly available datasets, and the outcome of the experiments shows that LogPal automatically adapts to log type changes and improves precision, recall, and F1 score to 99% on publicly available datasets. © 2023 Lei Sun and Xiaolong Xu.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

MNN: Mixed Nearest-Neighbors for Self-Supervised Learning

arXiv

引用

arXiv 2023年

作者： Long, Xianzhong Peng, Chen Li, Yun School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

In contrastive self-supervised learning, positive samples are typically drawn from the same image but in different augmented views, resulting in a relatively limited source of positive samples. An effective way to alleviate this problem is to incorporate the relationship between samples, which involves including the top-K nearest neighbors of positive samples. However, the problem of false neighbors (i.e., neighbors that do not belong to the same category as the positive sample) is an objective but often overlooked challenge due to the query of neighbor samples without supervision information. In this paper, we present a simple self-supervised learning framework called Mixed Nearest-Neighbors for Self-Supervised Learning (MNN). MNN optimizes the influence of neighbor samples on the semantics of positive samples through an intuitive weighting approach and image mixture operations. The results demonstrate that MNN exhibits exceptional generalization performance and training efficiency on four benchmark datasets. © 2023, CC BY.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：