.NET平台下的单元测试

"开发未动,测试先行。"这是现代的极限编程理论。这突出显示出测试在现代软件开发中的重要性,而单元测试又是软件测试中的第一阶段的测试,也是最重要的。该文将阐述并实现在.NET平台下进行的单元测试。     

求解带时间窗车辆路径问题的改进粒子群算法

通过分析已有粒子群算法对有时间窗约束的车辆路径问题求解质量不高的原因,提出了一种基于粒子交换原理的整数粒子更新方法。采用构造的双层粒子进化算法分别对8个和20个任务点的有时间窗约束的车辆路径问题求解,数值实验结果表明算法的求解精度和耗时均优于已有算法。     

面向业务问题求解的知识供应过程模型

为了满足企业在业务问题求解方面的实际需求,提出了一个面向业务问题求解的知识供应过程模型。该模型提出了知识供应过程中的问题空间、知识空间和流程空间的概念及其关联关系,并进一步给出了包含知识的获取、评价、存储和重用的知识供应过程的有关算法。该模型与算法将业务问题求解过程与知识供应过程进行了融合,通过关联关系实现了知识的主动供应,在优化了业务问题求解过程的同时,提高了知识积累的质量和知识重用的效率。基于该模型建立了知识管理问题求解的原型系统KMPSS,并得到了初步应用验证。     

一种快速的基于球体混合重建的碰撞检测算法

为了解决虚拟特征和虚拟环境中虚拟物体的相交问题,必须对实时的虚拟应用环境实施快速的碰撞检测.提出了基于球体混合重建的碰撞检测算法,对球体混合表面提出了一个子线性时间复杂性的重建过程;利用四元组构造变换范围,扩展了从线性到球形混合的构造变换方法;采用循环划分的方法完成了由球体混合到线性混合的分解过程.尽管这个方法的实现过程较线性的方法更难些,但算法的执行过程所需时间却与线性方法相差无几,其复杂性也与线性结构的相同.     

浅谈网上银行存在的问题及解决办法

网上银行支持在网络上进行交易的虚拟银行。只要能够上网,无论身在何处,都能够安全便捷地管理自己的资产和享受银行提供的服务。然而网上银行存在诸多的安全问题。本文就针对这些安全问题提出相应的解决办法。     

On guiding the augmentation of an automated test suite via mutation analysis

Mutation testing has traditionally been used as a defect injection technique to assess the effectiveness of a test suite as represented by a “mutation score.” Recently, mutation testing tools have become more efficient, and industrial usage of mutation analysis is experiencing growth. Mutation analysis entails adding or modifying test cases until the test suite is sufficient to detect as many mutants as possible and the mutation score is satisfactory. The augmented test suite resulting from mutation analysis may reveal latent faults and provides a stronger test suite to detect future errors which might be injected. Software engineers often look for guidance on how to augment their test suite using information provided by line and/or branch coverage tools. As the use of mutation analysis grows, software engineers will want to know how the emerging technique compares with and/or complements coverage analysis for guiding the augmentation of an automated test suite. Additionally, software engineers can benefit from an enhanced understanding of efficient mutation analysis techniques. To address these needs for additional information about mutation analysis, we conducted an empirical study of the use of mutation analysis on two open source projects. Our results indicate that a focused effort on increasing mutation score leads to a corresponding increase in line and branch coverage to the point that line coverage, branch coverage and mutation score reach a maximum but leave some types of code structures uncovered. Mutation analysis guides the creation of additional “common programmer error” tests beyond those written to increase line and branch coverage. We also found that 74% of our chosen set of mutation operators is useful, on average, for producing new tests. The remaining 26% of mutation operators did not produce new test cases because their mutants were immediately detected by the initial test suite, indirectly detected by test suites we added to detect other mutants, or were not able to be detected by any test.

A Randomized Algorithm for Online Unit Clustering

In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used. In the one-dimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm. We also provide some lower bounds and an extension to higher dimensions.     

改进的多智能体遗传算法求解TSP研究

多智能体遗传算法是基于智能体对环境感知与反作用的能力提出的一种新的函数优化方法,具有很快的收敛速度,尤其是在优化超高维函数时更显示出了它的优越性。针对这一特点对该算法进行了适当的改进,在邻域正交交叉算子中采用精英保留策略,在自学习算子中引入邻域正交交叉算子并采用小变异概率以加快收敛速度。求解TSP的实验结果显示,改进后算法的性能有了较大的提高。     

新的仿生算法:蟑螂算法

通过模拟蟑螂的觅食行为,提出蟑螂算法(Cockroach Swarm Optimization,CSO)。算法充分利用了蟑螂社会的平等特性和群体智慧。食物再分配、回巢等策略的使用使算法具有较强的全局搜索和局部搜索能力。以TSP问题为例对算法进行仿真测试,实验证明算法有效且优于存在的离散粒子群算法(Discrete Particle Swarm Optimization,PSO)。     

考虑负效应的垃圾回收两级选址-路径模型与算法

针对生活垃圾中转站和焚烧站的选址-路径问题（LRP）,考虑经济目标和垃圾设施的负面影响,设计了与风向和距离有关的负效应分段函数,构建了两级多目标选址-路径（2E-MOLRP）模型,并提出了鲸鱼优化算法（WOA）和模拟退火（SA）算法结合的非支配算法WOA-SA。首先,结合随机方法与Clarke和Wright(CW)节约算法优化初始种群;其次,采用非线性动态惯性权重系数调整收敛速度;然后,设计WOA-SA的并行结构来增强全局搜索能力;最后,使用非支配排序法得到帕累托解集。对Prins和Barreto等35个基准案例以及天津市模拟案例进行分析。结果表明,WOA-SA可以找到20个基准案例的已知最优解（BKS）,且对Prins和Barreto案例的求解结果与BSK差距的平均值分别为0.37%和0.08%,具有很好的收敛性和稳定性。将所提模型和算法应用于实例,给决策者提供了三种不同方案的负效应值及经济成本的方案,以支持不同偏好决策者选择,从而减少垃圾回收物流成本和设施对环境的负面影响。