Academic community identification in citation networks aims at uncovering internal correlations among scholars. However， heterogeneity of node attributes （content features） and topological structures （association patterns） often cause feature misalignment and information dilution during fusion， and the existing methods often ignore stable association patterns in core subnetworks formed by highly-connected nodes， which limit identification accuracy. To address these issues， a Multi-view Attention Fusion for academic Community Identification （MAFCI） method was proposed. In the method， a dual-view design was adopted： original node attributes and the adjacency matrix were encoded by one view， while core-node information and its topology extracted by k?core were incorporated by the other one view. A sparse graph attention mechanism was applied to extract low-dimensional embeddings from both views， and a dynamic weighting strategy was employed to fuse multi-source information adaptively， thereby balancing local structure and global semantics. In the decoder， the adjacency matrix was reconstructed via inner product and node attributes as well as core information were restored using attention mechanism. At the same time， a self-supervised clustering loss was introduced to guide embedding representations in converging to discriminative cluster centers and enhance community boundary separability. Experimental results on four citation network datasets （Cora， Citeseer， ACM， and DBLP） demonstrate that MAFCI method outperforms nine advanced baseline methods， including DDGAE （Deep Dual Graph Attention auto-Encoder） and BCDAN （Balanced method for Community Detection in Attribute Networks）， on most core metrics. Specifically， on the DBLP dataset， MAFCI method achieves a Normalized Mutual Information （NMI） of 0.513 and an Accuracy （ACC） of 0.809， which are improved by 2.3 and 1.3 percentage points， respectively， compared to the optimal baseline method； on the ACM dataset， MAFCI method achieves an NMI of 0.674 and an F1-score of 0.903， representing improvements of 1.2 and 0.8 percentage points， respectively， compared to the optimal baseline method； on the Citeseer dataset， MAFCI method has the NMI achieved 0.448， which is improved by 0.7 percentage points； on the Cora dataset， MAFCI method has the NMI reached 0.543， also surpassing all comparison methods. It can be seen that MAFCI method enhances the accuracy and robustness of academic community identification and has strong generalization across citation networks of varying scales and structures effectively through dual-view sparse attention and dynamic fusion mechanism.

Protocol conversion is usually used to solve the problem of data interaction between different protocols， and its nature is to find mapping relationship between different protocol fields. In the traditional methods of protocol conversion， several drawbacks are identified： traditional conversions are mainly designed on the basis of specific protocols， so that they are static and lack flexibility， and are not suitable for environments with multi-protocol conversion； whenever a protocol changes， a reanalysis of the protocol’s structure and semantic fields is required to reconstruct the mapping relationship between fields， leading to an exponential increase in workload and a decrease in protocol conversion efficiency. Therefore， a general method of protocol conversion based on semantic similarity was proposed to enhance protocol conversion efficiency by exploring the relationship between fields intelligently. Firstly， the BERT （Bidirectional Encoder Representations from Transformers） model was employed to classify the protocol fields， and eliminate the fields that “should not” have mapping relationship. Secondly， the semantic similarities between fields were computed to reason the mapping relationship between fields， resulting in the formation of a field mapping table. Finally， a general framework for protocol conversion based on semantic similarity was introduced， and related protocols were defined for validation. Simulation results show that the precision of field classification of the proposed method reaches 94.44%； and the precision of mapping relationship identification of the proposed method reaches 90.70%， which is 13.93% higher than that of the method based on knowledge extraction. The above results verify that the proposed method is feasible， can identify the mapping relationships between different protocol fields quickly， and is suitable for scenarios with multi-protocol conversion in unmanned collaboration.

To solve the irreconcilable contradiction between data sharing demands and requirements of privacy protection， federated learning was proposed. As a distributed machine learning， federated learning has a large number of model parameters needed to be exchanged between the participants and the central server， resulting in higher communication overhead. At the same time， federated learning is increasingly deployed on mobile devices with limited communication bandwidth and limited power， and the limited network bandwidth and the sharply raising client amount will make the communication bottleneck worse. For the communication bottleneck problem of federated learning， the basic workflow of federated learning was analyzed at first， and then from the perspective of methodology， three mainstream types of methods based on frequency reduction of model updating， model compression and client selection respectively as well as special methods such as model partition were introduced， and a deep comparative analysis of specific optimization schemes was carried out. Finally， the development trends of federated learning communication overhead technology research were summarized and prospected.