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

IEEE Transactions on Artificial Intelligence 2025年

作者： He, Yifan Ding, Xi Tang, Yateng Guan, Jihong Zhou, Shuigeng Fudan University School of Computer Science Shanghai200433 China Shanghai Key Laboratory of Intelligent Information Processing Shanghai200433 China Tencent Weixin Group Guangzhou510308 China Tongji University Department of Computer Science and Technology Shanghai201804 China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai200092 China

Anomalies are usually regarded as data errors or novel patterns previously unseen, which are quite different from most observed data. Accurate detection of anomalies is crucial in various application scenarios. This paper focuses on unsupervised anomaly detection from Multivariate Time Series (MTS), as real-world data collected from sources such as wearable devices, medical equipment and industrial machines typically manifest as MTS and are often unlabeled. Anomaly detection in MTS represents a data-driven challenge that traditionally requires substantial centralized data for training models. However, in practice, data are frequently distributed among multiple institutions, with privacy concerns restricting unrestricted access. To address these issues, we introduce Feature Decoupling Federated Learning (FDFL), an approach designed to collaboratively train a representation learning network over multiple clients for unsupervised anomaly detection in MTS. Unlike previous methods that simply integrate MTS anomaly detection algorithms with federated learning strategies, FDFL specifically addresses heterogeneity among clients by decoupling the representation network into shared and private branches through a contrastive learning mechanism. This method aggregates shared parameters during each federated round while maintaining client-specific private parameters locally. Additionally, we develop a self-attention block that integrates the representations derived from both shared and private parameters to reconstruct MTS and identify anomalies based on reconstruction errors. Extensive experiments conducted on three publicly available datasets demonstrate that FDFL outperforms existing algorithms in most cases, highlighting the effectiveness and superiority of our proposed method in MTS anomaly detection. © 2020 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

TDiffSal: Text-Guided Diffusion Saliency Prediction Model for Images 27th

TDiffSal: Text-Guided Diffusion Saliency Prediction Model fo...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Xiong, Min Zhu, Dandan Zhu, Kun Zhai, Guangtao School of Computer Science and Technology Donghua University No. 2999 Renmin North Road Songjiang District Shanghai201620 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210093 China Institute of AI Education Shanghai East China Normal University No. 3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No. 4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781858

Existing visual saliency prediction methods mainly focus on single-modal visual saliency prediction, while ignoring the significant impact of text on visual saliency. To more comprehensively explore the influence of text on human attention in images, we propose a text-guided diffusion saliency prediction model, named TDiffSal. In specific, recent studies on stable diffusion models have shown promising performance in unifying tasks due to their inherent generalization ability. Inspired by this, a novel diffusion model for generalized visual-text saliency prediction is proposed, which formulates the prediction issue as a conditional generative task of the saliency map by employing input visual and text as the conditions. Meanwhile, we introduce a multi-head fusion module to effectively integrate text features and image features, which can efficiently guide the image denoising process and progressively refine the generated saliency map to make it semantically relevant to the text. Additionally, we employ an efficient pre-training strategy to enhance the robustness and generalization of the proposed model. We conduct extensive experiments on benchmark datasets to demonstrate its superior performance compared to other state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Remote State Estimation for Complex Networks Under Probabilistic Bit Flips: A Transmission Power Allocation Scheme

引用

IEEE Transactions on Automatic Control 2025年

作者： Song, Jiahao Wang, Zidong Liu, Qinyuan He, Xiao Tsinghua University Department of Automation Beijing100084 China Brunel University London Department of Computer Science UxbridgeUB8 3PH United Kingdom Tongji University Department of Computer Science and Technology Shanghai201804 China Ministry of Education Tongji University Key Laboratory of Embedded System and Service Computing Shanghai200092 China Shanghai Artificial Intelligence Laboratory Shanghai China

In this paper, the problem of remote state estimation is investigated for a class of complex networks with noisy wireless communication channels. The employment of the binary encoding scheme allows for the description of the influence of channel noises as probabilistic bit flips, where the probability of these bit flips is influenced by several factors with the signal-to-noise ratio (SNR) being a crucial one. In engineering practice, the method of adjusting the transmission power for each node in a complex network is commonly applied to modify the SNR so as to reduce the data distortion caused by bit flips. Furthermore, due to restricted communication resources, the total available transmission power is often limited particularly in large-scale systems such as complex networks. Consequently, the allocation of transmission power for all nodes under a total transmission power constraint becomes a concern. Utilizing the ultimately bounded filtering method, we devise a transmission-power-dependent state estimator, by which the combined effect of probabilistic bit flips and transmission power allocation on estimation performance is analyzed. Moreover, the task of co-designing the transmission power allocation scheme and estimator gains is modeled as an optimization problem, which is then addressed through a two-step optimization strategy. The existence of a unique optimal transmission power allocation scheme is also proven. Finally, numerical simulation examples are provided to demonstrate the effectiveness of the proposed co-design approach. © 1963-2012 IEEE.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency Model for Omnidirectional Images 27th

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Liu, Qian Zhu, Dandan Zhu, Kun Zhai, Guangtao Yang, Xiaokang School of Computer Science and Technology Donghua University No.2999 Renmin North Road Songjiang District Shanghai201620 China Institute of AI Education Shanghai East China Normal University No.3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No.4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781216

Recent years have witnessed rapid progress of convolutional neural networks (CNNs) and their successful application in the task of saliency prediction for omnidirectional images (ODIs). Albeit achieving tremendous performance improvements, these CNNs-based saliency models are plagued by two major shortcomings: spatial content-agnostic and computationally intensive. Inspired by the effectiveness of equivariant network in the majority of computer vision tasks, we propose a novel efficient equivariant dynamic aggregation saliency (E2DAS) model to efficiently tackle the issue of human fixation prediction in ODIs. To be specific, our proposed model consists of an efficient equivariant module, a dynamic convolutional aggregation module, and an optimization computation module. Different from existing saliency models for ODIs, we are the first attempt to introduce an efficient equivariant dynamic convolutional aggregation operation into the saliency prediction task, which can fundamentally alleviate the projection distortion problem and can effectively learn spatial content-adaptive features. Moreover, we clearly observe a considerable decrease in the number of parameters resulting from the replacement of standard convolution with dynamic convolution aggregation. Extensive experiments on several benchmark datasets show the proposed model’s superiority over other state-of-the-art methods in terms of performance. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Equivariant dynamic aggregation light-weight model omnidirectional images saliency prediction spatial content-adaptive

来源：评论

学校读者我要写书评

暂无评论

Partition-based Collaborative Tensor Factorization for POI Recommendation

引用

IEEE/CAA Journal of Automatica Sinica 2017年第3期4卷 437-446页

作者： Wenjing Luan Guanjun Liu Changjun Jiang Liang Qi Department of Computer Science and Technology Tongji University IEEE Key Laboratory of Embedded System and Service Computing Tongji University

The rapid development of location-based social networks(LBSNs) provides people with an opportunity of better understanding their mobility behavior which enables them to decide their next *** example,it can help travelers to choose where to go next,or recommend salesmen the most potential places to deliver advertisements or sell *** this paper,a method for recommending points of interest(POIs)is proposed based on a collaborative tensor factorization(CTF)***,a generalized objective function is constructed for collaboratively factorizing a tensor with several feature ***,a 3-mode tensor is used to model all users' check-in behaviors,and three feature matrices are extracted to characterize the time distribution,category distribution and POI correlation,***,each user's preference to a POI at a specific time can be estimated by using *** order to further improve the recommendation accuracy,PCTF(Partitionbased CTF) is proposed to fill the missing entries of a tensor after clustering its every *** on a real checkin database show that the proposed method can provide more accurate location recommendation.

关键词： Clustering context feature extraction point of interest(POI) recommendation tensor factorization

来源：评论

学校读者我要写书评

暂无评论

Behavior Consistency Computation for Workflow Nets With Unknown Correspondence

引用

IEEE/CAA Journal of Automatica Sinica 2018年第1期5卷 281-291页

作者： Mimi Wang Guanjun Liu Peihai Zhao Chungang Yan Changjun Jiang Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China IEEE

Consistency degree calculation is established on the basis of known correspondence, but in real life, the correspondence is generally unknown, so how to calculate consistency of two models under unknown correspondence has become a problem. For this condition, we should analyze unknown correspondence due to the influence of different *** this paper we obtain the relations of transitions based on event relations using branching processes, and build a behavioral matrix of relations. Based on the permutation of behavioral matrix, we express different correspondences, and define a new formula to compute the maximal consistency degree of two workflow nets. Additionally, this paper utilizes an example to show these definitions, computation as well as the advantages.

关键词： Behavioral matrix branching process consistency degree unknown correspondence workflow net(WF-nets)

来源：评论

学校读者我要写书评

暂无评论

Toward High-Performance Delta-Based Iterative Processing with a Group-Based Approach

引用

Journal of Computer Science & technology 2022年第4期37卷 797-813页

作者： Hui Yu Xin-Yu Jiang Jin Zhao Hao Qi Yu Zhang Xiao-Fei Liao Hai-Kun Liu Fu-Bing Mao Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Many systems have been built to employ the delta-based iterative execution model to support iterative algorithms on distributed platforms by exploiting the sparse computational dependencies between data items of these iterative algorithms in a synchronous or asynchronous approach. However, for large-scale iterative algorithms, existing synchronous solutions suffer from slow convergence speed and load imbalance, because of the strict barrier between iterations;while existing asynchronous approaches induce excessive redundant communication and computation cost as a result of being barrier-free. In view of the performance trade-off between these two approaches, this paper designs an efficient execution manager, called Aiter-R, which can be integrated into existing delta-based iterative processing systems to efficiently support the execution of delta-based iterative algorithms, by using our proposed group-based iterative execution approach. It can efficiently and correctly explore the middle ground of the two extremes. A heuristic scheduling algorithm is further proposed to allow an iterative algorithm to adaptively choose its trade-off point so as to achieve the maximum efficiency. Experimental results show that Aiter-R strikes a good balance between the synchronous and asynchronous policies and outperforms state-of-the-art solutions. It reduces the execution time by up to 54.1% and 84.6% in comparison with existing asynchronous and the synchronous models, respectively.

关键词： iterative algorithm delta-based execution model efficiency

来源：评论

学校读者我要写书评

暂无评论

Improving Entity Linking in Chinese Domain by Sense Embedding Based on Graph Clustering

引用

Journal of Computer Science & technology 2023年第1期38卷 196-210页

作者：张照博钟芷漫袁平鹏金海 National Engineering Research Center for Big Data Technology and System Huazhong University of Science and Technology Wuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Entity linking refers to linking a string in a text to corresponding entities in a knowledge base through candidate entity generation and candidate entity *** is of great significance to some NLP(natural language processing)tasks,such as question *** English entity linking,Chinese entity linking requires more consideration due to the lack of spacing and capitalization in text sequences and the ambiguity of characters and words,which is more evident in certain *** Chinese domains,such as industry,the generated candidate entities are usually composed of long strings and are heavily *** addition,the meanings of the words that make up industrial entities are sometimes *** semantic space is a subspace of the general word embedding space,and thus each entity word needs to get its exact ***,we propose two schemes to achieve better Chinese entity ***,we implement an ngram based candidate entity generation method to increase the recall rate and reduce the nesting ***,we enhance the corresponding candidate entity ranking mechanism by introducing sense *** the contradiction between the ambiguity of word vectors and the single sense of the industrial domain,we design a sense embedding model based on graph clustering,which adopts an unsupervised approach for word sense induction and learns sense representation in conjunction with *** test the embedding quality of our approach on classical datasets and demonstrate its disambiguation ability in general *** confirm that our method can better learn candidate entities’fundamental laws in the industrial domain and achieve better performance on entity linking through experiments.

关键词： natural language processing(NLP) domain entity linking computational linguistics word sense disambiguation knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Prescribed-time synchronization for multiweighted complex networks: A switching control scheme

引用

systems & Control Letters 2025年 203卷

作者： Linlong Xu Xiwei Liu Department of Computer Science and Technology Tongji University Shanghai 201804 PR China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 201804 PR China

This letter deals with an interesting intersection phenomenon of prescribed-time stability (PTSta) for dynamical systems, and develops a novel switching control scheme to investigate prescribed-time synchronization (PTSyn) for multiweighted and directly coupled complex networks. Different from most previous works that scholars only pay attention to designing the regulation function to ensure PTSta, we aim to select various parameters and uncover the mathematical mechanism of intersecting system state curves. We rigorously prove that, if the settling time is larger than 1, then no matter what the initial value is, the intersection exists only once before the settling time; otherwise, there is no intersection. Moreover, an energy consumption evaluation function is also put forward for PTSta, whose exact value is also calculated via exponential integrals. Then, this intersection theory is applied on the PTSyn of multiweighted complex networks, which is beneficial to construct the switching control scheme or choose the optimal parameters to reduce the energy cost. The rearranging variables’ order technique is utilized to conduct the multiweighted complex networks and obtain the synchronization criterion. Finally, four simulations are presented to verify theoretical results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration

引用

Journal of Computer Science & technology 2022年第5期37卷 1068-1085页

作者： Chun-Xue Zhu Long-Long Lin Ping-Peng Yuan Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Real-world networks,such as social networks,cryptocurrency networks,and e-commerce networks,always have occurrence time of interactions between *** networks are typically modeled as temporal *** cohesive subgraphs from temporal graphs is practical and essential in numerous data mining applications,since mining cohesive subgraphs gets insights into the time-varying nature of temporal ***,existing studies on mining cohesive subgraphs,such as Densest-Exact and k-truss,are mainly tailored for static graphs(whose edges have no temporal information).Therefore,those cohesive subgraph models cannot indicate both the temporal and the structural characteristics of *** this end,we explore the model of cohesive temporal subgraphs by incorporating both the evolving and the structural characteristics of temporal ***,the volume of time intervals in a temporal network is *** a result,the time complexity of mining temporal cohesive subgraphs is *** efficiently address the problem,we first mine the temporal density distribution of temporal *** by the distribution,we can safely prune many unqualified time intervals with the linear time ***,the remaining time intervals where cohesive temporal subgraphs fall in are examined using the greedy *** results of the experiments on nine real-world temporal graphs indicate that our model outperforms state-of-the-art solutions in efficiency and ***,our model only takes less than two minutes on a million-vertex DBLP and has the highest overall average ranking in EDB and TC metrics.

关键词： temporal network temporal feature distribution cohesive subgraph convex property

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：