基于矩阵变换的NTRUSign密钥生成算法

首次提出将矩阵变换应用于NTRUSign签名算法中,在NTRUSign签名算法中公开密钥和私有密钥的生成算法是最关键的部分,其实现时所花的时间占整个签名算法实现约一半以上的时间,直接影响NTRUSign的工作性能.矩阵是处理数学问题的重要工具,给出一种新的矩阵变换,并将之应用于求多项式的最大公因式问题中,且给出相应的求两个多项式最大公因式算法,并以该算法应用于NTRUSign中,得出NTRUSign密钥生成的优化算法.实验结果表明,该算法在寻找小多项式F和G比由JeffreyHoffstein给出的NTRUSign密钥生成算法的计算量和所占用的系统资源较少,该算法在生成密钥速度略快,为较有效的算法.     

求解单一重现期暴雨强度公式的Lingo-BFGS算法

为了克服一般的非线性优化算法对初始值的依赖,针对某一地区单一重现期暴雨强度公式参数计算问题,首先将Lingo软件编程求出的结果作为初始值,然后利用拟牛顿算法对其参数进行优化。实例计算结果表明：采用Lingo软件和拟牛顿法相结合的方法求解单一重现期暴雨强度公式比传统的方法精度更高,能有效解决实际优化设计问题。     

Affine Dependence Classification for Communications Minimization

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.     

模糊聚类和边缘检测结合的彩色图像分割算法

提出模糊聚类和边缘检测结合的彩色图像分割方法,以色彩图像直方图中自适应搜索到的峰值作为聚类中心,对图像进行模糊聚类。然后对模糊聚类后的图像进行边缘检测,检测出面积较大的区域的边缘,首先在区域内部进行融合,然后在区域边界和面积较小色彩相似的区域融合。实验表明,本方法不需预先确定聚类数目、聚类中心初始化,在区域融合后,可得到较好的分割效果。     

一种改进的双粒度地址映射算法

为设计高闪存空间利用率、低闪存擦除次数、低内存占用率的Flash管理算法,针对NAND闪存的擦写特性,提出一种改进的双粒度地址映射算法FAST算法,重新定义转换操作和合并操作,将顺序写日志块的合并操作变为转换操作。与传统FAST算法的比较结果表明,该算法可以减少一倍的擦除操作,提高空间利用率。     

An improved convergence analysis for the Newton–Kantorovich method using recurrence relations

We generate a sequence using the Newton–Kantorovich method in order to approximate a locally unique solution of an operator equation on a Banach space under Hölder continuity conditions. Using recurrence relations, Hölder as well as centre-Hölder continuity assumptions on the operator involved, we provide a semilocal convergence analysis with the following advantages over the elegant work by Hernánde? in (The Newton method for operators with Hölder continuous first derivative, J. Optim. Theory Appl. 109(3) (2001), pp. 631–648.) (under the same computational cost): finer error bounds on the distances involved, and a more precise information on the location of the solution. Our results also compare favourably with recent and relevant ones in (I.K. Argyros, Concerning the “terra incognita” between convergence regions of two Newton methods, Nonlinear Anal. 62 (2005), pp. 179–194; I.K. Argyros, Computational Theory of Iterative Methods, in Studies in Computational Mathematics, Vol. 15, C.K. Chui and L. Wuytack, eds., Elsevier Publ. Co., New York, USA, 2007; I.K. Argyros, On the gap between the semilocal convergence domain of two Newton methods, Appl. Math. 34(2) (2007), pp. 193–204; I.K. Argyros, On the convergence region of Newton's method under Hölder continuity conditions, submitted for publication; I.K. Argyros, Estimates on majorizing sequences in the Newton–Kantorovich method, submitted for publication; F. Cianciaruso and E. DePascale, Newton–Kantorovich approximations when the derivative is Hölderian: Old and new results, Numer. Funct. Anal. Optim. 24 (2003), pp. 713–723; F. Cianciaruso and E. DePascale, Estimates of majorizing sequences in the Newton–Kantorovich method, Numer. Funct. Anal. Optim. 27(5–6) (2006), pp. 529–538; F. Cianciaruso and E. DePascale, Estimates of majorizing sequences in the Newton–Kanorovich method: A further improvement, J. Math. Anal. Appl. 322 (2006), pp. 329–335; N.T. Demidovich, P.P. Zabreiko, and Ju.V. Lysenko, Some remarks on the Newton–Kantorovich mehtod for nonlinear equations with Hölder continuous linearizations, Izv. Akad. Nauk Belorus 3 (1993), pp. 22–26 (in Russian). (E. DePascale and P.P. Zabreiko, The convergence of the Newton–Kantorovich method under Vertgeim conditions, A new improvement, Z. Anal. Anwendvugen 17 (1998), pp. 271–280.) and (L.V. Kantorovich and G.P. Akilov, Functional Analysis in Normed Spaces, Pergamon Press, Oxford, 1982; J.V. Lysenko, Conditions for the convergence of the Newton–Kantorovich method for nonlinear equations with Hölder linearizations, Dokl. Akad. Nauk BSSR 38 (1994), pp. 20–24 (in Russian); B.A. Vertgeim, On some methods for the approximate solution of nonlinear functional equations in Banach spaces, Uspekhi Mat. Nauk 12 (1957), pp. 166–169 (in Russian); Amer. Math. Soc. Transl. 16 (1960), pp. 378–382. (English Trans.).)     

Parallel Processing of First Order Linear Recurrence on SMP Machines

In this paper, we propose a new algorithm that analyzes the data dependency pattern in the first-order linear recurrence (FOLR) and transforms it into algebraically equivalent expanded form so that it can be processed in parallel using the threads on symmetric multiprocessor (SMP) machines. The transformation aims to eliminate the data dependencies in the naive nested form of the FOLR. However, as this transformation may result in extra multiplication operations, our algorithm examines the immanent overhead of the expanded form of the FOLR and generates a new hybrid form of the FOLR. The hybrid form combines nested and appropriately expanded form in order to make it suitable for parallel processing. The parallel algorithm based on the hybrid form of the FOLR is analytically examined and tested through implementation on SMP machines. The implementation details, such as the workload balancing between processors and the optimization of cache performance, are also discussed. The experimental results show that the parallel algorithm based on the hybrid form of the FOLR considerably improves the performance on SMP machines that have three of more processors.     

Optimistic Value Model of Indefinite LQ Optimal Control for Discrete‐Time Uncertain Systems

Uncertainty theory is a branch of mathematics which provides a new tool to deal with the human uncertainty. Based on uncertainty theory, this paper proposes an optimistic value model of discrete‐time linear quadratic (LQ) optimal control, whereas the state and control weighting matrices in the cost function are indefinite, the system dynamics are disturbed by uncertain noises. With the aid of the Bellman's principle of optimality in dynamic programming, we first present a recurrence equation. Then, a necessary condition for the state feedback control of the indefinite LQ problem is derived by using the recurrence equation. Moreover, a sufficient condition of well‐posedness for the indefinite LQ optimal control is given. Finally, a numerical example is presented by using the obtained results.     

A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in certain sense. Based on the C-tree decomposition algorithm, we implemented a software package MMP/Geometer. Experimental results show that MMP/Geometer finds the smallest decomposition for all the testing examples efficiently.     

行为优化提升软件配置管理

软件配置管理包括对代码、文档、数据等的管理,其优劣受限于项目成员的实际操作。开发人员对于工作区如何使用;成员之间的代码是不是可以及时更新与同步;怎样使用分支,如何进行变更合并,才能减少物理空间浪费和事件延迟。这些问题在实际的项目开发中往往被忽视,亦或团队并没有对成员行为作细节的规范,因而许多软件项目出现了工期推迟或代码质量不高等问题。为此提出了一系列管理措施,通过优化软件配置管理规范项目各成员的行为,以保证高效的软件配置管理的实施。