检索结果-南通市图书馆

Knowledge Graph Completion Method of Combining Structural Information with Semantic Information

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年

作者： Binhao HU Jianpeng ZHANG hongchang chen School of Cyber Science and Engineering Zhengzhou University National Digital Switching System Engineering & Technological R&D Center (NDSC)

With the development of knowledge graphs, a series of applications based on knowledge graphs have emerged. The incompleteness of knowledge graphs makes the effect of the downstream applications and affected by the quality of the knowledge graphs. To improve the quality of knowledge graphs, translation-based graph embeddings, such as TransE, learn structural information by rep-resenting triples as low-dimensional dense vectors. However, is difficult to generalize to unseen entities, Entities that are not observed during training but appear during testing. The other methods use the powerful representational ability of pre-trained language models to learn entity descriptions and contextual representation of triples. Although they are robust to incompleteness, but they need to calculate the score of all candidate entities for each triple during inference. We consider combining two models to enhance the robustness of unseen entities by semantic information, and prevent combined explosion by reducing inference overhead through structured information. We use a pre-training language model to code triples and learn the semantic information within them, and then use a hyperbolic space-based distance model to learn structural information and integrate the two types of information together. We evaluate our model by performing link prediction experi-ments in standard datasets. In experiments, our model achieves better performances than state-of-the-art methods on two standard datasets.

关键词：

基于生成式对抗网络和正类无标签学习的知识图谱补全算法

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

计算机科学 2024年第1期51卷 310-315页

作者：胡斌皓张建朋陈鸿昶郑州大学网络空间安全学院郑州450002 信息工程大学信息技术研究所国家数字交换系统工程技术研究中心郑州450002

随着知识图谱的应用越来越广泛,绝大多数真实世界的知识图谱通常具有不完备性,限制了知识图谱的实际应用效果。因此,知识图谱补全成为了知识图谱领域的热点。然而,现有方法大多集中在评分函数的设计上,少部分研究关注了负样本抽样策略... 详细信息

随着知识图谱的应用越来越广泛,绝大多数真实世界的知识图谱通常具有不完备性,限制了知识图谱的实际应用效果。因此,知识图谱补全成为了知识图谱领域的热点。然而,现有方法大多集中在评分函数的设计上,少部分研究关注了负样本抽样策略。在改善负样本抽样的知识图谱补全算法的研究中,基于生成式对抗网络的方法取得了不错的进展。然而,现有研究并没有关注到负样本存在假阴性标签的问题,即生成的负样本中可能包含真实的事实。为了缓解假阴性标签问题,提出了一种基于生成式对抗网络和正类无标签学习的知识图谱补全算法。该方法利用生成式对抗网络生成无标签样本,并使用正类无标签学习缓解假阴性标签问题。在基准数据集上进行的大量实验证明了所提算法的有效性与准确性。

关键词：知识图谱补全生成式对抗网络正类无标签学习负样本抽样

基于国产FPGA的移动通信网信令设计与实现

在线全文

学校读者我要写书评

暂无评论

电讯技术 2024年第8期64卷 1298-1306页

作者：李静岩何赞园陈鸿昶巩小锐陈云杰郑州大学网络空间安全学院郑州450001 中国人民解放军战略支援部队信息工程大学信息技术研究所郑州450002

为提高电信网设备应对异常信令访问的检测能力,需对64K信令进行分析并处理。为了提高解析效率并满足近年来相关产品对自主可控越来越高的要求,设计了一种基于国产现场可编程门阵列(Field Programmable Gate Array, FPGA)的信令解析方案... 详细信息

为提高电信网设备应对异常信令访问的检测能力,需对64K信令进行分析并处理。为了提高解析效率并满足近年来相关产品对自主可控越来越高的要求,设计了一种基于国产现场可编程门阵列(Field Programmable Gate Array, FPGA)的信令解析方案,给出了方案的总体设计思路,并对FPGA实现的功能模块进行详细说明。对系统进行设计时,采用模块化参数化方法以及在关键环节添加状态参数,提高了可扩展性并可以对模块内部运行状态进行监控,最终实现了对信令高效且灵活的解析,主要器件等均为国产。经过测试,可以实现STM-1(STM-Synchronous Transfer Module-1)数据的接入、串并转换、HDLC(High-level Data Link Control)解帧等功能,完成32路64K信令的并发处理,模块运行状态可查可看,达到了预期的效果。以STM-1为例,基于现有功能的模块化设计,可以平滑地扩展到STM-4、STM-16的应用。

关键词：移动通信网电路交换 64K信令国产FPGA 模块化参数化设计

Cluster-preserving sampling algorithm for large-scale graphs

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2023年第1期66卷 60-76页

作者： Jianpeng ZHANG hongchang chen Dingjiu YU Yulong PEI Yingjun DENG National Digital Switching System E&T Research Center Information Engineering University Network Systems Department of the Strategic Support Force School of Computer Science and Technology Eindhoven University of Technology Center for Applied Mathematics Tianjin University

Graph sampling is a very effective method to deal with scalability issues when analyzing largescale graphs. Lots of sampling algorithms have been proposed, and sampling qualities have been quantified using explicit properties(e.g., degree distribution) of the sample. However, the existing sampling techniques are inadequate for the current sampling task: sampling the clustering structure, which is a crucial property of the current networks. In this paper, using different expansion strategies, two novel top-leader sampling methods(i.e., TLS-e and TLS-i) are proposed to obtain representative samples, and they are capable of effectively preserving the clustering structure. The rationale behind them is to select top-leader nodes of most clusters into the sample and then heuristically incorporate peripheral nodes into the sample using specific expansion strategies. Extensive experiments are conducted to investigate how well sampling techniques preserve the clustering structure of graphs. Our empirical results show that the proposed sampling algorithms can preserve the population’s clustering structure well and provide feasible solutions to sample the clustering structure from large-scale graphs.

关键词： graph sampling clustering structure top-leader nodes expansion strategies large-scale graphs

基于代表性节点扩张的保持社区结构的图采样算法

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

计算机科学 2024年第4期51卷 117-123页

作者：宏宇陈鸿昶张建朋黄瑞阳李邵梅郑州大学网络空间安全学院郑州450000 中国人民解放军战略支援部队信息工程大学信息技术研究所郑州450000

作为一种能够简化大规模图并保留其指定属性的方法,图采样被广泛应用于现实生活中。然而当前研究大多集中于保留节点级的性质,如度分布等,而忽略了图的社区结构等更为重要的信息。针对此问题,提出了一种保持社区结构的图采样算法。算法... 详细信息

作为一种能够简化大规模图并保留其指定属性的方法,图采样被广泛应用于现实生活中。然而当前研究大多集中于保留节点级的性质,如度分布等,而忽略了图的社区结构等更为重要的信息。针对此问题,提出了一种保持社区结构的图采样算法。算法主要分为两个步骤,第一步为初始化社区代表点,根据提出的节点重要度计算公式算出节点的重要度,然后选出每个社区的代表性节点;第二步为社区结构扩张,针对每个社区,选择可能引入最少额外邻居的节点加入社区中,直到达到该社区节点上限。在多个真实数据集上进行了对比实验,使用多个评价指标来评估实验结果。实验结果表明,所提出的采样算法能够很好地保持原始图的社区结构,为大规模图的社区结构采样提供了可行的解决方案。

关键词：图采样社区结构代表性节点扩张重要度

Adaptive Resource Allocation Algorithm for 5G Vehicular Cloud Communication

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第8期80卷 2199-2219页

作者： Huanhuan Li hongchang Wei Zheliang chen Yue Xu School of Mathematics and Computer Sciences Nanchang UniversityNanchang330031China Department of Electrical Engineering Jiangxi Vocational College of Mechanical&Electrical TechnologyNanchang330013China Kehua Data Co. Ltd.Xiamen361006China

The current resource allocation in 5G vehicular networks for mobile cloud communication faces several challenges,such as low user utilization,unbalanced resource allocation,and extended adaptive allocation *** propose an adaptive allocation algorithm for mobile cloud communication resources in 5G vehicular networks to address these *** study analyzes the components of the 5G vehicular network architecture to determine the performance of different *** is ascertained that the communication modes in 5G vehicular networks for mobile cloud communication include in-band and out-of-band ***,this study analyzes the single-hop and multi-hop modes in mobile cloud communication and calculates the resource transmission rate and bandwidth in different communication *** study also determines the scenario of one-way and two-way vehicle lane cloud communication network connectivity,calculates the probability of vehicle network connectivity under different mobile cloud communication radii,and determines the amount of cloud communication resources required by vehicles in different lane *** on the communication status of users in 5G vehicular networks,this study calculates the bandwidth and transmission rate of the allocated channels using Shannon’s *** determines the adaptive allocation of cloud communication resources,introduces an objective function to obtain the optimal solution after allocation,and completes the adaptive allocation *** experimental results demonstrate that,with the application of the proposed method,the maximum utilization of user communication resources reaches approximately 99%.The balance coefficient curve approaches 1,and the allocation time remains under 2 *** indicates that the proposed method has higher adaptive allocation efficiency.

关键词： 5G vehicular networks mobile cloud communication resource allocation channel capacity network connectivity communication radius objective function

SGuard：A Lightweight SDN Safe-Guard Architecture for DoS Attacks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2017年第6期14卷 113-125页

作者： Tao Wang hongchang chen National Digital Switching System Engineering and Technological Research Center Zhengzhou 450002 China

Software Defined Networking(SDN) is a revolutionary networking paradigm towards the future network,experiencing rapid development ***,its main characteristic,the separation of control plane and data plane,also brings about new security challenges,i.e.,Denial-of-Service(DoS) attacks specific to Open Flow SDN networks to exhaust the control plane bandwidth and overload the buffer memory of Open Flow *** mitigate the DoS attacks in the Open Flow networks,we design and implement SGuard,a security application on top of the NOX controller that mainly contains two modules:Access control module and Classification *** employ novel six-tuple as feature vector to classify traffic flows,meanwhile optimizing classification by feature ranking and selecting *** the modules will cooperate with each other to complete a series of tasks such as authorization,classification and so *** the end of this paper,we experimentally use Mininet to evaluate SGuard in a software *** results show that SGuard works efficiently and accurately without adding more overhead to the SDN networks.

关键词：安全防范体系 DOS攻击 SDN 轻量级网络模式 DoS攻击控制模块矢量分类

A Game-Theoretic Approach to Elastic Control in Software-Defined Networking

在线全文

学校读者我要写书评

暂无评论

China Communications 2016年第5期13卷 103-109页

作者： hongchang chen Guozhen cheng Zhiming Wang National Digital Switching System Engineering&Technological R&D Center Zhengzhou 450002China

Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migration operation, but not why. This paper designs a decision-making mechanism based on zero-sum game theory to reelect a new controller as the master for migrated switches. It first chooses a switch for migration in the heavy controller which invites its neighbors as the game players to compete for the master role of this switch in the game-playing field(GPF) which is an occasional and loose domain for game-playing. Second, based on the concept of GPF, we design a decentralized strategy to play the game and determine which player as the final master. We implement it by extending the Open Flow protocol. Finally, numerical results demonstrate that our distributed strategy can approach elastic control plane with better performance.

关键词：弹性控制软件定义网络博弈论动态开关游戏玩家开关控制器控制平面

Domain-Oriented Software Defined Computing Architecture

在线全文

学校读者我要写书评

暂无评论

China Communications 2019年第6期16卷 162-172页

作者： Ping Lv Qinrang Liu hongchang chen Ting chen National Digital Switching System Engineering and Technical R&D Center

With the introduction of software defined hardware by DARPA Electronics Resurgence Initiative,software definition will be the basic attribute of information *** from boundary certainty and algorithm aggregation of domain applications,domain-oriented computing architecture has become the technical direction that considers the high flexibility and efficiency of information *** at the characteristics of data-intensive computing in different scenarios such as Internet of Things(IoT),big data,artificial intelligence(AI),this paper presents a domain-oriented software defined computing architecture,discusses the hierarchical interconnection structure,hybrid granularity computing element and its computational kernel extraction method,finally proves the flexibility and high efficiency of this architecture by experimental comparison.

关键词： software defined hardware software defined computing architecture hierarchical interconnection mixed-granular computing element