一类修改的带NCP函数信赖域滤子算法

本文针对非线性规划给出了一种修改的带NCP函数的信赖域滤子SQP算法,主要的修改之处是用NCP函数替代了滤子中约束违反度函数,而且进一步证明了这种修改的算法同样具有全局收敛性.     

基于一族蕴涵算子的对偶三I算法

三I算法是一种新的模糊推理方法,是传统的模糊推理方法的修改和补充. 三I表达式取最小值时的最优解算法(即对偶三I算法)是三I算法思想的延伸和完善.本文针对蕴涵算子族Ip,讨论了FMP和FMT问题的对偶三I算法,给出了相应的计算公式,从而也进一步促进了对三I算法的研究.     

修改NURBS曲线造型的新方法

提出了一种修改NURBS曲线造型形状的新方法.对于给定的NURBS曲线,利用遗传算法修改其一个或多个权因子,使曲线经过事先指定的点.实验结果表明算法具有一定的实用性.     

基于尺度中心路径的求解SCLP的非单调光滑牛顿算法

基于CHKS光滑函数的修改性版本,该文提出了一个带有尺度中心路径的求解对称锥线性规划(SCLP)的非单调光滑牛顿算法.通过应用欧氏若当代数理论,在适当的假设下,证明了该算法是全局收敛和超线性收敛的.数值结果表明了算法的有效性.     

变分不等式和不动点问题的新迭代算法

本文在Hilbert空间上引入了一个新迭代算法,找到了伪单调变分不等式问题的解集与伪非扩张映射的不动点集的公共元.通过修改的超梯度算法,得到了弱收敛定理.所得结果推广和提高了许多最新结果.     

参数化设计中确定参数有效范围的吴特征列方法

参数化CAD设计中,需要对给定的草图进行修改进而得到满足设计者需求的模型.然而,在修改参数值时,常常由于给定的参数值不合理,而导致无法重新生成几何图形.利用吴特征列方法从代数可解的角度给出了一个在参数化设计中确定参数的有效范围的算法.实例的分析计算,证明算法是可行的.     

加速修改AHP中的判断矩阵的贪婪算法

通过分析判断矩阵 ,一致性矩阵 ,导出矩阵及度量矩阵的关系 ,提出一种修改判断矩阵的预测加速修正的贪婪算法 .贪婪法不追求最优解 ,不要回溯 ,只希望得到较为满意的解 .当判断矩阵的一致性较差时 ,基于度量矩阵中偏离大的元素对判断矩阵一致性的影响较大 ,通过导出矩阵和度量矩阵得出加速修正的步长 .每次只修改判断矩阵的一对元素 .实例分析表明 ,修改 AHP中的判断矩阵的贪婪算法是可行的 .     

一类带Wolfe条件的修改的Broyden算法

本文提出一类带Wolfe条件的修改的Broyden算法,证明了在一定条件下,算法具有整体收敛性、超线性收敛率和二阶收敛性,及Broyden算法的一些收敛性质。1.算法     

随机优化磨光算法对卫生陶瓷进出口的分析模型

结合磨光法和最优化理论提出一种随机优化磨光算法(SOS算法),算法通过原始值的参数化和调整幅度的修改,利用优化理论优化控制点.实例表明,随机优化磨光算法比样条修正磨光法和灰色马尔可夫链预测模型精度要高得多;而且所得到的误差变化更稳定.     

瓶颈型Hamming距离下约束最小支撑树的反问题

本文讨论了瓶颈型Hamming距离下约束最小支撑树的反问题,通过修改给定网络边上的权,使得修改后网络中指定的支撑树是最小支撑树并且支撑树中的最大边的权不超过给定的常数,用瓶颈型Hamming距离来衡量修改的费用,且修改费用最小. 把瓶颈型Hamming距离下约束最小支撑树的反问题转化为最小瓶颈权点覆盖问题,并给出了多项式算法.     

Analysis of the GCR method with mixed precision arithmetic using QuPAT

To verify computation results of double precision arithmetic, a high precision arithmetic environment is needed. However, it is difficult to use high precision arithmetic in ordinary computing environments without any special hardware or libraries. Hence, we designed the quadruple precision arithmetic environment QuPAT on Scilab to satisfy the following requirements: (i) to enable programs to be written simply using quadruple precision arithmetic; (ii) to enable the use of both double and quadruple precision arithmetic at the same time; (iii) to be independent of any hardware and operating systems.To confirm the effectiveness of QuPAT, we applied the GCR method for ill-conditioned matrices and focused on the scalar parameters α and β in GCR, partially using DD arithmetic. We found that the use of DD arithmetic only for β leads to almost the same results as when DD arithmetic is used for all computations. We conclude that QuPAT is an excellent interactive tool for using double precision and DD arithmetic at the same time.     

Applying fuzzy GERT with approximate fuzzy arithmetic based on the weakest t-norm operations to evaluate repairable reliability

In general, the fuzzy Graphical Evaluation and Review Technique (GERT) usually evaluates/analyzes variables with interval arithmetic (α-cut arithmetic) operations, especially those with complicated fuzzy systems. Thus the interval arithmetic operations may occur accumulating phenomenon of fuzziness in complicated systems, and the accumulating phenomenon of fuzziness may make decision-maker that cannot effectively evaluate problems/systems under vague environment. In order to overcome the accumulating phenomenon of fuzziness or credibly reduce fuzzy spreads, this study adopts approximate fuzzy arithmetic operations under the weakest t-norm arithmetic operations (T_ω) to evaluate fuzzy reliability models based on fuzzy GERT simulation technology. The approximate fuzzy arithmetic operations employ principle of interval arithmetic under the weakest t-norm arithmetic operations. Therefore, the novel fuzzy arithmetic operations may obtain fitter decision values, which have smaller fuzziness accumulating, under vague environment. In numerical examples the approximate fuzzy arithmetic operations has evidenced that it can successfully calculate results of fuzzy operations as interval arithmetic, and can more effectively reduce fuzzy spreads. In the real fuzzy repairable reliability model the performance also shows that the approximate fuzzy arithmetic operations successfully analyze the reliability problem and obtain more confident fuzzy results.     

On the arithmetic product of combinatorial species

We introduce two new binary operations on combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series in the context of species. It allows us to introduce the notion of multiplicative species, a lifting to the combinatorial level of the classical notion of multiplicative arithmetic function. Interesting combinatorial constructions are introduced; cloned assemblies of structures, hyper-cloned trees, enriched rectangles, etc. Recent research of Cameron, Gewurz and Merola, about the product action in the context of oligomorphic groups, motivated the introduction of the modified arithmetic product. By using the modified arithmetic product we obtain new enumerative results. We also generalize and simplify some results of Canfield, and Pittel, related to the enumerations of tuples of partitions with the restrictions met.     

A Longitudinal Study Revisiting the Notion of Early Number Sense: Algebraic Arithmetic AS a Catalyst for Number Sense Development

The aim of this study was to propose a new conceptualization of early number sense. Six-year-old students’ (n = 204) number sense was tracked from the beginning of Grade 1 through the beginning of Grade 2. Data analysis suggested that elementary arithmetic, conventional arithmetic, and algebraic arithmetic contributed to the latent construct early number sense, and the invariance of the model over time was validated empirically. Algebraic arithmetic represents the dimension of early number sense that moves beyond conventional arithmetic and encompasses an abstract understanding of the relations between numbers. A parallel process growth model showed that the three components of number sense adopt a linear growth rate. A structural model showed that the growth rate of the algebraic arithmetic component has a direct effect on the growth rate of conventional arithmetic, and subsequently the growth rate of conventional arithmetic predicts the growth rate of elementary arithmetic.     

A floating-point technique for extending the available precision

A technique is described for expressing multilength floating-point arithmetic in terms of singlelength floating point arithmetic, i.e. the arithmetic for an available (say: single or double precision) floating-point number system. The basic algorithms are exact addition and multiplication of two singlelength floating-point numbers, delivering the result as a doublelength floating-point number. A straight-forward application of the technique yields a set of algorithms for doublelength arithmetic which are given as ALGOL 60 procedures.Report MR 118/70, Computation Department, Mathematical Centre, Amsterdam. Part of this research was done while the author was visiting Bell Telephone Laboratories, Murray Hill, New Jersey.     

Interval Newton Iteration in Multiple Precision for the Univariate Case

In this paper, interval arithmetic using an underlying multiple precision arithmetic is briefly presented. Then interval Newton iteration for solving nonlinear equations is introduced. A new Newton's algorithm based on multiple precision interval arithmetic is given, along with its properties: termination, arbitrary accuracy on the computed zeros, automatic and dynamic adaptation of the precision. Finally, some experiments illustrate the behaviour of this method.     

算术半格的信息系统表示

本文给出了算术信息系统的概念,证明了算术信息系统是算术半格的表示。基于算术信息系统之间的逼近映射,我们得到了算术信息系统范畴和算术半格范畴之间的范畴等价。     

Modelling the Pulsating Process

We continue research on machine-oracle modelling of second-order arithmetic. The pulsating process described in [1, 2] is simulated using oracles of so-called autonomous hierarchies. The outcome is constructing a generalized constructive model for a fragment of second-order arithmetic described in [2].     

Chern invariants of some flat bundles in the arithmetic Deligne cohomology

In this note, we investigate the cycle class map between the rational Chow groups and the arithmetic Deligne cohomology, introduced by Green–Griffiths and Asakura–Saito. We show nontriviality of the Chern classes of flat bundles in the arithmetic Deligne Cohomology in some cases and our proofs also indicate that generic flat bundles can be expected to have nontrivial classes. This provides examples of non-zero classes in the arithmetic Deligne cohomology which become zero in the usual rational Deligne cohomology.     

基于小波系数相对模糊关系的水印方法

提出一种基于带参数整数小波变换和相对小波系数模糊关系的数字水印算法.应用基于视觉系统小波域量化噪声的视觉权重分析方法,自适应的构造模糊关系矩阵,在水印的提取过程中实现了盲检测.本方法与经典的密码理论以及高级加密算法相结合.应用Rabin方法生成单向Hash函数,信息隐藏算法可以完全公开.水印算法不可感知性好,鲁棒性强,是一种有效的版权保护方法.