Improved scheme to accelerate support vector regression

The computational cost of support vector regression in the training phase is O(N3), which is very expensive for a large scale problem. In addition, the solution of support vector regression is of parsimoniousness, which has relation to a part of the whole training data set. Hence, it is reasonable to reduce the training data set. Aiming at the scheme based on k-nearest neighbors to reduce the training data set with the computational complexity  O(kMN2), an improved scheme is proposed to accelerate the reducing phase, which cuts down the computational complexity from O(kMN2) to O(MN2). Finally, experimental results on benchmark data sets validate the effectiveness of the improved scheme.     

一类导数和定积分的有限迭代计算方法

利用计算多项式函数在某点函数值的H-M方法,通过对多项式的系数进行有限迭代计算,得到相应函数在确定点的各阶导数值和指定的区域上的定积分,并对其复杂度进行分析.     

Linear complexity problem of binary Jacobi sequence

This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,namely,by changing its few bits in one-period length,the linear complexity of the modified sequences will become far less than the required value.     

一类资源约束排序问题1|p_j=b_j-a_ju_j,∑w_jC_j≤A|∑u_j

讨论一类资源约束排序问题 1 |pj=bj-ajuj, wjCj≤A| uj,给出一个求解算法 ,给定一个排列 ,该算法能求出相应这个排列的最优排序 ,或断定该排列无相应的可行排序     

改进A*算法及其在GIS路径搜索中的应用

路径选择在实际运用中主要追求的是最优而不是最短.为此通常采用精度换效率的策略.这种策略虽然在一定程度上达到了路径搜索的任务要求,但如果能在精度和效率之间综合取值的话,效果往往会更令人满意.采用了一种改进的A*算法来实现这一目的.主要是通过变权值的方式来控制算法的搜索精度和搜索效率.实验证明,改进的A*算法可以实现最优路径的选择,且效率有很大的提高.     

A traffic model of optical networks based on time-space complexity and traffic grooming

This paper researched the traffic of optical networks in time-space complexity,proposed a novel traf-fic model for complex optical networks based on traffic grooming,designed a traffic generator GTS(gener-ator based on time and space)with centralized+distributed idea,and then made a simulation in Clanguage.Experiments results show that GTS can produce the virtual network topology which can changedynamically with the characteristic of scaling-free network.GTS can also groom the different traffic andtrigg...     

全球化进程的法律移植问题综述

全球化浪潮推动了全球性法律重构的进程 ,国家间互相借鉴、移植法律日趋频繁。但是中外法学界对于法律移植问题的研究尚处于初期阶段 ,对于法律移植的基本问题、法律移植的可行性、必要性等各学派观点不一 ,争论不休。全球化进程中的中国法制现代化运动同样无法回避这一问题 ,在选择借鉴、移植外国法律时 ,应认真研究来源国及本国的政治、经济文化和自然等条件 ,坚决杜绝照搬照抄式的“全盘西化” ,只有这样才能走出一条有中国特色的法律发展道路。     

Multi-scaling hierarchical structure analysis on the sequence ofE. coli complete genome

We have applied the newly developed hierarchical structure theory for complex systems to analyze the multi-scaling structures of the nucleotide density distribution along a linear DNA sequence from the completeEscherichia coli genome. The hierarchical symmetry in the nucleotide density distribution was demonstrated. In particular, we have shown that the G, C density distribution that represents a strong H-bonding between the two DNA chains is more coherent with smaller similarity parameter compared to that of A, T density distribution, indicating a better organized multi-scaling fluctuation field for G, C density distribution along the genome sequence. The biological significance of these findings is under investigation.     

Boole函数的稳健线性可分及其计数

Ｂｏｏｌｅ函数的线性可分和线性不可分问题，一直是前向人工神经网络的一个比较困难的问题，目前仅对变量数ｎ＜７的线性可分问题给予过讨论。本文基于简化问题讨论和优化问题的解的思想，提出了稳健分类复杂度的概念，并对Ｂｏｏｌｅ函数稳健分类复杂度为１的稳健线性可分问题，提出了对这类Ｂｏｏｌｅ函数进行计数的方法，并给出了计数结果     

中学地理教学过程的复杂性探讨

讨论了中学地理教学过程复杂性的表现和形成原因,分析了教学过程复杂性研究与传统教学研究的联系和区别,探讨了在中学地理教学过程设计中教师应具备的观念.