排序方式: 共有41条查询结果,搜索用时 0 毫秒
11.
12.
13.
通过论述虚拟仪器和传统仪器的特点,并进行了比较,提出在基础实验室和专业实验室中应如何有效地配置虚拟仪器和传统仪器。 相似文献
14.
This paper aims to find a practical way of quantitatively representing the privacy of network data. A method of quantifying the privacy of network data anonymization based on similarity distance and entropy in the scenario involving multiparty network data sharing with Trusted Third Party (TTP) is proposed. Simulations are then conducted using network data from different sources, and show that the measurement indicators defined in this paper can adequately quantify the privacy of the network. In particular, it can indicate the effect of the auxiliary information of the adversary on privacy. 相似文献
15.
本文以基于TM1300视频编码盒为硬件平台,分析传统的H.263视频编码控制算法,对TMN5和TMN8算法进行折衷,提出一种新的算法,该算法计算较简单,且缓存的充盈度较平稳,能满足低时延缓存的码率输出要求。 相似文献
16.
软件定义网络(SDN)架构给网络带来了卓越的灵活性和可管理性。为了给新型SDN技术与应用提供大规模可行性验证试验床与试点部署平台,提出了依托于CERNET的层次化跨区域SDN 异地验证示范网络试验系统的总体架构,建设了9个城市、13个节点的SDN验证示范核心网与包含3个数据中心的接入网,并对基于SDN的vCPE智能专线业务、IPv4/IPv6过渡技术、流量监控调度应用和数据中心应用进行验证与示范。 相似文献
17.
Traditional packet classification for IPv4 involves examining standard 5-tuple of a packet header, source address, destination address, source port, destination port and protocol. With introduction of IPv6 flow label field which entails labeling the packets belonging to the same flow, packet classification can be resolved based on 3 dimensions: flow label, source address and destination address. In this paper, we propose a novel approach for the 3-tuple packet classification based on flow label. Besides, by introducing a conversion engine to covert the source-destination pairs to the compound address prefixes, we put forward an algorithm called Reducing Dimension (RD) with dimension reduction capability, which combines heuristic tree search with usage of buckets. And we also provide an improved version of RD, called Improved RD (IRD), which uses two mechanisms: path compression and priority tag, to optimize the performance. To evaluate our algorithm, extensive experiments have been conducted using a number of synthetically generated databases. For the memory consumption, the two proposed new algorithms only consumes around 3% of the existing algorithms when the number of filters increases to 10 k. And for the average search time, the search time of the two proposed algorithms is more than four times faster than others when the number of filters is 10 k. The results show that the proposed algorithm works well and outperforms many typical existing algorithms with the dimension reduction capability. 相似文献
18.
该文提出基于Web Services的服务管理协议(WSSMP),用于有效地管理跨不同管理域的服务。利用Petri网对WSSMP进行了形式化描述,并利用Petri网的可达性分析对此协议进行了逻辑正确性验证,确保了此协议具有有界性、活性、完整性、前进性等性质,从而减少了协议设计中潜在的错误。并在仿真平台上进行了协议测试,测试表明读取大量对象时,随着读取对象数的增多,压缩WSSMP所使用的带宽增加很少,该协议适应服务管理需要大量处理数据的特性。 相似文献
19.
20.