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

Indirect influence in social networks as an induced percolation phenomenon (vol 119, e2100151119, 2022)

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 2022年第24期119卷 e2100151119-e2100151119页

作者： Xie, Jiarong Wang, Xiangrong Feng, Ling Zhao, Jin-Hua Liu, Wenyuan Moreno, Yamir Hu, Yanqing School of Computer Science and Engineering Sun Yat-sen University 510006 Guangzhou China Institute of Future Networks Southern University of Science and Technology 518055 Shenzhen China Peng Cheng Laboratory 518066 Shenzhen China Institute of High Performance Computing A*STAR 138632 Singapore Department of Physics National University of Singapore 117551 Singapore Guangdong Provincial Key Laboratory of Nuclear Science Institute of Quantum Matter South China Normal University 510006 Guangzhou China Guangdong-Hong Kong Joint Laboratory of Quantum Matter Southern Nuclear Science Computing Center South China Normal University 510006 Guangzhou China Division of Physics and Applied Physics School of Physical and Mathematical Sciences Nanyang Technological University 637371 Singapore Institute for Biocomputation and Physics of Complex Systems University of Zaragoza 50018 Zaragoza Spain Department of Theoretical Physics University of Zaragoza 50018 Zaragoza Spain ISI Foundation 10126 Torino Italy Department of Statistics and Data Science College of Science Southern University of Science and Technology 518055 Shenzhen China

Percolation theory has been widely used to study phase transitions in network systems. It has also successfully explained various macroscopic spreading phenomena across different fields. Yet, the theoretical frameworks have been focusing on direct interactions among nodes, while recent empirical observations have shown that indirect interactions are common in many network systems like social and ecological networks, among others. By investigating the detailed mechanism of both direct and indirect influence on scientific collaboration networks, here we show that indirect influence can play the dominant role in behavioral influence. To address the lack of theoretical understanding of such indirect influence on the macroscopic behavior of the system, we propose a percolation mechanism of indirect interactions called induced percolation. Surprisingly, our model exhibits a unique anisotropy property. Specifically, directed networks show first-order abrupt transitions as opposed to the second-order continuous transition in the same network structure but with undirected links. A mix of directed and undirected links leads to rich hybrid phase transitions. Furthermore, a unique feature of the nonmonotonic pattern is observed in network connectivities near the critical point. We also present an analytical framework to characterize the proposed induced percolation, paving the way to further understanding network dynamics with indirect interactions.

关键词： percolation indirect interactions social network phase transition behavioral contagion

来源：评论

学校读者我要写书评

暂无评论

A discovery of two slow pulsars with FAST:“Ronin”from the globular cluster M15

引用

Science China(Physics,Mechanics & Astronomy) 2024年第6期67卷 166-180页

作者： Dengke Zhou Pei Wang Di Li Jianhua Fang Chenchen Miao Paulo CCFreire Lei Zhang Dandan Zhang Huaxi Chen Yi Feng Yifan Xiao Jintao Xie Xu Zhang Chenwu Jin Han Wang Yinan Ke Xuerong Guo Rushuang Zhao Chenhui Niu Weiwei Zhu Mengyao Xue Yabiao Wang Jiafu Wu Zhenye Gan Zhongyi Sun Chengjie Wang Jie Zhang Junshuo Zhang Jinhuang Cao Wanjin Lu Research Center for Astronomical Computing Zhejiang LaboratoryHangzhou 311121China National Astronomical Observatories Chinese Academy of SciencesBeijing 100101China Institute for Frontiers in Astronomy and Astrophysics Beijing Normal UniversityBeijing 102206China University of Chinese Academy of Sciences Beijing 100049China New Cornerstone Science Laboratory Shenzhen 518054China Max Planck Institut f¨ur Radioastronomie Bonn 53121Germany Centre for Astrophysics and Supercomputing Swinburne University of TechnologyHawthorn 3122Australia School of Mathematical Sciences School of Physics and Electronic SciencesGuizhou Normal UniversityGuiyang 550001China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guiyang 550001China School of Physics and Electronic Engineering Qilu Normal UniversityJinan 250200China School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550001China College of Physical Science and Technology Central China Normal UniversityWuhan 430079China Tencent Youtu Lab Shanghai 201103China

Globular clusters harbor numerous millisecond pulsars,but long-period pulsars(P 100 ms)are rarely *** this study,we employed a fast folding algorithm to analyze observational data from multiple globular clusters obtained by the Five-hundredmeter Aperture Spherical radio Telescope(FAST),aiming to detect the existence of long-period *** estimated the impact of the median filtering algorithm in eliminating red noise on the minimum detectable flux density(S_(min))of ***,we successfully discovered two isolated long-period pulsars in M15 with periods approximately equal to 1.928451 and3.960716 s,*** the P-˙P diagram,both pulsars are positioned below the spin-up line,suggesting a possible history of partial recycling in X-ray binary systems disrupted by dynamical encounters later *** to timing results,these two pulsars exhibit remarkably strong magnetic *** the magnetic fields were weakened during the accretion process,then a short duration of accretion might explain the strong magnetic fields of these pulsars.

关键词： pulsar globular cluster FAST

来源：评论

学校读者我要写书评

暂无评论

Ascl: Accelerating Semi-Supervised Learning Via Contrastive Learning

SSRN

引用

SSRN 2024年

作者： Liu, Haixiong Li, Zuoyong Wu, Jiawei Zeng, Kun Hu, Rong Zeng, Wei Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Minjiang University Fuzhou350121 China School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University Guangdong Shenzhen518107 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Physics and Mechanical and Electrical Engineering Longyan University Longyan364012 China

SSL(Semi-supervised learning) is widely used in machine learning, which leverages labeled and unlabeled data to improve model performance. SSL aims to optimize class mutual information, but noisy pseudo-labels introduce false class information due to the scarcity of labels. Therefore, these algorithms often need significant training time to refine pseudo-labels for performance improvement iteratively. To tackle this challenge, we propose a novel plug-and-play method named ASCL(Accelerating Semi-Supervised Learning via Contrastive Learning). This method combines contrastive learning with uncertainty-based selection for performance improvement and accelerates the convergence of SSL algorithms. Contrastive learning initially emphasizes the mutual information between samples as a means to decrease dependence on pseudo-labels. Subsequently, it gradually turns to maximizing the mutual information between classes, aligning with the objective of semi-supervised learning. Uncertainty-based selection provides a robust mechanism for acquiring pseudo-labels. The combination of the contrastive learning module and the uncertainty-based selection module forms a virtuous cycle to improve the performance of the proposed model. Extensive experiments demonstrate that ASCL outperforms state-of-the-art methods in terms of both convergence efficiency and performance. In the experimental scenario where only one label is assigned per class in the CIFAR-10 dataset, the application of ASCL to Pseudo-label, UDA (Unsupervised data Augmentation for Consistency Training), and Fixmatch benefits substantial improvements in classification accuracy. Specifically, the results demonstrate notable improvements in respect of 16.32%, 6.9%, and 24.43% when compared to the original outcomes. Moreover, the required training time is reduced by almost 50%. © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Joint Sparsification and Quantization for Wireless Federated Learning under Communication Constraints

Joint Sparsification and Quantization for Wireless Federated...

引用

IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Junshen Su Xijun Wang Xiang Chen Ray-Guang Cheng School of Electronics and Information Technology Sun Yat-Sen University Guangzhou China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Department of Electronic and Computer Engineering National Taiwan University of Science and Technology Taipei Taiwan

Communication efficiency is one of the key bottlenecks in Federated Learning (FL). Compression techniques, such as sparsification and quantization, are used to reduce communication overhead. However, joint designs of these techniques under communication constraints are not well-explored. This paper investigates the joint uplink compression problem in communication-constrained FL systems. We propose a Block-TopK sparsification scheme to reduce the proportion of bits used for locating entries of a sparsified vector. Considering the communication constraints, an optimization formulation is proposed to minimize the compression error. By solving the optimization problem, our joint compression method provides a better trade-off between sparsity budget and bit width. Numerical results demonstrate that our approach achieves 99.96% of baseline accuracy with only 1.56% of the baseline communication overhead when training ResNet-18 on CIFAR-10.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Usage: Uncertain Flow Graph and Spatio-Temporal Graph Network-Based Saturation Attack Detection Method

SSRN

引用

SSRN 2023年

作者： Wang, Kaixi Cui, Yunhe Qian, Qing Chen, Yi Guo, Chun Shen, Guowei Engineering Research Center of Text Computing & Cognitive Intelligence Guizhou University China State Key Laboratory of Public Big Data Guizhou University China Guizhou Provincial Characteristic Key Laboratory of Software Engineering and Information Security Guizhou University China College of Computer Science and Technology Guizhou University China School of Information Guizhou University of Finance and Economics China

With the development of Software-Defined Networking (SDN), its security problems have become important research content. Among these security problems, saturation attack is one of the most destructive problems. Saturation attacks can destroy SDN networks. Currently, neural graph networks have already been used for detecting saturation attacks in SDN. When constructing the graph based on K-Nearest Neighbors (KNN) algorithm, the number of edges in the graph is fixed. That cannot reflect the different nodes’ relationship well. In addition, when using the Graph Convolutional Network (GCN) to detect saturation attack against SDN, only a partial graph structure and node features will be learned, causing the flow graph nodes information cannot be fully utilized. To overcome these issues, in this work, we propose USAGE, an uncertain flow graph and spatio-temporal graph network-based saturation attack detection method. More specifically, USAGE designs the CRAM algorithm and EGG model. The CRAM algorithm is designed to generate an uncertain flow graph for each traffic flow, which can represent the uncertain relationship among different nodes. EGG is a spatio-temporal graph convolutional network model, which is proposed to detect saturation attacks towards SDN switches. The evaluation results demonstrate that USAGE can generate a better graph than KNN and achieve high detection performance. Meanwhile, USAGE outperforms other methods in terms of TPR, TNR, accuracy, precision, recall, F-score, confusion matrix, ROC curves, and PR curves. © 2023, The Authors. All rights reserved.

关键词： Flow graphs

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

CLDG: Contrastive Learning on Dynamic Graphs

引用

International Conference on data Engineering

作者： Yiming Xu Bin Shi Teng Ma Bo Dong Haoyi Zhou Qinghua Zheng Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learnable Graph Convolutional Network and Feature Fusion for Multi-view Learning

arXiv

引用

arXiv 2022年

作者： Chen, Zhaoliang Fu, Lele Yao, Jie Guo, Wenzhong Plant, Claudia Wang, Shiping College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Faculty of Computer Science University of Vienna Vienna1090 Austria Research Network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

In practical applications, multi-view data depicting objectives from assorted perspectives can facilitate the accuracy increase of learning algorithms. However, given multi-view data, there is limited work for learning discriminative node relationships and graph information simultaneously via graph convolutional network that has drawn the attention from considerable researchers in recent years. Most of existing methods only consider the weighted sum of adjacency matrices, yet a joint neural network of both feature and graph fusion is still under-explored. To cope with these issues, this paper proposes a joint deep learning framework called Learnable Graph Convolutional Network and Feature Fusion (LGCN-FF), consisting of two stages: feature fusion network and learnable graph convolutional network. The former aims to learn an underlying feature representation from heterogeneous views, while the latter explores a more discriminative graph fusion via learnable weights and a parametric activation function dubbed Differentiable Shrinkage Activation (DSA) function. The proposed LGCN-FF is validated to be superior to various state-of-the-art methods in multi-view semi-supervised classification. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

arXiv

引用

arXiv 2024年

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Wasserstein Archetypal Analysis

arXiv

引用

arXiv 2022年

作者： Craig, Katy Osting, Braxton Wang, Dong Xu, Yiming Department of Mathematics University of California Santa Barbara Department of Mathematics University of Utah Salt Lake City School of Science and Engineering & Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen Guangdong China Corporate Model Risk Wells Fargo

Archetypal analysis is an unsupervised machine learning method that summarizes data using a convex polytope. In its original formulation, for fixed k, the method finds a convex polytope with k vertices, called archetype points, such that the polytope is contained in the convex hull of the data and the mean squared Euclidean distance between the data and the polytope is minimal. In the present work, we consider an alternative formulation of archetypal analysis based on the Wasserstein metric, which we call Wasserstein archetypal analysis (WAA). In one dimension, there exists a unique solution of WAA [7] and, in two dimensions, we prove existence of a solution, as long as the data distribution is absolutely continuous with respect to Lebesgue measure. We discuss obstacles to extending our result to higher dimensions and general data distributions. We then introduce an appropriate regularization of the problem, via a Rényi entropy, which allows us to obtain existence of solutions of the regularized problem for general data distributions, in arbitrary dimensions. We prove a consistency result for the regularized problem, ensuring that if the data are iid samples from a probability measure, then as the number of samples is increased, a subsequence of the archetype points converges to the archetype points for the limiting data distribution, almost surely. Finally, we develop and implement a gradient-based computational approach for the two-dimensional problem, based on the semi-discrete formulation of the Wasserstein metric. Our analysis is supported by detailed computational *** Codes 62H12, 62H30, 65K10, 49Q22 Copyright © 2022, The Authors. All rights reserved.

关键词： Multivariant analysis

来源：评论

学校读者我要写书评

暂无评论

Speaker Extraction with Co-Speech Gestures Cue

arXiv

引用

arXiv 2022年

作者： Pan, Zexu Qian, Xinyuan Li, Haizhou The Integrative Sciences and Engineering Programme The Institute of Data Science National University of Singapore 119077 Singapore The Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore The Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China The School of Data Science The Chinese University of Hong Kong Shenzhen518172 China The University of Bremen 28359 Germany

Speaker extraction seeks to extract the clean speech of a target speaker from a multi-talker mixture speech. There have been studies to use a pre-recorded speech sample or face image of the target speaker as the speaker cue. In human communication, co-speech gestures that are naturally timed with speech also contribute to speech perception. In this work, we explore the use of co-speech gestures sequence, e.g. hand and body movements, as the speaker cue for speaker extraction, which could be easily obtained from low-resolution video recordings, thus more available than face recordings. We propose two networks using the co-speech gestures cue to perform attentive listening on the target speaker, one that implicitly fuses the co-speech gestures cue in the speaker extraction process, the other performs speech separation first, followed by explicitly using the co-speech gestures cue to associate a separated speech to the target speaker. The experimental results show that the co-speech gestures cue is informative in associating with the target speaker. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：