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

Correlation effects on topological structure in complex network evolution

Physica A: Statistical Mechanics and its Applications 2025年 671卷

作者： Chen, Xiaojie Qiao, Weile Pan, Guijun School of physics Hubei University Hubei Wuhan430062 China Key Laboratory of Intelligent Sensing System and Security Hubei University Ministry of Education Hubei Wuhan430062 China

Network growth model is an important and popular research topic aimed at uncovering the mechanisms of network formation and evolution. Most growth models focus on two key mechanisms: growth and preferential attachment without directly accounting for the correlation effects, existing in many realistic network systems. Here, we propose a preferential correlation growth model by introducing a proximity parameter that controls the proximity between nodes connected to newly added nodes. The smaller the proximity parameter, the shorter the distance between the selected nodes, and the stronger the correlation between them. When the proximity parameter approaches infinity, our model reduces to the BA model. By comparing simulations with different proximity parameter, we find that a high degree of correlation significantly enhances the robustness, both local and global efficiency of the network. Besides, our model demonstrates high clustering coefficient, short average path length, and richer cyclic structures, which are closer to real-world networks. Furthermore, our network model effectively addresses the low clustering coefficient issue of the BA model and provides a better understanding of the cyclic structures in real-world networks. Specially, we find that on the mesoscopic time scale, the correlation effects can significantly improve thermodynamic efficiency from a statistical perspective. Our work shows that correlation should be another key mechanism of network formation in addition to the preferential attachment, deserved to be considered for better understanding of the structure and function of the network. © 2025 Elsevier B.V.

关键词： Growth temperature

来源：评论

学校读者我要写书评

暂无评论

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 Recommendation system Based on Adaptive Genetic Algorithm for Enclosed Spaces 6

A Recommendation System Based on Adaptive Genetic Algorithm ...

引用

6th International Symposium on Autonomous systems, ISAS 2023

作者： Guo, Meng Chen, Songhang Wang, Yaozong Fujian Normal University College of Computer and Cyber Security Fuzhou China Fujian Institute of Research on the Structure of Matter Chinese Academy of Sciences Department of Quanzhou Institute of Equipment Manufacturing Quanzhou China Fujian Provincial Key Laboratory of Intelligent Identification and Control of Complex Dynamic System Department of Quanzhou Institute of Equipment Manufacturing Quanzhou China

ISBN: (纸本)9798350316155

Most of the management systems used in common enclosed spaces only have basic functions such as booking and payment, and do not have epidemic prevention and traceability functions. In the COVID-19 pandemic, enclosed scenes, without an epidemic prevention system, clearly increase the risk of cross-contamination of the population, making it a black box that will amplify the severity of the outbreak. In this paper, we develop an intelligent recommendation system designed to coordinate the operation of enclosed spaces and decentralize the new customers to a low-infection risk box. An adaptive genetic algorithm is proposed to achieve optimal allocation of personnel and boxes, which can avoid contact between customers during low peak hours and minimize cross-contact during peak hours. On the one hand, it guarantees the user experience, and on the other hand, it guarantees these enclosed spaces have a high decentralization of crowd density when an epidemic occurs. This greatly reduces the risk of exposure to infection and is of great significance in preventing the spread of the epidemic. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Robustness May be at Odds with Stability in Adversarial Training based Feature Selection?

Robustness May be at Odds with Stability in Adversarial Trai...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yue Liu Yun Li Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

As an important stage in machine learning pipeline, feature selection techniques are mainly used to improve the generalization performance and training efficiency of machine learning model, but few works have focused on the robustness of machine learning models from the perspective of feature selection when dealing with adversarial attacks. In this paper, we propose the adversarial training (AT) based feature selection framework, i.e. AT based feature selection, to improve the robustness of machine learning model built on the feature selection result, which is inspired by using adversarial training to improve the robustness of deep learning model. AT based feature selection framework is the combination of adversarial training with some traditional feature selection algorithm, which can be divided into AT in-processing and AT post-processing feature selection. On the other hand, stability is also a very important property for feature selection. Then we experimentally analyze the relationship between robustness and stability of AT based feature selection, especially theoretically analyze the stability of $\ell_{2}$ regularized AT in-processing feature selection algorithm in two different adversarial training forms. Our experimental results on benchmark data sets show that AT based feature selection algorithm is effective to improve the robustness of machine learning model, however, obtain lower stability than corresponding feature selection model without AT.

关键词： Training Deep learning Machine learning algorithms Pipelines Benchmark testing Feature extraction Stability analysis

来源：评论

学校读者我要写书评

暂无评论

A Novel Path Planning Algorithm for Multi-Agent Collaboration in Finite Space

A Novel Path Planning Algorithm for Multi-Agent Collaboratio...

引用

IEEE International Conference on Communication and Information systems (ICCIS)

作者： Yihan Xu Tian Cao Xiaotong Shi Manchester Metropolitan Joint Institute Hubei University Wuhan China Ministry of Education Key Laboratory of Intelligent Sensing System and Security (Hubei University) School of Artificial Intelligence HuBei University Wuhan China

ISBN: (数字)9798331531171

ISBN: (纸本)9798331531188

Multi-agent collaboration can complete tasks that are difficult for a single agent to handle, making a big difference on the battlefield, in healthcare, and in other domains. Effective path planning is an important factor in ensuring task execution. However, the finite space increases the probability of multi-agent collisions, which poses a challenge to multi-agent path planning. To this end, we propose a novel path planning algorithm by two-module fusion (PLA-TMF). Specifically, the first module is to develop a collision detection model based on discrete point intersection probabilities, which improves the collision detection accuracy between different agents. Then, the second module is to realize the path planning algorithm under the minimum collision probability constraint, which relies on genetic algorithm. Finally, the effectiveness of the proposed algorithm is verified by simulation experiments under specific scenarios.

关键词： Accuracy Collaboration Medical services Path planning Planning Collision avoidance Information systems Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

The Power of Bamboo: On the Post-Compromise security for Searchable Symmetric Encryption 30

The Power of Bamboo: On the Post-Compromise Security for Sea...

引用

30th Annual Network and Distributed system security Symposium, NDSS 2023

作者： Chen, Tianyang Xu, Peng Picek, Stjepan Luo, Bo Susilo, Willy Jin, Hai Liang, Kaitai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China Cluster and Grid Computing Lab School of Computer Science and Technology China Huazhong University of Science and Technology Wuhan430074 China Digital Security Group Radboud University Nijmegen Netherlands Department of EECS Institute of Information Sciences The University of Kansas LawrenceKS United States Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 CD Netherlands

ISBN: (纸本)1891562835

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user’s secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client’s secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance. © 2023 30th Annual Network and Distributed system security Symposium, NDSS 2023. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dafl: Domain Adaptation-Based Federated Learning for Privacy-Preserving Biometric Recognition

SSRN

引用

SSRN 2023年

作者： Wang, Zhousheng Yang, Geng Dai, Hua Bai, Yunlu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big data Security & Intelligent Processing Nanjing210023 China

With the introduction of data protection regulation in various countries, traditional centralized learning for the exploitation of sensitive biological information will gradually become unsustainable. We take face and speaker recognition systems as examples, to consider the possibility of implementing them using federated learning. It is known that federated learning methods still have some issues to be solved, e.g., parameter updates delivered can still reveal user privacy. Besides, existing privacy-preserving methods such as encryption and perturbation could pose other problems, including low accuracy and high training overhead, which can be more prominent in biometric recognition scenarios. We adopt the idea of domain adaptation and propose a new federated learning framework, DAFL, focusing on the improvement of the training efficiency and model performance, to achieve a practical privacy-preserving biometric recognition scheme for the first time. We also design a special dropout method for it to address the possible imbalance of biometric samples across users. Experiments on real-world datasets show that our approach can achieve up to 95.6% and 97.9% accuracy in face recognition and speaker recognition tasks, respectively, under medium privacy settings. Compared with existing work, it can save 56.0% of training time with a 3.1% accuracy loss in the best case. © 2023, The Authors. All rights reserved.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：