共查询到20条相似文献,搜索用时 93 毫秒
1.
2.
针对网络控制系统(NCS)中存在的时延可能大于一个采样周期,以及网络传输存在丢包可能的情况,提出了改进的动态矩阵控制(DMC)算法,通过在线纠正系统的阶跃响应系数来处理时延造成的系统误差,并通过建立缓存器,当数据传输过程中出现丢包时利用动态矩阵算法计算控制量及未来输出预测值的冗余信息来替代丢失的实时信息,减少丢包对系统性能的影响.最后通过基于TrueTime的实时仿真系统研究,对比了不同时延及丢包率情况下改进算法与传统动态矩阵控制算法的效果,表明随着时延和丢包率的增大,改进动态矩阵算法的优势明显,从而验证了该方法的有效性. 相似文献
3.
控制网络中传输延迟的存在,导致确定性闭环网络控制系统转化成一时变不确定性系统.针对网络控制系统中存在小于一个采样周期的传输延迟,提出控制方案,分析建立数学模型,设计出满足要求的时延网络控制器.并通过仿真验证了该结果的正确性,使系统在能控性和稳定性方面得到明显改善. 相似文献
4.
5.
6.
7.
8.
9.
具有网络丢包和时延的网络控制系统设计 总被引:6,自引:0,他引:6
为了降低对于网络传输的要求,针对具有固定时延和随机丢包情况的网络系统,采用状态增广以克服时延对网络控制系统分析的影响,进而考虑随机丢包情况,将增广系统转化为切换系统.以此为基础,提出网络鲁棒控制器设计方法.该控制器仅仅基于被控对象的反馈状态,因此对于网络传输的要求较低.最后,通过一个仿真算例验证了该系统的有效性. 相似文献
10.
11.
蔡玉硕 《数码设计:surface》2009,(8):174-176
近几年来,无论是学校还是社会在谈到大学生素质时,常常会涉及诸如缺乏创新能力、知识面狭窄、缺乏独立生活的能力、缺乏团队精神、心理承受力有限等问题。本文将结合教学实践和相关调查从社会需求与学生对团队精神认知之间的矛盾、设计与团队精神的关系入手,探讨如何培养高校设计专业学生团队精神以适应知识经济时代社会对设计人才需求的问题。 相似文献
12.
The importance of curriculum development on archives and records management in the digital era, especially on the African continent, cannot be overemphasized. While many universities in the global hub have included studies on all aspects of archives and records management programs with many emphasizing records created in networked environments, the same cannot be said about universities on the African continent. In Africa, education and training of archives and records professionals can be traced back several decades. Archives and records practitioners in Africa’s different countries have, over the years, taken varying paths to attain their professional qualifications. This study outlines progress on an ongoing study by InterPARES Trust Africa Team that examines the curricula in different African educational institutions and investigates the extent to which they address the increasingly complex environment that includes the management of digital records in networked environments. It is hoped that the study will inform curriculum development and review in the area of digital records at the institutions of higher learning in Africa. 相似文献
13.
Piek Vossen Laura Bloksma Antonietta Alonge Elisabetta Marinai Carol Peters Irene Castellon Antonia Marti German Rigau 《Computers and the Humanities》1998,32(2-3):153-184
This paper describes how the Euro WordNet project established a maximum level of consensus in the interpretation of relations, without loosing the possibility of encoding language-specific lexicalizations. Problematic cases arise due to the fact that each site re-used different resources and because the core vocabulary of the wordnets show complex properties. Many of these cases are discussed with respect to language internal and equivalence relations. Possible solutions are given in the form of additional criteria. 相似文献
14.
15.
随着IT技术的发展,许多企事业单位都开发了自己的网站。但随着时间的推移,经常需要对网站进行优化。在对网站进行内容审查市,可从客户对网站内容的看法、分析网站内容、重新规划网站内容、对网站原先内容重新优化四个方面进行。对企事业单位进一步提升网站的知名度有较强的指导意义。 相似文献
16.
17.
18.
Jérémie Chalopin Yoann Dieudonné Arnaud Labourel Andrzej Pelc 《Distributed Computing》2016,29(3):187-205
Two mobile agents, starting from different nodes of an unknown network, have to meet at a node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent. Agents do not know any bound on the size of the network. In each round an agent decides if it remains idle or if it wants to move to one of the adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault in a given round, it remains in the current node, regardless of its decision. If it planned to move and the fault happened, the agent is aware of it. We consider three scenarios of fault distribution: random (independently in each round and for each agent with constant probability \(0<p<1\)), unbounded adversarial (the adversary can delay an agent for an arbitrary finite number of consecutive rounds) and bounded adversarial (the adversary can delay an agent for at most c consecutive rounds, where c is unknown to the agents). The quality measure of a rendezvous algorithm is its cost, which is the total number of edge traversals. For random faults, we show an algorithm with cost polynomial in the size n of the network and polylogarithmic in the larger label L, which achieves rendezvous with very high probability in arbitrary networks. By contrast, for unbounded adversarial faults we show that rendezvous is not possible, even in the class of rings. Under this scenario we give a rendezvous algorithm with cost \(O(n\ell )\), where \(\ell \) is the smaller label, working in arbitrary trees, and we show that \(\varOmega (\ell )\) is the lower bound on rendezvous cost, even for the two-node tree. For bounded adversarial faults, we give a rendezvous algorithm working for arbitrary networks, with cost polynomial in n, and logarithmic in the bound c and in the larger label L. 相似文献
19.
20.
移动IP为移动主机在移动过程中保持其通信不间断提供了实现方法,隧道技术是移动IP的关键技术之一,当通信节点向移动节点发送数据报时,需要使用到隧道技术。介绍了移动IP中隧道技术的基本原理,并给出了一种在Linux系统下的实现方法,对于移动IP相关软件的研究和开发具有一定的借鉴作用。 相似文献