检索结果-南通市图书馆

A Caching Strategy Based on many-to-many matching Game in D2D Networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2021年第6期26卷 857-868页

作者： Kaihang Yu zhonggui ma Runyu Ni Tao Zhang School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China Key Lab of Information Network Security Ministry of Public SecurityShanghai 201204China

Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device(D2D) networks. We model the D2D User Equipments(DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy.(1) It can cache other contents besides high popularity contents.(2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used(LRU), Equal Probability Random Cache(EPRC), and the Most Popular Content Cache(MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.

关键词： caching strategy Device-to-Device(D2D)networks Gauss determinantal point process many-to-many matching game

An Improved Algorithm of Nonlinear RED Based on Membership Cloud Theory

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第3期26卷 537-543页

作者： ZHAO Yuhong ma zhonggui ZHENG Xuefeng TU Xuyan School of Information Engineering Inner Mongolia University of Science and Technology School of computer and communication Engineering University of Science and Technology Beijing

Concerning on the shortcoming and complexity of Random early detection(RED)algorithm in network congestion control,a new RED algorithm based on the Hemi-Rise Cloud model(CRED)was proposed,nonlinear packet loss strategy was used,and sensitivity and uncertainty of parameters were *** a result,queue length could be kept stable in the neighborhood of reference *** congestion was well controlled and network resource was used *** stability of the algorithm was studied and the experimental results showed that the proposed algorithm could improve the stability,and had better performance than the RED and Adaptive RED(ARED)algorithms.

关键词： RED Nonlinear Hemi-rise cloud model Membership degree NS2

Dense small cell clustering based on undirected weighted graph for local mobility management

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2016年第5期23卷 32-39页

作者： Li Yingying ma zhonggui Liu Liyu Yan Wenbo School of Computer and Communication Engineering University of Science and Technology Beijing

The concept of dense small cell has been recently emerged as a promising architecture that can significantly improve spectrum efficiency and system capacity. However, it brings frequent handover for user equipment （UE）. Furthermore, this will bring a great deal of signaling overhead to the core network. Virtual technology has been received widespread attention for solving this problem. Its essence is to form virtual cells by clustering various terminals properly. The local mobility management proposed recently is based on the virtual technology. Therefore, the formation process of virtual cells is the basis for the research in local mobility management. So clustering scheme for dense small cell network has been studied in this paper, and a maximum benefit merging algorithm based on undirected weighted graph has been proposed. There are X2 interfaces between the cluster head and each of cluster members within the same cluster. The cluster heads manage the handover among cluster members acting as the local anchors. The proposed clustering scheme is useful for local mobility management. The simulation results show that the proposed clustering algorithm can decrease the signaling overhead more than 70% and 20% compared with the non-clustering algorithm and other clustering algorithms respectively.

关键词： mobility management dense small cell network handover clustering LTE-A

在线全文

学校读者我要写书评

暂无评论

嵌入共识知识的因果图文检索方法

工程科学学报 2024年第2期46卷 317-328页

作者：梁彦鹏刘雪儿马忠贵李卓北京科技大学计算机与通信工程学院北京100083

跨模态图像-文本检索是一项在给定一种模态(如文本)的查询条件下检索另一种模态(如图像)的任务.该任务的关键问题在于如何准确地测量图文两种模态之间的相似性,在减少视觉和语言这两种异构模态之间的视觉语义差异中起着至关重要的作用.... 详细信息

跨模态图像-文本检索是一项在给定一种模态(如文本)的查询条件下检索另一种模态(如图像)的任务.该任务的关键问题在于如何准确地测量图文两种模态之间的相似性,在减少视觉和语言这两种异构模态之间的视觉语义差异中起着至关重要的作用.传统的检索范式依靠深度学习提取图像和文本的特征表示,并将其映射到一个公共表示空间中进行匹配.然而,这种方法更多地依赖数据表面的相关关系,无法挖掘数据背后真实的因果关系,在高层语义信息的表示和可解释性方面面临着挑战.为此,在深度学习的基础上引入因果推断和嵌入共识知识,提出嵌入共识知识的因果图文检索方法.具体而言,将因果干预引入视觉特征提取模块,通过因果关系替换相关关系学习常识因果视觉特征,并与原始视觉特征进行连接得到最终的视觉特征表示.为解决本方法文本特征表示不足的问题,采用更强大的文本特征提取模型BERT(Bidirectional encoder representations from transformers,双向编码器表示),并且嵌入两种模态数据之间共享的共识知识对图文特征进行共识级的表示学习.在MS-COCO数据集以及MS-COCO到Flickr30k上的跨数据集实验,证明了本文方法可以在双向图文检索任务上实现召回率和平均召回率的一致性改进.

关键词：因果推断图像-文本检索跨模态计算机视觉自然语言处理

同方期刊数据库

在线全文

学校读者我要写书评

暂无评论

电力竞价上网的博弈模型与算法

电力自动化设备 2009年第4期29卷 63-65页

作者：杨尚宝马忠贵王洪泊涂序彦北京理工大学自动控制系北京100081 北京科技大学信息工程学院北京100083

假设每个发电企业对上网电价进行密封报价、统一时间开标,报价低的一方中标,提出2个发电企业竞价上网的静态贝叶斯博弈模型与算法,当每个发电企业均采用线性策略时,分析了模型的收敛性和贝叶斯纳什均衡解的存在性;然后对2个发电企业竞... 详细信息

假设每个发电企业对上网电价进行密封报价、统一时间开标,报价低的一方中标,提出2个发电企业竞价上网的静态贝叶斯博弈模型与算法,当每个发电企业均采用线性策略时,分析了模型的收敛性和贝叶斯纳什均衡解的存在性;然后对2个发电企业竞价上网模型进行扩展,研究了多个发电企业竞价的贝叶斯纳什均衡,建立了多个发电企业竞价上网博弈模型。最后进行了计算机系统仿真,结果表明:所建立的模型随着企业数的增加,发电企业的报价更加趋于理性,逐渐趋近于预测值。

关键词：电力市场发电企业竞价上网贝叶斯博弈模型博弈论

在线全文

学校读者我要写书评

暂无评论

基于“推-拉”技术的多源复杂信息整合研究

计算机工程 2006年第5期32卷 178-180页

作者：马忠贵叶斌王成耀王宗杰涂序彦北京理工大学自动控制系北京100081 北京科技大学信息工程学院北京100083

为了实现系统之间的数据交换,提出基于智能信息“推-拉”技术的多源、多层次信息整合模式。应用系统之间的接口采用现在比较流行的Web Service技术封装,对于不直接支持SOAP技术的系统采取设计模式中的数据交换适配器来解决接口的兼容性... 详细信息

为了实现系统之间的数据交换,提出基于智能信息“推-拉”技术的多源、多层次信息整合模式。应用系统之间的接口采用现在比较流行的Web Service技术封装,对于不直接支持SOAP技术的系统采取设计模式中的数据交换适配器来解决接口的兼容性问题,屏蔽了数据格式与平台的差异,可以实现跨平台的应用集成以及应用之间的松散耦合特性,为应用集成提供了一种新思路。

关键词：智能信息“椎-拉”技术信息整合分布式人工智能数字气田

在线全文

学校读者我要写书评

暂无评论

认知无线网络自适应功率控制博弈算法

系统仿真学报 2015年第3期27卷 584-590页

作者：马忠贵班莎陈桂梅陈林旗北京科技大学计算机与通信工程学院通信工程系北京100083

为满足认知无线网络环境下各认知用户的需求,综合考虑认知用户距离基站的远近、算法稳定性及用户间的干扰问题,使用非合作博弈论对认知无线网络中的功率控制问题进行建模,提出一种使用收益函数和综合代价函数共同表示效用的自适应功率... 详细信息

为满足认知无线网络环境下各认知用户的需求,综合考虑认知用户距离基站的远近、算法稳定性及用户间的干扰问题,使用非合作博弈论对认知无线网络中的功率控制问题进行建模,提出一种使用收益函数和综合代价函数共同表示效用的自适应功率控制算法,理论证明了该算法存在唯一的纳什均衡解。通过引入综合代价函数,使各认知用户在非合作博弈下包含了协作的行为,从而获得帕累托最优解。matlab仿真表明,该自适应功率控制算法在满足不同用户对SIR需求不同的前提下,克服了远近效应,降低了认知用户的发射功率,实现了高频效和频谱共享的公平性。

关键词：认知无线网络功率控制非合作博弈论自适应