首先分析层次边聚合图(hierarchical edge bundles)使用扇环和样条曲线进行可视化布局的特点,阐述使用样条曲线聚合连接线以减少视觉复杂度的设计细节;接着在分析基于SVG的D3(data-driven do cuments)可视化库特点的基础上,重点描述使...首先分析层次边聚合图(hierarchical edge bundles)使用扇环和样条曲线进行可视化布局的特点,阐述使用样条曲线聚合连接线以减少视觉复杂度的设计细节;接着在分析基于SVG的D3(data-driven do cuments)可视化库特点的基础上,重点描述使用贝塞尔曲线分段绘制样条曲线的过程,并通过D3实现具有高亮、旋转等交互性的层次边聚合图。在案例分析中,应用基于D3的层次边聚合图对jEdit和Linux的代码重复检测结果进行可视化分析。其分析结果表明:基于D3实现层次边聚合图具有可行性;将层次边聚合图技术应用到软件可视化分析中具有可行性。展开更多
为了从根本上解决现有互联网存在的可扩展性、移动性和安全性等方面的问题,全新的未来互联网体系结构得到了广泛研究.其中,命名数据网络(named data networking,简称NDN)利用网内缓存和多路转发实现了基于层次化名字的高效数据传输,从...为了从根本上解决现有互联网存在的可扩展性、移动性和安全性等方面的问题,全新的未来互联网体系结构得到了广泛研究.其中,命名数据网络(named data networking,简称NDN)利用网内缓存和多路转发实现了基于层次化名字的高效数据传输,从根本上解决了现有互联网所面临的问题.内容的层次化名字具有数量庞大、结构复杂等特点,现有的基于IP的路由转发机制无法直接应用于NDN网络,需要有针对性地研究高效的层次化名字路由机制,保证海量网络内容的正常路由转发.路由聚合是缩减网络路由规模的主要措施.不同于现有的面向本地NDN路由表查表过程的优化,路由聚合需要全网协同处理,在不同网络节点上不断对聚合路由进行聚合.这对聚合路由标识和聚合路由可用性评估提出了诸多要求.为此,研究并提出了针对层次化名字路由的聚合机制,包括两个方面的工作:(1)构建了一种全新的计数布隆过滤器——堆叠布隆过滤器,该过滤器支持多过滤器合并,用于压缩表示被聚合路由名字;(2)给出了一种动态路由聚合机制,在保证NDN网络路由转发准确性的同时,缩小全网路由规模,最大程度地优化了路由转发效率.在真实网络拓扑上构建了仿真平台,经过实验验证,该路由聚合机制以可控的少量冗余转发为代价,有效地压缩了全网路由规模,提升了全网路由转发效率,保证了海量在线内容的高效路由转发,为NDN网络投入实际部署提供了前提.展开更多
In order to evaluate the general situation and find special problems of the freeway incident management system, an evaluation model is proposed. First, the expert appraisal approach is used to select the primary evalu...In order to evaluate the general situation and find special problems of the freeway incident management system, an evaluation model is proposed. First, the expert appraisal approach is used to select the primary evaluation index. As a result, 81 indices and the hierarchical structures of the index such as the object layer, the sub-object layer, the criterion layer and the index layer are determined. Then, based on the fuzzy characteristics of each index layer, the analytical hierarchy process(AHP)and the fuzzy comprehensive evaluation are applied to generate the weight and the satisfaction of the index and the criterion layers. When analyzing the relationship between the sub-object layer and the object layer, it is easy to find that the number of sub-objects is too large and sub-objects are significantly redundant. The partial least square (PLS) is proposed to solve the problems. Finally, an application example, whose result has already been accepted and employed as the indication of a new project in improving incident management, is introduced and the result verifies the feasibility and efficiency of the model.展开更多
文摘首先分析层次边聚合图(hierarchical edge bundles)使用扇环和样条曲线进行可视化布局的特点,阐述使用样条曲线聚合连接线以减少视觉复杂度的设计细节;接着在分析基于SVG的D3(data-driven do cuments)可视化库特点的基础上,重点描述使用贝塞尔曲线分段绘制样条曲线的过程,并通过D3实现具有高亮、旋转等交互性的层次边聚合图。在案例分析中,应用基于D3的层次边聚合图对jEdit和Linux的代码重复检测结果进行可视化分析。其分析结果表明:基于D3实现层次边聚合图具有可行性;将层次边聚合图技术应用到软件可视化分析中具有可行性。
文摘为了从根本上解决现有互联网存在的可扩展性、移动性和安全性等方面的问题,全新的未来互联网体系结构得到了广泛研究.其中,命名数据网络(named data networking,简称NDN)利用网内缓存和多路转发实现了基于层次化名字的高效数据传输,从根本上解决了现有互联网所面临的问题.内容的层次化名字具有数量庞大、结构复杂等特点,现有的基于IP的路由转发机制无法直接应用于NDN网络,需要有针对性地研究高效的层次化名字路由机制,保证海量网络内容的正常路由转发.路由聚合是缩减网络路由规模的主要措施.不同于现有的面向本地NDN路由表查表过程的优化,路由聚合需要全网协同处理,在不同网络节点上不断对聚合路由进行聚合.这对聚合路由标识和聚合路由可用性评估提出了诸多要求.为此,研究并提出了针对层次化名字路由的聚合机制,包括两个方面的工作:(1)构建了一种全新的计数布隆过滤器——堆叠布隆过滤器,该过滤器支持多过滤器合并,用于压缩表示被聚合路由名字;(2)给出了一种动态路由聚合机制,在保证NDN网络路由转发准确性的同时,缩小全网路由规模,最大程度地优化了路由转发效率.在真实网络拓扑上构建了仿真平台,经过实验验证,该路由聚合机制以可控的少量冗余转发为代价,有效地压缩了全网路由规模,提升了全网路由转发效率,保证了海量在线内容的高效路由转发,为NDN网络投入实际部署提供了前提.
文摘In order to evaluate the general situation and find special problems of the freeway incident management system, an evaluation model is proposed. First, the expert appraisal approach is used to select the primary evaluation index. As a result, 81 indices and the hierarchical structures of the index such as the object layer, the sub-object layer, the criterion layer and the index layer are determined. Then, based on the fuzzy characteristics of each index layer, the analytical hierarchy process(AHP)and the fuzzy comprehensive evaluation are applied to generate the weight and the satisfaction of the index and the criterion layers. When analyzing the relationship between the sub-object layer and the object layer, it is easy to find that the number of sub-objects is too large and sub-objects are significantly redundant. The partial least square (PLS) is proposed to solve the problems. Finally, an application example, whose result has already been accepted and employed as the indication of a new project in improving incident management, is introduced and the result verifies the feasibility and efficiency of the model.