关键词： 数学形态学   边缘检测   SUSAN算子   图像处理  

摘要： 提出基于数学形态学和SUSAN算子的灰度图像边缘提取方法,同时对SUSAN算子进行了改进。该方法利用数学形态学开运算估计背景,将原始图像与背景进行几何运算,在处理后的图像上运用改进的SUSAN算子提取边缘,并进行了仿真实验。实验结果表明,该方法不仅具有较好的去噪和边缘提取能力,而且算法简单易于实现,运算速度快。

关键词： 数学模型   购买数量   满意度最大   最优分配方案  

摘要： 当愿意观看的人数一定,则在若干个月内使一定百分比的会员得到他想看的,需要购买的各种的数量,并求得使得会员满意度最大的最优分配方案,本文给出了在一定假设条件下解决这类问题的相应数学模型及其算法。

关键词： Repetitions   Squares   Cubes   Runs   Consecutive repeats   Tandem repeats   Compression   Factorisation   Algorithms  

摘要： The article is an overview of basic issues related to repetitions in strings, concentrating on algorithmic and combinatorial aspects. This area is important both from theoretical and practical points of view. Repetitions are highly practical points periodic factors (substrings) in strings and are related to periodicities, regularities, and compression. The repetitive structure of strings leads to higher compression rates, and conversely, some compression techniques are at the core of fast algorithms for detecting repetitions. There are several types of repetitions in strings: squares, cubes, and maximal repetitions also called runs. For these repetitions, we distinguish between the factors (sometimes qualified as distinct) and their occurrences (also called positioned factors). The combinatorics of repetitions is a very intricate area, full of open problems. For example we know that the number of (distinct) primitively-rooted squares in a string of length n is no more than 2n - Theta(log n), conjecture to be n, and that their number of occurrences can be Theta(n log n). Similarly we know that there are at most 1.029 n and at least 0.944 n maximal repetitions and the conjecture is again that the exact bound is n. We know almost everything about the repetitions in Sturmian words, but despite the simplicity of these words, the results are nontrivial. One of the main motivations for writing this text is the development during the last couple of years of new techniques and results about repetitions. We report both the progress which has been achieved and which we expect to happen. (C) 2009 Elsevier B.V. All rights reserved.

关键词： 高等数学   极限   各种算法  

摘要： 极限的概念是高等数学中最重要也是最基本的概念之一。作为研究分析方法的重要理论基础，它是研究函数的导数和定积分的工具，极限的思想和方法也是微积分中的关键内容。在理解的基础上，熟练掌握求极限的方法，能够提高高等数学的学习能力。

关键词： 车牌定位   图像识别   数学形态学   行扫描  

摘要： 提出了一种基于数学形态学和行扫描的车牌定位算法:首先利用数学形态学使车牌区域形成一系列的连通候选区域;然后结合车牌的特征及白像素点数的统计,利用行列扫描对车牌精确定位。实验结果表明,该算法定位效果好、速度快,可用于对实际车牌图像的定位。

关键词： 数学形态学   加权平均   均值滤波   中值滤波   形态学滤波  

摘要： 噪声污染字符图像的预处理是字符识别技术中一项关键技术,字符识别的准确度直接取决于字符图的质量。基于消噪和数学形态学的基本原理,提出了一种预处理算法。仿真实验验证了所提出新算法的有效性和可行性。这种算法不仅能消除图像中的噪声,而且还有效地修复了笔划断裂的字符。新算法解决了识别笔划缺损字符的识别难点,从而间接地提高了字符识别技术的准确度。

关键词： 算法教学   中学数学   计算机科学   信息时代   数学素养   算法思想  

摘要： 算法是数学及其应用的重要属性，也是计算机科学的基础。在信息时代里，算法思想已成为我们必备的一种数学素养。

关键词： clone   programming ecology   SAA scheme   model  

摘要： The clone theory is developed with a view to formalizing algorithmic knowledge in object domains. The Post clone, algorithmic clones of Dijkstra and Glushkov, Kaluzhnin graph schemes, Kleene clone of regular expressions, and Codd clone of n-relations with various superposition operations are briefly presented. The concept of an n-relation clone is used to formalize scientific problems characterized by processing large amounts of structured information. Economic applications are considered as model examples.

关键词： 数学形态学   图像预处理  

摘要： 该文提出了一种基于数学形态学的图像预处理方法。首先对原始图像进行了改进的形态滤波处理,依次用一个略大于目标尺寸的结构元素和一个小于目标尺寸的结构元素对原始图像进行开运算;求两次滤波所得图像之差作为图像增强后的结果。实验结果表明,此方法最大限度地消除了各种噪声和畸变对图像中目标区域的影响,更加完整的保留了目标边缘的细节信息。