共查询到20条相似文献,搜索用时 187 毫秒
1.
2.
介绍了群组动画的发展和分类,并结合实例,分析了群组动画在电影电视制作中的应用。介绍了群组动画制作的软件Behavior的应用,并对一些功能的实现给出了具体的解决方法。 相似文献
3.
群组密钥协商是群组通信中非常重要的基本工具,现有群组密钥协商机制需要本地组成员全部参与协商,这严重制约群组通信系统的可扩展性与高效性。针对这个问题,文中提出了一种基于服务器端的群组密钥协商方案。该方案仅需要与每个组成员连接的服务器组间密钥协商,从而能够降低群组的存储开销和通信开销。同时在客户端函数库内通过设计一个单向映射机制实现从服务器组密钥到群组密钥变换。与基于客户端函数库的密钥协商机制相比,其可扩展性及密钥协商效率更高。 相似文献
4.
5.
6.
为解决现有分层无人机(UAV)网络中群组密钥管理存在的单点故障问题,群组成员离线导致整个群组无法计算、及时更新组密钥的问题,该文提出一种支持异步计算的去中心群组密钥管理方案。该方案采用异步棘轮树(ART)协议实现对群组密钥的预部署,各成员能对组密钥进行异步计算、自主更新;利用区块链技术的去中心化特性解决了单点故障问题,提高了群组密钥管理的透明性与公平性。性能评估表明,与同类方案相比,该方案中的簇成员无人机具有较低的计算开销和通信开销,适合应用于分层无人机网络环境。 相似文献
7.
群组行为识别是对个体的共同行为进行识别。群组行为与群组状态密不可分,也与群组内个体时空特征息息相关,时空信息既能描述空间语义信息,更能反映行为的动态变化情况。针对有效精细的时空特征提取问题,本文提出了一种基于注意力机制和深度时空信息的群组行为识别方法。首先将ShuffleAttention引入双流特征提取网络中,有效提取个体外观和运动信息。其次使用改进Non-Local网络提取深度时序信息。最后将个体特征送到图卷积网络中进行空间交互信息建模,得到群组行为识别结果。在CAD和CAED数据集上的准确率达到了93.6%和97.8%,在CAD数据集上与凝聚群组搜索算法(CCS)和成员关系图(ARG)方法相比,准确率提高了1.2%和2.6%,这表明本文方法能有效提取深度时空特征,提升群组行为识别准确率。 相似文献
8.
针对微型机器人群组控制对无线传输及多路舵机控制的需求,提出了一种基于STC12C5A60S2及CC2530实现对16路舵机无线群组控制的控制器设计方案,利用轮询机制和脉宽递增方法对多路舵机转角和转速独立控制,并基于Z-STACK协议栈实现自组网、无线传输和远程ISP下载。经实验测试,实现了对含多路舵机的多个微型机器人的无线群组控制。 相似文献
9.
10.
无线传感器网络中自治愈的群组密钥管理方案 总被引:3,自引:1,他引:2
群组密钥管理的自治愈机制是保证无线传感器网络在不可靠信道上进行安全群组通信的重要 手段.基于采用双方向密钥链的群组密钥分发与撤销方法,提出了一个无线传感器网络中具有撤销能力的自治愈群组密钥管理方案.该方案实现了群组密钥的自治愈功能和节点撤销能力, 能够满足在较高丢包率的无线通信环境下传感器网络群组密钥管理的安全需求,确保了群组密钥保密性、前向保密性和后向保密性等安全属性.性能分析表明,该方案具有较小的计算和通信开销,能够适用于无线传感器网络. 相似文献
11.
12.
简要介绍DVB-RCS卫星通信系统,着重讨论了网络管理在DVB-RCS系统中的作用,分析了卫星通信系统高效动态带宽资源分配、提高链路服务质量以及简化小站管理等方面的技术问题,以及网络管理系统在通信系统带宽利用率、服务质量保障等方面性能改善上的特殊贡献。 相似文献
13.
Secure multicast applications require key management that provides access control. In wireless networks, where the error rate is high and the bandwidth is limited, the design of key management schemes should place emphasis on reducing the communication burden associated with key updating. A communication-efficient class of key management schemes is those that employ a tree hierarchy. However, these tree-based key management schemes do not exploit issues related to the delivery of keying information that provide opportunities to further reduce the communication burden of rekeying. In this paper, we propose a method for designing multicast key management trees that match the network topology. The proposed key management scheme localizes the transmission of keying information and significantly reduces the communication burden of rekeying. Further, in mobile wireless applications, the issue of user handoff between base stations may cause user relocation on the key management tree. We address the problem of user handoff by proposing an efficient handoff scheme for our topology-matching key management trees. The proposed scheme also addresses the heterogeneity of the network. For multicast applications containing several thousands of users, simulations indicate a 55%-80% reduction in the communication cost compared to key trees that are independent of the network topology. Analysis and simulations also show that the communication cost of the proposed topology-matching key management tree scales better than topology-independent trees as the size of multicast group grows. 相似文献
14.
A central problem in personal communication systems is to optimize bandwidth usage, while providing Quality of Service (QoS) guarantees to mobile users. Network mobility management, and in particular, location management, consumes a significant portion of bandwidth, which is a necessary overhead for supporting mobile users. We focus our efforts on minimizing this overhead. Unlike previous works, we concentrate on optimizing existing schemes, and so the algorithms we present are easily incorporated into current networks. We present the first polynomial time approximation algorithms for minimum bandwidth location management. In planar graphs, our algorithm provably generates a solution that uses no more than a constant factor more bandwidth than the optimal solution. In general graphs, our algorithm provably generates a solution that uses just a factor O (log n) more bandwidth than optimal where n is the number of base stations in the network. We show that, in practice, our algorithm produces near-optimal results and outperforms other schemes that are described in the literature. For the important case of the line graph, we present a polynomial-time optimal algorithm. Finally, we illustrate that our algorithm can also be used for optimizing the handoff mechanism. 相似文献
15.
16.
IEEE 802.16无线城域网协议未给出网络带宽分配算法或建议。在此针对IEEE 802.16的QoS定义,通过在用户与网络间建立价格机制,提出多周期的广义Virckrey拍卖(GVA)机制(MP-GVA),实现多周期、连续资源预留机制以及对服务流带宽的动态按需分配。MP-GVA机制利用价格杠杆来调节用户需求和控制资源分配,达到优化系统资源配置和激励用户协作两个目标,而且通信开销较小,与IEEE 802.16具有良好的兼容性。 相似文献
17.
本文基于当前网格技术研究背景,分析了网格对于网络通信提出的新的要求,阐述了典型网格系统在通信环节的优缺点,概括了国际相关研究团体和个人在改善网格的通信性能方面所做的工作,最后分别从网格的连通性、链路利用率和带宽资源管理等方面提出改进的策略. 相似文献
18.
Lazar A.A. Temple A.T. Gidron R. 《Selected Areas in Communications, IEEE Journal on》1990,8(8):1582-1594
MAGNET II is a testbed for integrated networks. It was designed and implemented based on requirements of real-time network management and control. Quality-of-service requirements explicitly appear in the design specifications of the network on the media access level. Switching is based on the concept of asynchronous time sharing. The core of the network distinguishes between three traffic classes. The quality of service of these classes is monitored and controlled by the traffic-control architecture of the network. Monitoring is supported by observation units distributed throughout the system. The main network resources, switching bandwidth, communication bandwidth, and buffer space, are observable and controllable 相似文献
19.