关于AOE网中关键路径求解算法的研究

介绍AOE网中关键路径的相关概念,通过算法描述和实例,探讨基于拓扑排序求解、P矩阵的求解和广度优先搜索遍历（BFS）方法三种算法,求解AOE网中关键路径的实现过程,并进一步从算法的时间复杂度、数据结构形式及实现的容易程度等几方面分析三种求关键路径算法的优劣。     

基于密度可达的多密度聚类算法

为对多密度数据集聚类,提出一种基于密度可达的多密度聚类算法。使用网格划分技术来提高计算每个点密度值的效率,每次聚类都是从最高密度点开始,根据密度可达的概念和广度优先的策略逐步向外扩展进行聚类。实验表明,该算法能够有效地对任意形状、大小的均匀数据集和多密度数据集进行聚类,并能较好地识别出孤立点和噪声,其精度和效率优于SNN算法。     

Theoretical comparisons of search strategies in branch-and-bound algorithms

Four known search strategies used in branch-and-bound algorithms-heuristic search, depth-first search, best-bound search, and breadth-first search-are theoretically compared from the viewpoint of the performance of the resulting algorithms. Heuristic search includes the other three as special cases. Since heuristic search is determined by a heuristic functionh, we first investigate how the performance of the resulting algorithms depends onh. In particular, we show that heuristic search is stable in the sense that a slight change inh causes only a slight change in its performance. The best and the worst heurstic functions are clarified, and also discussed is how the heuristic functionh should be modified to obtain a branch-and-bound algorithm with an improved performance. Finally, properties and limitations of depth-first search, best-bound search, and breadth-first search viewed as special cases of heuristic search are considered. In particular, it is shown that the stability observed for heuristic search no longer holds for depth-first search.     

一种网站性能评价系统的设计与实现

本文在分析网站性能评价系统的功能需求和评价网站性能的主要指标的基础上，提出了网站性能评价应分为内部评价和外部评价两个方面，采用广度优先搜索算法等技术，设计并实现了从外部对网站性能进行评价的系统。     

虚拟士兵的智能记忆模型研究

为了提高虚拟士兵的真实度与可信度,在分析现有研究成果的基础上,依据生物记忆原理和遗忘特性,提出了一种智能记忆模型.构造了记忆信息的编码形式,建立了基于槽式和广义树结构的记忆分层存储模型；提出了带有参数的遗忘算法,并运用宽度优先算法,实现了记忆信息的搜索和调用.借助Matlab工具对算法进行了验证,验证结果表明该算法与实际情况基本相符.     

基于异步自动机的网格广度优先搜索算法

在网格中，经常需要以某个结点源点，构造一棵广度优先生成树来进行广播和聚合通信，现有的广度优先搜索算法都是基于图论的同步式算法，而在异步式的网格系统中不能采用这种算法，在开发国家高性能计算环境的过程中，以异步自动机为基础建立了网格理论模型，在这个模型的基础上实现了一种异步式网格广度优先搜索算法－－GridBFS算法，还证明了，GridBFS算法最终将产生一棵广度优先生成树，并且能够检测到算法的终止。     

车灯光源优化问题的探讨

本文讨论了在一定的光源设计前提下,光照强度及其分布所满足的规律,并在此基础上,分析了车灯线光源的优 化设计的途径。在分析的方法上,我们侧重于计算机数值模拟辅以理论推导,提出了一系列创新的技术,用以克 服离散途径解决连续问题时所遇到的困难。在基本的方法上,我们将线光源用离散的点光源逼近,将抛物面离 散为网格。这里我们从法向量变化率出发。提出按曲率划分而非单纯尺寸长度划分,大大提高了模拟精度。在 处理离散条件下点线相交时,我们引入了连通集这一重要概念,以克服(屏上点,光源)1—>(抛面面上点)映射 时的多值性,解决了因细分抛物面而产生的多重光路的问题。在实现过程中,我们应用了广度优先的线性复杂 度算法,使计算效率一跃提升了近5000倍。在解决多点采样问题时,我们又开发了并行连通集算法,减少了串行 算法的重复计算,使计算速度加快了近2000倍。在验证模型合理性和进行数据分析时,在第一题中我们着重于 收敛的程度问题,并证明我们的模型是稳定的,能克服误差的影响;第二小题中,我们着重分析光强分布的合理 性问题,并结合第三小题的要求,对图象进行分析,最终得出题目中的设计规范是符合实际应用需要的,并且光 源消耗很优化,光强分布合理。     

互连网络故障直径的研究

考虑了至多可以删除多少个顶点才能保证互连网络的连通。给出了网络的容错能力。根据Menger定理可以得到BC互连网络之间至少存在n条内部节点互不相交的路径。利用广度优先搜索的思想，给出了求任意两个节点之间的n条内部节点互不相交。且在两点间所有路径中是最短的n条路径的算法。该算法为网络故障直径的研究提供了依据。而且。在故障存在但是网络连通的情况下。可以求得网络中任意两节点间的n条最并行路径。提高了网络的容错能力。本文对提出的方法及算法的正确性进行了证明，为研究互连网络的性质提供了新的研究方法。     

Personality and its effects on learning performance: Design guidelines for an adaptive e-learning system based on a user model

An increasingly widespread interest in developing fully adaptable e-learning systems (e.g., intelligent tutoring systems) has led to the development of a wide range of adaptive processes and techniques. In particular, advances in these systems are based on optimization for each user's learning style and characteristics, to enable a personalized learning experience. Current techniques are aimed at using a learner's personality traits and its effect on learning preferences to improve both the initial learning experience and the information retained (e.g., top-down or bottom-up learning organization). This study empirically tested the relationship between a learner's personality traits, analyzed the effects of these traits on learning preferences, and suggested design guidelines for adaptive learning systems. Two controlled experiments were carried out in a computer-based learning session. Our first experiment showed a significant difference in the learning performance of participants who were identified as introverts vs. those who were identified as being extroverts, according to the MBTI scale. As the distinction between extroverted personality types vs. introverted personality types showed the strongest correlation in terms of different learning styles, we used this criteria in our second experiment to determine whether design guidelines for appropriate content organization could reinforce the aforementioned correlation between personality type and learning experience.     

利用图的广度优先搜索解决农夫过河问题

农夫过河问题是一类传统的数据结构问题,利用基于队列的图的广度优先搜索求解农夫过河问题是一个易于理解、切实可行的方案,具有一定的推广价值。