共查询到19条相似文献,搜索用时 140 毫秒
1.
随着时间的推移,网络会随着节点和连边的变化不断发展。针对传统网络表示学习算法不能正确处理动态网络的问题,提出一种基于随机游走的动态连续时间网络表示学习算法(DCTNE)。通过定义一个灵活的节点时序邻居概念,设计一个有偏的随机游走过程。根据时间信息,有效地探索节点的不同时序邻居并建模不同邻居的影响,学习网络表示。实验证明了DCTNE动态网络时序信息的有效性。在链接预测任务上,DCTNE的AUC值与其他算法相比最高获得了50%的增益;在节点分类任务上,DCTNE相较于其他算法在效果上有明显提升。结果表明,对网络中时间依赖关系进行建模有助于后续的网络分析任务。 相似文献
2.
针对一类带节点处理速率限制的连续时间容量网络,提出了该网络中的最短动态时间流问题,并给出其线性规划形式;通过分析该网络与经典网络之间的内在联系,利用最大接收流和退流的思想分别设计出准确求解两种网络最短动态时间流的高效算法;证明了算法的正确性并分析出算法有较小的复杂度;最后,通过一个算例演示了算法的执行。 相似文献
3.
阐述离散时间最优控制的特点.对比3种求解离散时间最优控制的解法,即:1)用非线性规划求解离散时间最优控制;2)用无约束优化求解离散时间最优控制;3)动态规划及其数值解.1)和2)都适用于多维静态优化,计算效率较高,是高级方法.在名义上,3)为动态优化.实际上,3)为一维分段无约束静态优化,计算效率较低,是初级方法.本文并用数字实例进一步阐明动态规划及其数值解在求解方面较差,故动态规划及其数值解已失去实用价值.在求解离散时间最优控制问题方面,无法与非线性规划求解相匹敌. 相似文献
4.
讨论由随机微分方程描述的随机连续信号的辨识建模问题,提出并证明了非平稳的连续Wiener过程通过稳定的连续线性系统后为平稳随机过程,且均值和自相关函数阵为时间遍历的,基于状态空间分析,给出了连续随机信号建模的时间序列分析方法,并证明了参数估计的一致性收敛性,仿真结果显示了所提出方法的有效性, 相似文献
5.
动态网络链路预测是目前复杂网络的热点研究方向,网络表示学习可以有效学习到节点的相似性,从而为链路预测提供基础.现有的动态网络表示学习方法大多先将动态网络进行离散窗口化,然后在静态网络快照图上建模,这样很难有效处理具有细粒度时间特性的动态网络.本文提出了一种可以学习动态网络中复杂的时间特性的链路预测模型,该模型使用连续时间事件序列表示动态网络,对网络中的连续时间信息和结构演化特征进行学习,并提出了基于时间注意力的信息传递机制来模拟网络中信息的扩散与聚合,最后将链路预测转化为分类问题.实验在4个真实动态网络数据集以及模拟网络上进行,并以ap和auc作为评价指标.真实网络实验结果证明该模型能够较好地学习网络演化的连续性,得到更有效的节点表示,从而提升了链路预测效果.模拟网络的实验结果表明链路预测的效果和网络模型相关,但本文模型仍可以获得较好的预测效果. 相似文献
6.
7.
GFS-Net是一种新的DHT覆盖网络。本文介绍了GFS-Net的拓扑结构,并完善了其搜索算法,提出了与GFS-Net相适应的动态复制算法,它包括两个部分:(1)根据文件的请求频率增减副本数目;(2)根据下裁性能较低的站点的分布确定新增副本的位置。该算法可以根据副本的请求频率和分布,动态调整副本的数目和分布,平衡各个站点的负载,降低用户下裁文件的响应时间。 相似文献
8.
9.
10.
11.
Recent advances in high speed networking technologies and video compression techniques have made Video-on-Demand (VOD) services feasible. A large-scale VOD system imposes a large demand on I/O bandwidth and storage resources, and therefore, parallel disks are typically used for providing VOD service. Although striping of movie data across a large number of disks can balance the utilization among these disks, such a striping technique can exhibit additional complexity, for instance, in data management, such as synchronization among disks during data delivery, as well as in supporting fault tolerant behavior. Therefore, it is more practical to limit the extent of data striping, for example, by arranging the disks in groups (or nodes) and then allowing intra-group (or intra-node) data striping only. With multiple striping groups, however, we may need to assign a movie to multiple nodes so as to satisfy the total demand of requests for that movie. Such an approach gives rise to several design issues, including: (1) what is the right number of copies of each movie we need so as to satisfy the demand and at the same time not waste storage capacity, (2) how to assign these movies to different nodes in the system, and (3) what are efficient approaches to altering the number of copies of each movie (and their placement) when the need for that arises. In this paper, we study an approach to dynamically reconfiguring the VOD system so as to alter the number of copies of each movie maintained on the server as the access demand for these movies fluctuates. We propose various approaches to addressing the above stated issues, which result in a VOD design that is adaptive to the changes in data access patterns. Performance evaluation is carried out to quantify the costs and the performance gains of these techniques. 相似文献
12.
13.
Optimal control of a class of time invariant single-input, discrete bilinear systems is investigated in this paper. Both deterministic and stochastic problems are considered.
In the deterministic problem, for the initial state in a certain set ∑0, the solution is the same as the solution to the associated linear system. The optimal path may be a regular path or a singular path.
The stochastic control problem is considered with perfect state observation, and additive and multiplicative noise in the state equation. It is demonstrated that the presence of noise simplifies the analysis compared to that in the determinstic case. 相似文献
14.
Xiao-Jian Li 《International journal of systems science》2013,44(3):586-595
This article deals with the dynamic output feedback control synthesis problem for Itô-type stochastic time-delay systems. Our aim is to design a full order dynamic output feedback controller to achieve the desired control objectives. We will formulate the controller design problem as an H ∞ optimisation problem in the mean-square sense. The main contributions of this article are as follows: (i) for stochastic systems, the design of a controller with multiple objectives can be addressed without employing a unique Lyapunov function; (ii) using an inequality technique and Finsler Lemma, we provide convex controller synthesis conditions described by linear matrix inequalities (LMIs). Some examples are presented to show the effectiveness of the developed theoretical results. 相似文献
15.
In this paper, adaptive linear quadratic regulator (LQR) is proposed for continuous-time systems with uncertain dynamics. The dynamic state-feedback controller uses input-output data along the system trajectory to continuously adapt and converge to the optimal controller. The result differs from previous results in that the adaptive optimal controller is designed without the knowledge of the system dynamics and an initial stabilizing policy. Further, the controller is updated continuously using input-output data, as opposed to the commonly used switched/intermittent updates which can potentially lead to stability issues. An online state derivative estimator facilitates the design of a model-free controller. Gradient-based update laws are developed for online estimation of the optimal gain. Uniform exponential stability of the closed-loop system is established using the Lyapunov-based analysis, and a simulation example is provided to validate the theoretical contribution. 相似文献
16.
17.
An optimal control problem for systems of stochastic differential-functional linear equations with past history and Poisson switchings is formulated. The Bellman equation is solved for this problem.Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 112–118, November–December 2004.This revised version was published online in April 2005 with a corrected cover date. 相似文献
18.
针对目前对于动态车辆调度问题的研究仅集中于考虑时间依赖或依概率变化的情形,在对原有动态车辆调度问题模型进行总结的基础上,综合考虑了时间依赖且网络依概率变化,以及结合带有时间窗和随机需求的情况,提出了新的问题模型,并提出求解该问题模型的多目标随机机会约束规划模型,设计了用遗传算法解决该模型的方案与步骤。实验结果表明,所提出的模型可有效地拟合交通状况,设计的算法可以有效地求解该模型。 相似文献