In this paper, we investigate the factor properties and gap sequence of the Tri- bonacci sequence, the fixed point of the substitution σ（a, b, c） = （ab, ac, a）. Let Wp be the p-th occurrence of w and Gp（ω） be ...In this paper, we investigate the factor properties and gap sequence of the Tri- bonacci sequence, the fixed point of the substitution σ（a, b, c） = （ab, ac, a）. Let Wp be the p-th occurrence of w and Gp（ω） be the gap between Wp and Wp＋l. We introduce a notion of kernel for each factor w, and then give the decomposition of the factor w with respect to its kernel. Using the kernel and the decomposition, we prove the main result of this paper： for each factor w, the gap sequence {Gp（ω）}p≥1 is the Tribonacci sequence over the alphabet {G1 （ω）, G2（ω）, G4（ω）}, and the expressions of gaps are determined completely. As an application, for each factor w and p C ∈N, we determine the position of Wp. Finally we introduce a notion of spectrum for studying some typical combinatorial properties, such as power, overlap and separate of factors.展开更多
Histogram Intersection Kernel Support Vector Machines (SVM) was used for the image classification problem. Specifically, each image was split into blocks, and each block was represented by the Scale Invariant Feature ...Histogram Intersection Kernel Support Vector Machines (SVM) was used for the image classification problem. Specifically, each image was split into blocks, and each block was represented by the Scale Invariant Feature Transform (SIFT) descriptors;secondly, k-means cluster method was applied to separate the SIFT descriptors into groups, each group represented a visual keywords;thirdly, count the number of the SIFT descriptors in each image, and histogram of each image should be constructed;finally, Histogram Intersection Kernel should be built based on these histograms. In our experimental study, we use Corel-low images to test our method. Compared with typical RBF kernel SVM, the Histogram Intersection kernel SVM performs better than RBF kernel SVM.展开更多
可重构密码流体系结构是一种面向密码运算的新型体系结构,但存在着超长指令字(VLIW)代码稀疏和Kernel体积过大的问题。该文以可重构密码流处理架构S-RCCPA为研究平台,通过大量密码算法在S-RCCPA架构上的适配分析,提出了VLIW可重构技术,...可重构密码流体系结构是一种面向密码运算的新型体系结构,但存在着超长指令字(VLIW)代码稀疏和Kernel体积过大的问题。该文以可重构密码流处理架构S-RCCPA为研究平台,通过大量密码算法在S-RCCPA架构上的适配分析,提出了VLIW可重构技术,并设计了Kernel级指令集、VLIW可重构算法及指令可重构单元。实验证明,该技术能够有效提高VLIW的指令密度,同时降低了VLIW的指令宽度,使得整个Kernel体积减小了约33.3%,并将微码存储器的容量由96 k B降为64 k B,有效降低芯片整体面积和系统功耗。展开更多
基金supported by grants from the National Science Foundation of China(114310071127122311371210)
文摘In this paper, we investigate the factor properties and gap sequence of the Tri- bonacci sequence, the fixed point of the substitution σ（a, b, c） = （ab, ac, a）. Let Wp be the p-th occurrence of w and Gp（ω） be the gap between Wp and Wp＋l. We introduce a notion of kernel for each factor w, and then give the decomposition of the factor w with respect to its kernel. Using the kernel and the decomposition, we prove the main result of this paper： for each factor w, the gap sequence {Gp（ω）}p≥1 is the Tribonacci sequence over the alphabet {G1 （ω）, G2（ω）, G4（ω）}, and the expressions of gaps are determined completely. As an application, for each factor w and p C ∈N, we determine the position of Wp. Finally we introduce a notion of spectrum for studying some typical combinatorial properties, such as power, overlap and separate of factors.
文摘Histogram Intersection Kernel Support Vector Machines (SVM) was used for the image classification problem. Specifically, each image was split into blocks, and each block was represented by the Scale Invariant Feature Transform (SIFT) descriptors;secondly, k-means cluster method was applied to separate the SIFT descriptors into groups, each group represented a visual keywords;thirdly, count the number of the SIFT descriptors in each image, and histogram of each image should be constructed;finally, Histogram Intersection Kernel should be built based on these histograms. In our experimental study, we use Corel-low images to test our method. Compared with typical RBF kernel SVM, the Histogram Intersection kernel SVM performs better than RBF kernel SVM.
文摘可重构密码流体系结构是一种面向密码运算的新型体系结构,但存在着超长指令字(VLIW)代码稀疏和Kernel体积过大的问题。该文以可重构密码流处理架构S-RCCPA为研究平台,通过大量密码算法在S-RCCPA架构上的适配分析,提出了VLIW可重构技术,并设计了Kernel级指令集、VLIW可重构算法及指令可重构单元。实验证明,该技术能够有效提高VLIW的指令密度,同时降低了VLIW的指令宽度,使得整个Kernel体积减小了约33.3%,并将微码存储器的容量由96 k B降为64 k B,有效降低芯片整体面积和系统功耗。
