共查询到19条相似文献,搜索用时 109 毫秒
1.
随着大规模分子相互作用数据的不断涌现,生物学网络方面的研究正日益得到重视.代谢网络处于生物体的功能执行阶段,其结构组成方式不仅反映了生物体的功能构成,也直接影响代谢工程中的途径分析和研究.作为代谢网络研究的重要环节,实现网络的合理分解不仅对于基因组范围内分子网络的结构和功能研究具有重要意义,也是代谢工程的途径分析和优化得以顺利进行的前提之一.在回顾代谢网络宏观结构和拓扑特征研究成果的基础上,通过对现有分解方法的深入分析,指出缺乏合理且有针对性的模型评估准则是目前网络分解研究中亟待解决的问题之一.今后的研究趋势在于如何整合更多的信息和发展更先进的分析方法,建立更合理的模型,并进一步拓展网络分解的应用范围. 相似文献
2.
3.
网络中心战是未来防空反导的主要作战样式,网络复杂性也是需要研究的重要问题之一。提出了基于小世界网络的防空反导系统网络模型,并针对统计特征和脆弱性等网络复杂性进行了研究。仿真结果表明,基于WS小世界网络的防空反导系统网络模型节点平均度高,节点间联系紧密,信息传播速度快,鲁棒性好,网络的脆弱性较低。 相似文献
4.
5.
6.
在分析信息化体系作战能力"跃迁"特征的基础上,进行了作战体系的网络化结构建模分析;研究了感知网络、指控网络以及执行网络能力模型,构建了基于网络理论的体系作战能力综合模型。结合仿真算例分析,探讨了体系信息结构力的产生机理,为体系作战能力综合研究提供了借鉴和支撑。 相似文献
7.
8.
基于复杂网络和传播动力学相关原理,构建了符合大型船舶人员交互特征的社交网络,定义了传播网络层级结构,分析了交互网络拓扑生成的5项规则,给出了大型船舶流行病传播社交网络构成方法。基于多智能体技术,研究了交互网络节点成员属性和流行病传播特点,给出了智能体成员状态空间的基本构成形式,融合防护治疗、管控隔离、信息交互等因素的物理特征,构建了智能体状态迁移和行为交互过程算法,并分析论证了衰减函数的结构及区间特性。对比距离恒定模型和随机游走模型,分别对典型大型船舶流行病传播过程分4种工况12种状态进行了仿真计算,结果表明:随机游走模型更适合信息量丰富条件下的大型船舶流行病早期传播过程模拟仿真和疫情防控策略分析。 相似文献
9.
10.
面对军事信息系统日益呈现出的复杂性和网络化结构特点,提出基于复杂网络的研究思路,通过把通信实体映射为节点,把节点与节点之间的通信联络映射为边,构建出军事通信网络拓扑模型。然后通过实体数值分析的方法,验证了军事通信网络的复杂性特征。为将复杂网络成果运用到未来军事通信系统建设中去提供了积极的理论启示和参考价值。 相似文献
11.
提出具有解耦能力的多通道图注意力社交推荐模型,该模型主要包括深度聚类模块、多通道图注意力聚合模块和评分预测模块。其中,深度聚类模块用于对用户和项目进行分组,并利用聚类结果将用户社交图和用户项目图拆分成多个用户社交子图及用户项目子图,以学习用户兴趣分组及用户对不同类项目的兴趣;多通道图注意力聚合模块学习不同子图对预测结果的注意力;评分预测模块将学习到的用户表示向量和项目表示向量输入多层感知机进行评分预测。在多个真实数据集上的实验结果表明:提出的方法优于其他社交推荐算法。与最新的用于社交推荐的图神经网络方法相比,在Ciao和Epinions数据集上,均方根误差分别降低了2.26%和2.07%,平均绝对误差分别降低了2.58%和3.06%。 相似文献
12.
13.
To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
14.
During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
15.
Steve Alpern 《海军后勤学研究》2002,49(3):256-274
Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011 相似文献
16.
We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
17.
搜索交互网络中的最短路径是研究网络结构的重要内容,在常见的Dijkstr和Floyd算法中,只能获取一条最短路径.在交互网络上任意节点对之间的最短路径不止一条的情况下,运用Floyd算法对已知加权交互网络的最短路径进行求解,对获得最短路径后的每一个节点对,在其中插入已知交互网络中的其余所有节点,并计算此时的节点对之间的... 相似文献
18.
为保证新一代移动无线网络能够根据实时覆盖情况动态地调节小区天线参数,需要实现高效且准确的无线覆盖预测。传统的求解方法通过精确的场强预测来判断天线参数的优劣,虽然精度很高但需要大量的计算资源,无法满足5G和后5G移动网络通过实时覆盖预测进行射频参数动态调整的实际需求。现采用基于深度神经网络的算法对给定天线参数的覆盖效果进行预测,以取代对目标区域的精确场强预测。数值结果表明,该方法能够在保持计算准确性的同时显著减少计算量,为5G动态网络规划提供基础性参考数据。 相似文献
19.
在实际的通信系统中,由于物理条件的限制,每个节点都具有有限长度的队列。研究了在有限队列资源的条件下,队列资源对无标度数据流动力学的影响。提出了一种队列资源重分配策略,策略中节点的队列长度与节点的介数成正比。仿真结果表明,在无标度网络中使用最短路径路由的条件下,所提出的重分配策略可以有效地改进网络的容量。同时对有限队列资源条件下的网络容量进行了理论分析。 相似文献