Algorithms

In this article, we consolidate the introductory concepts developed in the previous article of the series (Resonance, Vol.1, No.1) and develop theiterative construct, one of the most important control constructs used to describe algorithms.     

Algorithms

In this article we introduceprocedural abstraction and illustrate its uses. Further, we illustrate the notion of recursion which is one of the most useful features of procedural abstraction.     

Algorithms

This article continues with the exploration of common algorithm design techniques. In particular, we discuss balancing, greedy strategy, backtracking or traversal of trees and the dynamic programming strategy.     

Algorithms

In this introductory article the concept of algorithm which forms the foundation of computer science is defined. A diagrammatic form of describing algorithms known as flow-charts is introduced and used to express some elementary algorithms.     

Algorithms

In this article, we describe structured data types such as one dimensional arrays and illustrate the use of data structures in the development of searching and sorting programs.We illustrate an algorithmic design technique referred to asthe Divide-and-Conquer method and introduce an important and a prominent data structure calledtrees.     

Algorithms

In the previous articles, we had studied various topics such as algorithms, programs, programming languages, and algorithm design techniques. We shall now take a look at notions such as algorithmic universality, computability, incomputability and also discuss algorithmic limitations.     

Algorithms

In this article, we show how the general abstraction of a program as being composed of data and algorithms aids in the understanding of the universality of computers and the development of programs. We describe a simple organization of the memory unit of a computer, and discuss number representation. Subsequently, we show the need and use of types in programming. Further, we describe simple data types and illustrate the use of simple datastructures in the development of programs.     

Algorithms

This article continues with the exploration of common data structures. In particular, we shall discuss representation of common data structures such as lists, queues, stacks, trees, and two dimensional arrays.     

Algorithms as machines

To solve problems occurring in the real world, computing scientists devise algorithms. These algorithms are programmed on computers and used to solve the problems. But computing scientists also talk about ‘machines’ of various kinds, such as Turing machines, Mealy machines and von Neumann machines. (These are quite different from actual computers.) This article examines how algorithms turn into machines. The problems considered are the very elementary ones of addition, multiplication and factoring.     

二重极限的求法

二重极限在多元函数微积分学中有着举足轻重的作用,探讨其求法是进一步学习多元函数微积分有关概念和方法的基础,文中着重从八个方面通过典型实例分析研究归纳了二重极限方法.     

数据挖掘与进化算法

数据挖掘是信息爆炸问题的一种解决方案，进化算法是模拟自然进化过程而产生的计算机算法，其实是一种优化技术，在数据挖掘中引入进化算法具有相当的现实意义。     

遗传算法概述

遗传算法是一种全局优化的随机搜索算法。它是解决复杂优化问题的有力工具。在工程设计、演化硬件电路设计以及人工智能等方面应用前景广阔。系统地介绍了遗传算法的发展史、基本思想、特点、主要应用领域等相关方面。     

遗传算法综述

回顾了遗传算法的发展历程，并对遗传算法的基本原理及特点作了简要阐述；进一步指出了遗传算法存在的问题及相应的改进措施；讨论了遗传算法在实际中的应用。     

程序设计中常用的分类算法

针对程序设计中常出现的分类问题．介绍了六种常用的分类算法：冒泡分类、选择分类、合并分类、基数分类(桶分类)、堆分类、快速分类，以及每种分类法所需的时间复杂度。当对大量的数据进行分类时，应选择适当的算法，以提高程序的执行速度。     

两种排序算法的改进

介绍了两种较为成熟的排序方法冒泡法和选择排序法,指出这两种排序方法都可在原来基础上实现双向排序。并以选择排序法为例,给出了新算法的算法思想、算法描述和算法的程序实现。通过分析算法的比较次数和移动次数得出结论:新算法和传统的排序算法方法同样简单,但排序效率相同甚至更高,均可作为实际排序和教学过程中的思路参考。     

有保证调度算法的研究

有保证的调度对硬实时系统是必须的 ,这是因为系统中每个进程必须满足它们的截止时间 ,否则后果不堪设想 .本文讨论了两种有保证的调度算法 ,它们是分支限界法和回溯法 ,给出了用这两种算法寻找最优解的过程 ,提出逻辑结点和物理结点的概念 .通过对多个进程集合寻找最优解的实验 ,对两种算法在产生的结点个数、比较次数、搜索树的拓扑结构及占用的内存空间等方面进行了比较     

基于语义的搜索算法研究

基于XML得出改进的语义表示法,能解决当前常用网络搜索引擎缺乏理解用户想法而导致查询结果不满意的问题。文档解析算法、模式匹配算法、生成XMLSE文档算法等几个基于语义搜索的核心算法,辅以人工标注和建立规则库,构成一个语义网络,能达到精确的搜索,提高搜索效率。     

基于网络链接模型算法的改进

基于Web超链接分析对当前存在的主流算法PageRank与HITS作了研究.主要讨论了PageRank算法存在评价下滑与评价泄漏的缺陷;简略介绍了HITS算法在主题相关度方面存在的问题;对上述缺陷做出了修正并提出了改进方向.     

循环冗余算法与应用

讨论了CRC的代数学算法。以常见的CRC-ITU为例,介绍了它的比特型算法,给出了该算法的应用;通过算法计算出一个PPP帧的CRC,并进行了验证。