关键词： algorithms   ternary Golay code   syndrome polynomial   algebraic decoding  

摘要： A new algebraic decoding algorithm for the Ternary (11, 6, 5) Golay code is presented. The algorithm we present is based solely on the computation of the syndrome polynomials S(x) (without the evaluator and locator polynomial) and on the direct use of a Chien search directly over S(x). (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： 潮流计算   分布式计算   数学模型   电力系统  

摘要： 提出发输配全局潮流计算这一新课题，它以全局电力系统为研究对象，能计算出一体化的全局电力系统状态，弥补了传统潮流计算中发输电系统和配电系统完全独立进行的局限性，可满足全局控制决策的需要。建立了数学模型，构造了全局潮流主从分裂法，自然地将规模庞大的全局潮流问题分解成发输电潮流和一系列小规模的配电馈线潮流子问题，发输电和配电可用不同的潮流算法，满足了全局潮流在线分布式计算的要求。

关键词： singularity analysis   generating functions   Mellin transform   digital sums   Rice's method   trees   continued fractions   random generation   limit distribution  

摘要： Philippe Flajolet's research in theoretical computer science spans over more than 20 years. He made lasting contributions to the analysis of algorithms and analytic combinatorics. Among many of his results we mention here some in such diversified topics as enumeration, number theory, formal languages, continued fractions, automatic analysis of algorithms, Mellin transform, digital sums, recurrences, trees, random generation of combinatorial objects, random graphs and mappings, polynomial factorization, communications, codes, graphics, etc. This gives only a small snapshot of his work, and we encourage the reader to visit Flajolet's homepage http://***/algo/flajolet/*** for a fuller account. The bibliography was taken from his homepage and may not be totally complete, although we added a few items. Our paper was written without giving any prior notice to Philippe Flajolet. It reflects the view of the authors and any misunderstandings and shortcomings should be put on their account.

关键词： 信赖域算法   全局收敛性   Hesse阵无界  

摘要： 该文研究优化中采用信赖域技术的算法的全局收敛性.信赖域算法由于其很好的收敛性、强壮性,应计算技术的迅速发展及应用需求的日益强烈,得到了大量的研究,取得了很大的进展,但是,就理论而言大量的全局收敛性研究基于b<,k>的有界性,其中,b<,k>是信赖域二次型算法中Hesse阵的上界.〔Powell 1984〕开创性的证明了,只要b<,k>不太快增长,即b<,k>-O(k),无约束光滑优化的许多信赖域算法是全局收敛的.一些学者将其推广到其它情形.该文将更深入地研究全局收敛性结构,改进了一些学者的结果.第一章是该文的综述.第二章研究了采用任何下降试探步都接受策略时算法的全局收敛性,修正了通常的说法.第三章针对b<,k>无界情形,首次将单调信赖域算法全局收敛性理论推广至非单调信赖域算法.第四章研究等式约束优化问题,第一部分对〔57〕的算法作了简化的修正,给出更好的结果;第二部分将〔71〕的非单调信赖域算法的全局收敛性推广至b<,k>无界的情形,修正〔71〕观点;第五章研究了一般区域上的优化问题.第一部分将〔2〕的信赖域算法的全局收敛性推广至b<,k>无界情形,第二部分将〔60〕的非单调信赖域算法的全局收敛性推广至b<,k>无界情形.第六章研究非光滑优化的一般信赖域模型.在更一般的意义下,回答〔48〕针对线性约束提出的问题:b<,k>无界时的全局收敛性.

关键词： 滤波器   开关电容   自动综合   电子设计自动化   SCF  

摘要： 介绍了一种基于数学优化算法的双二阶有源开关电容（ＳＣ）标准模块电路级联实现的开关电容滤波器（ＳＣＦ）电容自动综合方法。它克服了传统设计方法动态范围小、敏感度高、电容比大的缺点，可以满意地设计低通、高通、带通和带阻等各种滤波器。

关键词： 自校正预报   隐式算法   数学模型   泰勒展开  

摘要： 文中给出了单输入单输出离散系统以泰勒展开为基础的数学模型的自校正预报的隐式算法。

关键词： 图象处理   数学形态学   计算机视觉   细化算法  

摘要： 对目标图象进行细化处理，提取其骨架，在目标检测、图象编码以及光学字符识别等计算机视觉、图象处理与模式识别领域都有着广泛的应用．在定义了数学形态学图象轮廓和骨架的基础上，提出了基于两组结构元素模板的数学形态学细化新算法，这两组结构元素模板分别用来去掉目标的西北、东北、东南、西南方向四个角上的点和北、东、南、西四个方向上的点．用该算法对实际的字符进行细化，获得了令人满意的结果．

关键词： 体育专项课   评估   高校   数学模型   体育教学  

摘要： １拟定指标体遵循的原则（１）方向性原则：指标应体现当前高校体育教学改革和发展的方向．（２）科学性原则：指标应反映体育教学的客观规律，衡量教学质量本质的因素及其内在的关系．（３）客观性原则：原则上利用社会上公认的评估指标，并结合高校体育教学的特点进行筛...

关键词： 配送问题   图   最优解   算法   数学模型  

摘要： 介绍了配送问题的两个数学模型及近似算法。

摘要： The view graph of a surface N in 3-space is a graph embedded in the space V of centers or directions of projection, whose nodes correspond to maximal connected regions of V which yield equivalent views of N. The size of the view graph of a piecewise smooth algebraic surface N with transverse self-intersection curves and isolated triple-points and cross-caps is O (n(K) (dim) (V)d(6) (dim) (V)), where n and d denote the number of "component surfaces" of N and their maximal degree, respectively, and where K = 6 in general or K = 3 for N diffeomorphic to the boundary of a polyhedron. (For surfaces without cross-caps, this bound has been established in [17].) Also, for the special piecewise linear case, where d = 1 and K = 3, it is known that the size of the view graph is actually Theta(n(3dim) (V)). It is shown that the exact view graphs of such surfaces can be determined in O (n(K(2 dim V+1))) . P(d, L) time by a deterministic algorithm and in O(n(K) (dim) (V+epsilon)) . P(d, L) expected time by a randomized algorithm. Here P is some polynomial, L is the maximal coefficient size of the defining polynomials of N, and epsilon is an arbitrarily small positive constant. Note that the randomized algorithm is, in terms of combinatorial complexity (where d and L are assumed to be constants which do not depend on n), nearly optimal-its combinatorial time complexity exceeds the size of the view graph only by epsilon in the exponent.