浅析递归方程解法及其渐进阶表示

递归是算法设计中常用的方法之一,利用递归可以得到很多高效算法.递归算法由初始情况和递归部分组成,一般可以采用递归方程表示.分析了递归方程常用解法,比较了各个解法的区别及使用范围,并研究了如何表示递归方程对应的算法复杂度的渐进阶.     

Why do EMD‐based methods improve prediction? A multiscale complexity perspective

Empirical mode decomposition (EMD)‐based ensemble methods have become increasingly popular in the research field of forecasting, substantially enhancing prediction accuracy. The key factor in this type of method is the multiscale decomposition that immensely mitigates modeling complexity. Accordingly, this study probes this factor and makes further innovations from a new perspective of multiscale complexity. In particular, this study quantitatively investigates the relationship between the decomposition performance and prediction accuracy, thereby developing (1) a novel multiscale complexity measurement (for evaluating multiscale decomposition), (2) a novel optimized EMD (OEMD) (considering multiscale complexity), and (3) a novel OEMD‐based forecasting methodology (using the proposed OEMD in multiscale analysis). With crude oil and natural gas prices as samples, the empirical study statistically indicates that the forecasting capability of EMD‐based methods is highly reliant on the decomposition performance; accordingly, the proposed OEMD‐based methods considering multiscale complexity significantly outperform the benchmarks based on typical EMDs in prediction accuracy.     

A Note on the Correspondence Between Complexity and Systems Theory

Complexity theory shares a common vocabulary with systems theory. Terms such as emergence, complexity, and adaptation appear in both traditions. Despite the similarities, complexity theory is not a misnomer for systems theory. Several points of departure exist in complexity's research agenda and methods. Moreover, while systems theory appears to have embraced interpretivist and critical philosophies, complexity theory remains firmly in the positivist camp, despite claims that it is a postmodern science.     

一类Alternant的格子复杂度上界

研究了Ａｌｔｅｒｎａｎｔ码的格子复杂度。利用码的直和结构。给出了一类Ａｌｔｅａｎｔ码的格子复杂度的上界，改进了Ｗｏｌｆ上界，推广了文献「３」的结果。     

F_p上一类周期倒序序列稳定性分析

流密码稳定性的重要度量指标是序列的线性复杂度。通过生成多项式和极小多项式研究了F_p上一类周期为2N的倒序新序列的稳定性,给出了其极小多项式及线性复杂度,并讨论了F_p上由这类倒序新序列构成的多维周期序列的联合极小多项式及联合线性复杂度,这些结论对周期序列的研究有一定的应用价值。     

基于二重分圆术的二元序列的线性复杂度计算

在密码学、序列设计与编码理论的许多应用中有多种分圆术.最近,Chung和Yang提出了一种新的k重分圆术并被用于设计具有良好相关性质的序列.本文基于二重分圆术研究了一类二元序列的线性复杂度的计算,同时给出了相应构造序列的极小多项式的计算.     

一种新的求解CQSDP的全-Newton步内点算法

对凸二次半定规划提出了一种新的全-Newton步原始-对偶内点算法.通过建立和应用一些新的技术性结果,证明了算法的迭代复杂性为O( n log n )ε ,这与目前凸二次半定规划的小步校正内点算法最好的迭代复杂性一致.     

基于复杂网络的类间集成测试序列生成方法

类间集成测试是面向对象软件测试的一个重要部分.将类抽象成节点,类间调用关系抽象成边,建立面向对象软件的复杂网络模型,根据软件网络的结构特征,分析类节点的影响力和复杂性,给出一种软件重要节点的度量方法.在此基础上,将错误被尽早发现的思想应用在类间集成测试排序中,在确保构造的测试桩复杂度较小的前提下,保证重要节点优先测试,得到了一种基于复杂网络的类间集成测试序列生成方法.最后,在开源软件DNS 1.2.0上进行分析和验证,证明了该方法的有效性.     

一种基于有序双端链表的高效排序算法

本文提出一种新的基于有序双端链表的比较排序算法,即ODListsort(ordered double-end linked list sort)算法。该算法首先要定义一个可共存的链表最大数量,然后通过生成链表、根据规则插入数据以及合并操作来对数据集进行排序。在ODListsort算法中,数据元素是以链表形式进行动态内存分配的,因此它比一些经典的排序算法性能更优。实验结果表明,对于随机数据集,ODListsort排序与快速排序的速度接近,比归并排序、选择排序、插入排序以及冒泡排序的速度更快;对于有序数据集,ODListsort排序的效率远超快速排序,略高于归并排序。