如何改善路径测试用例生成的搜索算法

软件结构测试数据生成一直是软件测试领域一个较为复杂的问题,方法和手段尚未成熟。基于程序直接执行的测试数据生成方法因其动态性,显示出一定的优越性,本文主要针对该方法的核心部分——搜索算法进行讨论,探讨了有助于改善其功能的若干手段,目的在于提高算法效率,提高其实用化程度,显示出较好的实验效果。     

案例教学法的认识论分析

案例教学法是不同于传统的讲授式的教学方法,它遵循了从现象到本质,从感性认识到理性认识的认识规律;实现了学生由认知客体向认知主体的转变;其逻辑方法的本质是假说———演绎法,其机制是共同体内的讨论。论文分析了案例教学法中存在的问题,并提出了提高案例教学法效果的建议。     

Stochastic regret minimization for revenue management problems with nonstationary demands

We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016     

浅议科技查新咨询服务

简述了科研课题查新的意义及其在医学情报咨询服务中的重要性。阐述了提高查新工作质量的观点及其具体做法。提出在现阶段为了保证科研管理的科学性,避免不必要的重复劳动,加强查新工作非常必要。     

增强军校本科学员指挥谋略能力研究——基于计算机兵棋系统

对指挥谋略进行概念分析,确定基于计算机兵棋系统的指挥谋略训练内容;明确计算机兵棋推演的一般步骤和注意事项;以联军2004年11月"破晓"行动为例运用计算机兵棋系统进行指挥谋略训练。研究表明,基于计算机兵棋系统运用战例研究可以成为增强军校本科学员指挥谋略的训练模式。     

二维衰减谐波估计的四阶混合累积量方法

针对二维衰减谐波估计方法在大样本容量条件下计算量过大的问题,提出了一种基于二维四阶混合累积量的ESPRIT方法。在不影响估计精度的前提下,通过保持特征矩阵结构不变,有效地减小了算法的计算量。利用四阶混合累积量对高斯噪声的自动抑制,降低了参数估计的信噪比门限并提高了估计精度。仿真实验表明,在高斯色噪声条件下该方法的计算效率和估计性能优于现有方法。     

维修性对装备维修工作量的影响分析

通过对装备维修工作量构成的论述,指出装备维修性是决定装备维修工作量的主要因素;通过对装备的维修性的分析,提出了提高装备维修性的有效途径,以达到减少装备维修工作量的目的.结合维修性案例,说明通过改进装备设计提高其维修性具有较大的实际价值.     

关于案例教学的思考

案例教学体现了人作为实践主体参与选择的“自组织系统” ,是对传统“灌输式”、“注入式”教学方法的创新和突破。消防指挥专业实施案例教学 ,能够促进学员实践能力的培养 ,促进学员的创造性思维 ,促进教学改革。     

一例多元案例教学法在程序设计课程教学中的应用

通过探讨一例多元案例教学法的教学理念、设计策略、实施方法和过程,解决程序设计课程教学不能点、线、面融合,缺少培养学员设计综合应用程序能力的方法和手段,学员学习目标不明确、缺乏学习兴趣等问题,以有效提高教学效果和质量.     

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015