This paper studies fractal properties of polar sets for random string processes. We give upper and lower bounds of the hitting probabilities on compact sets and prove some sufficient conditions and necessary condition...This paper studies fractal properties of polar sets for random string processes. We give upper and lower bounds of the hitting probabilities on compact sets and prove some sufficient conditions and necessary conditions for compact sets to be polar for the random string process. Moreover, we also determine the smallest Hausdorff dimensions of non-polar sets by constructing a Cantor-type set to connect its Hausdorff dimension and capacity.展开更多
Let {us （x） ： s 〉 0, x ∈ JR} be a random string taking values in ]Rd. The main goal of this paper is to discuss the characteristics of the polar functions of {us （x） ： s ≥ 0, x ∈ JR}. The relationship betwee...Let {us （x） ： s 〉 0, x ∈ JR} be a random string taking values in ]Rd. The main goal of this paper is to discuss the characteristics of the polar functions of {us （x） ： s ≥ 0, x ∈ JR}. The relationship between a class of continuous functions satisfying the HSlder condition and a class of polar-functions of {us（x） ： s 〉 0, x ∈ R} is presented. The Hausdorff and packing dimensions of the set that the string intersects a given non-polar continuous function are determined. The upper and lower bounds are obtained for the probability that the string intersects a given function in terms of respectively Hausdorff measure and capacity.展开更多
近似串匹配技术在网络信息搜索、数字图书馆、模式识别、文本挖掘、IP路由查找、网络入侵检测、生物信息学、音乐研究计算等领域具有广泛的应用.基于CREW-PRAM(parallel random access machine with concurrent read and exclusive wri...近似串匹配技术在网络信息搜索、数字图书馆、模式识别、文本挖掘、IP路由查找、网络入侵检测、生物信息学、音乐研究计算等领域具有广泛的应用.基于CREW-PRAM(parallel random access machine with concurrent read and exclusive write)模型,采用波前式并行推进的方法直接计算编辑距离矩阵D,设计了一个允许k-差别的近似串匹配动态规划并行算法,该算法使用(m+1)个处理器,时间复杂度为O(n),算法理论上达到线性加速;采取水平和斜向双并行计算编辑距离矩阵D的方法,设计了一个使用a(m+1)个处理器和O(n/a+m)时间的、可伸缩的、允许k-差别的近似串匹配动态规划并行算法,+<11mna.基于分治策略,通过灵活拆分总线和合并子总线动态重构光总线系统,并充分利用光总线的消息播送技术和并行计算前缀和的方法,实现了汉明距离的并行计算,设计了两个基于LARPBS(linear arrays with reconfigurable pipelined bus system)模型的通信高效、可扩放的允许k-误配的近似串匹配并行算法,其中一个算法使用n个处理器,时间为O(m);另一个为常数时间算法,使用mn个处理器.展开更多
基金supported by the Natural Science Foundation of Zhejiang Province(Y6100663)
文摘This paper studies fractal properties of polar sets for random string processes. We give upper and lower bounds of the hitting probabilities on compact sets and prove some sufficient conditions and necessary conditions for compact sets to be polar for the random string process. Moreover, we also determine the smallest Hausdorff dimensions of non-polar sets by constructing a Cantor-type set to connect its Hausdorff dimension and capacity.
基金Supported by Natural Science Foundation of Zhejiang Province of China (Grant No. Y6100663)
文摘Let {us （x） ： s 〉 0, x ∈ JR} be a random string taking values in ]Rd. The main goal of this paper is to discuss the characteristics of the polar functions of {us （x） ： s ≥ 0, x ∈ JR}. The relationship between a class of continuous functions satisfying the HSlder condition and a class of polar-functions of {us（x） ： s 〉 0, x ∈ R} is presented. The Hausdorff and packing dimensions of the set that the string intersects a given non-polar continuous function are determined. The upper and lower bounds are obtained for the probability that the string intersects a given function in terms of respectively Hausdorff measure and capacity.
文摘近似串匹配技术在网络信息搜索、数字图书馆、模式识别、文本挖掘、IP路由查找、网络入侵检测、生物信息学、音乐研究计算等领域具有广泛的应用.基于CREW-PRAM(parallel random access machine with concurrent read and exclusive write)模型,采用波前式并行推进的方法直接计算编辑距离矩阵D,设计了一个允许k-差别的近似串匹配动态规划并行算法,该算法使用(m+1)个处理器,时间复杂度为O(n),算法理论上达到线性加速;采取水平和斜向双并行计算编辑距离矩阵D的方法,设计了一个使用a(m+1)个处理器和O(n/a+m)时间的、可伸缩的、允许k-差别的近似串匹配动态规划并行算法,+<11mna.基于分治策略,通过灵活拆分总线和合并子总线动态重构光总线系统,并充分利用光总线的消息播送技术和并行计算前缀和的方法,实现了汉明距离的并行计算,设计了两个基于LARPBS(linear arrays with reconfigurable pipelined bus system)模型的通信高效、可扩放的允许k-误配的近似串匹配并行算法,其中一个算法使用n个处理器,时间为O(m);另一个为常数时间算法,使用mn个处理器.
