基于改进异质协同演化的测试用例生成研究

路径搜索是测试用例自动生成的重要环节。针对遗传算法在测试用例生成中的“早熟”缺陷,提出一种改进的异质协同演化算法,将种群划分成两个子种群,分别采用遗传子群和差分子群进行演化,在演化的过程中两个子种群相互协作,通过改进迁移间隔代数和迁移率这两个参数,增加扰动,更加均衡遗传算法的全局探索与差异演化算法的局部搜索。实验结果表明,该算法比遗传算法和传统异质协同演化算法在生成测试用例的收敛性能方面更具优势,因此该方法更适合测试用例自动生成的应用中。     

Reconfiguring existing pollutant monitoring stations by increasing the value of the gathered information

The objective of this study is to provide a framework for relocating or reconfiguring existing pollution monitoring station networks by using feature selection and data mining techniques. This methodology enables a partial redesign based on the maximization of the available information that is gathered by the pollution networks by the optimal data mining technique. It also considers requirements of the decision makers, like potential target places, etc.Since this methodology is based on the quality of forecasting, it can also be useful for auditing and forecasting. A case study is included in this paper. In light of the prediction results, a new way to relocate the existing monitoring station is proposed.     

Tradeoffs in process strategy games with application in the WDM reconfiguration problem

We consider a variant of the graph searching games that models the routing reconfiguration problem in WDM networks. In the digraph processing game, a team of agents aims at processing, or clearing, the vertices of a digraph D. We are interested in two different measures: (1) the total number of agents used, and (2) the total number of vertices occupied by an agent during the processing of D. These measures, respectively, correspond to the maximum number of simultaneous connections interrupted and to the total number of interruptions during a routing reconfiguration in a WDM network.Previous works have studied the problem of independently minimizing each of these parameters. In particular, the corresponding minimization problems are APX-hard, and the first one is known not to be in APX. In this paper, we give several complexity results and study tradeoffs between these conflicting objectives. In particular, we show that minimizing one of these parameters while the other is constrained is NP-complete. Then, we prove that there exist some digraphs for which minimizing one of these objectives arbitrarily impairs the quality of the solution for the other one. We show that such bad tradeoffs may happen even for a basic class of digraphs. On the other hand, we exhibit classes of graphs for which good tradeoffs can be achieved. We finally detail the relationship between this game and the routing reconfiguration problem. In particular, we prove that any instance of the processing game, i.e. any digraph, corresponds to an instance of the routing reconfiguration problem.     

浅谈面向对象分析的基础教学

针对一个业务应用实例进行介绍,从而引入软件工程、面向对象分析的基本概念、优点和表示方法,并向读者展现如何在程序设计课程中开展面向对象分析与设计的基础教学。     

A cross‐institutional approach to staff development in Internet communication

Abstract Recent upsurge in emphasis on larger class sizes and work‐based learning requires lecturers to be equipped to switch from traditional face‐to‐face teaching techniques to communicating with students using new technologies. Dialogue is the vital ingredient which underpins the successful learning experience, and staff in HE are facing a challenge in developing the necessary skills to make effective use of the emerging communication tools. These skills can only be acquired through practice, understanding of the pedagogy and awareness of the various options available. The aim of this paper is to explore, through presenting a case study, the potential benefits of cross‐institutional collaboration in information and communication technology staff development. Since both the University of Strathclyde and Glasgow Caledonian University were investigating ways of promoting good practice in the development and use of new learning technologies, it seemed prudent to combine forces and share ideas. The paper will examine how attempts were made to bridge the skills gap by enabling academic staff to experience Internet communication from the perspective of both student and teacher.     

Exploring novice users' training needs in searching information on the WWW

Abstract Searching for information on the WWW involves locating a website and locating information on that site. A recent study implied that novice users' training needs exclusively relate to locating websites. The present case study tried to reveal the knowledge and skills that constitute these training needs. Fourteen pre‐university students, classified as novice (n = 7) or experienced WWW‐user (n = 7) performed three web search tasks. Their actions and verbalisations were recorded. Between‐group comparisons showed minimal performance differences. However, qualitative analyses of novice users' search performance suggest that their ability to locate websites could be enhanced by instructing monitoring skills and advanced system knowledge.     

SAR与可见光图象匹配方法的研究

由于SAR和可见光成象传感器图象的物理特征不同,因此进行匹配难度很大。本文在深入分析了这两种传感器图象物理特征的基础上,提出了一种图象匹配的新方法。该方法运用形态学滤波方法去除SAR图象斑点噪声,利用图象的边缘特征进行匹配,并采用多分辨率分级搜索技术减少计算量,在对实验结果进行分析的基础上提出了搜索真实匹配位置的原则,大大提高了匹配的准确率。通过实验对SAR图象斑点噪声滤波和SAR与可见光图象匹配算法进行了验证,实验证明本算法的SAR图象去噪效果明显优于传统的Frost方法,图象匹配精度高,稳定性好。     

无结构对等网搜索机制研究

无结构对等网络由于搜索的灵活性和对动态环境的适应性,得到了广泛的应用,已经成为对等网络的主流。本文研究了目前已有的无结构对等网络的搜索算法,指出了搜索算法的特点和不足,总结了无结构对等网络需要解决的问题。     

计算机专业案例教学法初探

“案例”教学法是一种运用案例进行教学的方法,普遍被应用于医学、法学、管理学等学科教学中。本文讨论了如何有效地把案例教学运用于计算机专业教学当中,从而提高计算机专业教学效果,培养出社会需求的高素质技能型人才。     

对于基于搜索方法的关联规则发现算法的研究

挖掘关联规则是数据挖掘领域的一个重要研究方向,本文首先介绍了一种基于层次的Apriori算法和一种基于搜索算法的QAIS算法,通过二者的比较,指出了QAIS算法中的优点以及不足之处。然后有针对性的提出了解决的方案,形成了ImprovedQAIS算法。