文章从边缘服务器的安全作用,客户计算机、边缘服务器和源服务器的工作关系,边缘服务器在DMZ中部署,边缘服务器的集群方式,配置Flash Media Server边缘服务器,建立边缘服务器集群,管理和维护边缘服务器集群等几个方面阐述了RIA流媒体交...文章从边缘服务器的安全作用,客户计算机、边缘服务器和源服务器的工作关系,边缘服务器在DMZ中部署,边缘服务器的集群方式,配置Flash Media Server边缘服务器,建立边缘服务器集群,管理和维护边缘服务器集群等几个方面阐述了RIA流媒体交互系统安全措施的边缘服务器部署。展开更多
随着工业生产中数据源的不断增加,人们对数据流的处理需求日益增大.其中,一个基本需求是基于距离度量方法的子序列匹配.由于动态时间弯曲距离(dynamic time warping,DTW)具有较高的度量精度,将其应用于子序列匹配问题是非常有价值的.但...随着工业生产中数据源的不断增加,人们对数据流的处理需求日益增大.其中,一个基本需求是基于距离度量方法的子序列匹配.由于动态时间弯曲距离(dynamic time warping,DTW)具有较高的度量精度,将其应用于子序列匹配问题是非常有价值的.但是,DTW具有较高的计算复杂度,这极大地限制了它在数据流上的应用.针对该问题,设计了一种高效的基于DTW的数据流子序列匹配系统.首先对数据流进行高效的适应性分段,然后对每一子段进行切比雪夫因式分解.不同于在原始数据空间的DTW计算,系统将在低维的切比雪夫特征空间计算DTW距离,因此,系统具有较高的计算效率.另外,提出了一种高效的在线匹配算法,可实现DTW在数据流上的增量式计算,进一步提高了系统的执行效率.展开更多
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k sym...The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.展开更多
文摘随着工业生产中数据源的不断增加,人们对数据流的处理需求日益增大.其中,一个基本需求是基于距离度量方法的子序列匹配.由于动态时间弯曲距离(dynamic time warping,DTW)具有较高的度量精度,将其应用于子序列匹配问题是非常有价值的.但是,DTW具有较高的计算复杂度,这极大地限制了它在数据流上的应用.针对该问题,设计了一种高效的基于DTW的数据流子序列匹配系统.首先对数据流进行高效的适应性分段,然后对每一子段进行切比雪夫因式分解.不同于在原始数据空间的DTW计算,系统将在低维的切比雪夫特征空间计算DTW距离,因此,系统具有较高的计算效率.另外,提出了一种高效的在线匹配算法,可实现DTW在数据流上的增量式计算,进一步提高了系统的执行效率.
基金supported by the National Natural Science Foundation of China under Grant No. 61063041the Program for New Century Excellent Talents of Universities in Fujian Province under Grant No. JK2010047the Funds of the Education Department of Gansu Province under Grant No. 1001-09
文摘The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.
