[目的/意义]通过最大瓦解结构准确识别科学研究前沿中的关键节点并追踪其演化路径,为把握领域发展规律、优化科研资源配置提供支持,突破现有研究聚焦孤立节点的局部特征,以及难以捕捉知识网络中具有协同作用且对全局连通性有级联破坏力...[目的/意义]通过最大瓦解结构准确识别科学研究前沿中的关键节点并追踪其演化路径,为把握领域发展规律、优化科研资源配置提供支持,突破现有研究聚焦孤立节点的局部特征,以及难以捕捉知识网络中具有协同作用且对全局连通性有级联破坏力的关键节点集合的问题。[方法/过程]以量子通信领域为例,基于2015—2024年Web of Science的6538篇文献构建关键词共现网络,融合多中心性指标并利用熵权法评估节点重要性,采用贪心算法识别MDS,分析其功能协同特征与演化轨迹。[结果/结论]研究表明,MDS仅占网络规模的18%~22%,移除该集合后网络最大连通组件规模下降超过70%,效果显著优于传统方法。关键节点在功能上呈现“主题—方法—工具—目标”的互补协同结构,其演化路径清晰展示了量子通信从理论奠基、技术攻坚到应用落地的三阶段发展轨迹,验证了MDS框架的有效性和实用性。展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
Loday introduced di-associative algebras and tri-associative algebras motivated by periodicity phenomena in algebraic K-theory.The purpose of this paper is to study the splittings of operations on di-associative algeb...Loday introduced di-associative algebras and tri-associative algebras motivated by periodicity phenomena in algebraic K-theory.The purpose of this paper is to study the splittings of operations on di-associative algebras and tri-associative algebras.We introduce the notion of a quad-dendriform algebra,which is a splitting of a di-associative algebra.We show that a relative averaging operator on dendriform algebras gives rise to a quad-dendriform algebra.Furthermore,we introduce the notion of six-dendriform algebras,which are splittings of the tri-associative algebras,and demonstrate that homomorphic relative averaging operators induce six-dendriform algebras.展开更多
In this paper,we first give a sufficient condition for a graph being fractional ID-[a,b]-factor-critical covered in terms of its independence number and minimum degree,which partially answers the problem posed by Sizh...In this paper,we first give a sufficient condition for a graph being fractional ID-[a,b]-factor-critical covered in terms of its independence number and minimum degree,which partially answers the problem posed by Sizhong Zhou,Hongxia Liu and Yang Xu(2022).Then,an A_(α)-spectral condition is given to ensure that G is a fractional ID-[a,b]-factor-critical covered graph and an(a,b,k)-factor-critical graph,respectively.In fact,(a,b,k)-factor-critical graph is a graph which has an[a,b]-factor for k=0.Thus,these above results extend the results of Jia Wei and Shenggui Zhang(2023)and Ao Fan,Ruifang Liu and Guoyan Ao(2023)in some sense.展开更多
Let G be a finite group and H a subgroup of G.The normal index of H in G is defined as the order of K/H_(G),where K is a normal supplement of H in G such that|K|is minimal and H_(G)≤K■G.Let p be a prime which divide...Let G be a finite group and H a subgroup of G.The normal index of H in G is defined as the order of K/H_(G),where K is a normal supplement of H in G such that|K|is minimal and H_(G)≤K■G.Let p be a prime which divides the order of a group G.In this paper,some characterizations of G being p-solvable or p-supersolvable were obtained by analyzing the normal index of certain subgroups of G.These results can be viewed as local version of recent results in the literature.展开更多
文摘[目的/意义]通过最大瓦解结构准确识别科学研究前沿中的关键节点并追踪其演化路径,为把握领域发展规律、优化科研资源配置提供支持,突破现有研究聚焦孤立节点的局部特征,以及难以捕捉知识网络中具有协同作用且对全局连通性有级联破坏力的关键节点集合的问题。[方法/过程]以量子通信领域为例,基于2015—2024年Web of Science的6538篇文献构建关键词共现网络,融合多中心性指标并利用熵权法评估节点重要性,采用贪心算法识别MDS,分析其功能协同特征与演化轨迹。[结果/结论]研究表明,MDS仅占网络规模的18%~22%,移除该集合后网络最大连通组件规模下降超过70%,效果显著优于传统方法。关键节点在功能上呈现“主题—方法—工具—目标”的互补协同结构,其演化路径清晰展示了量子通信从理论奠基、技术攻坚到应用落地的三阶段发展轨迹,验证了MDS框架的有效性和实用性。
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金Supported by the Science and Technology Program of Guizhou Province(Grant No.QKHJC QN[2025]362)the National Natural Science Foundation of China(Grant No.12361005).
文摘Loday introduced di-associative algebras and tri-associative algebras motivated by periodicity phenomena in algebraic K-theory.The purpose of this paper is to study the splittings of operations on di-associative algebras and tri-associative algebras.We introduce the notion of a quad-dendriform algebra,which is a splitting of a di-associative algebra.We show that a relative averaging operator on dendriform algebras gives rise to a quad-dendriform algebra.Furthermore,we introduce the notion of six-dendriform algebras,which are splittings of the tri-associative algebras,and demonstrate that homomorphic relative averaging operators induce six-dendriform algebras.
基金Supported by the National Natural Science Foundation of China(Grant Nos.11961041,12261055)the Key Project of Natural Science Foundation of Gansu Province(Grant No.24JRRA222)the Foundation for Innovative Fundamental Research Group Project of Gansu Province(Grant No.25JRRA805).
文摘In this paper,we first give a sufficient condition for a graph being fractional ID-[a,b]-factor-critical covered in terms of its independence number and minimum degree,which partially answers the problem posed by Sizhong Zhou,Hongxia Liu and Yang Xu(2022).Then,an A_(α)-spectral condition is given to ensure that G is a fractional ID-[a,b]-factor-critical covered graph and an(a,b,k)-factor-critical graph,respectively.In fact,(a,b,k)-factor-critical graph is a graph which has an[a,b]-factor for k=0.Thus,these above results extend the results of Jia Wei and Shenggui Zhang(2023)and Ao Fan,Ruifang Liu and Guoyan Ao(2023)in some sense.
基金Supported by the National Natural Science Foundation of China(Grant No.12071092)Guangdong Basic and Applied Basic Research Foundation(Grant No.2025A1515012072)+1 种基金the Natural Science Research Project of Anhui Educational Committee(Grant No.2024AH051298)the Scientific Research Foundation of Bozhou University(Grant No.BYKQ202419).
文摘Let G be a finite group and H a subgroup of G.The normal index of H in G is defined as the order of K/H_(G),where K is a normal supplement of H in G such that|K|is minimal and H_(G)≤K■G.Let p be a prime which divides the order of a group G.In this paper,some characterizations of G being p-solvable or p-supersolvable were obtained by analyzing the normal index of certain subgroups of G.These results can be viewed as local version of recent results in the literature.
