复杂性视域下高校思想政治理论课教学评价

以复杂系统作为研究对象的复杂性科学,带来了一场思维方式的变革。复杂性理论体现出的方法论特征,超越了传统的还原论的思维定势,为推动思想政治理论课教学评价研究提供新的视角。在复杂性视域下,思政课教学评价需要一种范式转换,弃用将教学目标解析分化、并与预定指标机械对比的简单化操作,树立整体的评价观念,采用相对的价值标准,注重评价的过程属性。     

Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014     

基于博弈论计算机网络对抗问题研究

针对日益普遍和多样的网络攻击行为,如何对网络各种攻防过程进行分析已逐渐成为热点研究方向。在对计算机网络对抗问题复杂性表现和产生根源进行探讨基础上,从完全信息静态博弈、完全信息动态博弈、不完全信息静态博弈、不完全信息动态博弈4个视角,对计算机网络对抗问题进行分类论述,对各解决方法进行了综合比较,并对今后的研究进行了展望。     

Balancing perfectly periodic service schedules: An application from recycling and waste management

A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012     

一种综合集成与演示验证一体化系统的构建方法

复杂性科学问题研究中的综合集成方法是构建研究平台的一项重要内容.针对复杂性研究中的系统平台的建模问题,提出一种综合集成与演示验证一体化系统的构建方法,探讨了具体实现方式和数据同步与数据一致性维护等问题.在雷达目标特性研究中,运用上述综合集成与演示验证一体化系统的构建方法,完成了一个具备尺度一致性和可扩展能力的电磁散射特性验证与演示系统.     

Zodiac算法新的不可能差分攻击

重新评估了Zodiac算法抵抗不可能差分攻击的能力。通过分析Zodiac算法的线性层,给出了Zodiac算法两条新的14轮不可能差分。利用新的不可能差分,结合Early-Abort技术对完整16轮的Zodiac算法进行了不可能差分攻击。攻击过程中一共恢复6个字节的密钥,其时间复杂度只有232.6次加密,数据复杂度约为285.6个明文,该攻击结果与已有最好的结果相比,时间复杂度降低了一个因子233。结果表明由于Zodiac算法线性层的扩散性差,使得该算法对不可能差分分析是不免疫的。     

变量度量估计软件的复杂度

提出软件的变量度量方法分别度量软件的变量个数、变量距离及变量聚合缺乏度来估计软件的复杂度.该方法与已有的软件复杂度度量方法,如Halstead科学度量法、McCabe圈复杂度度量法以及Chidamber的6个度量OO代码的指标等不同,它通过度量构成软件的基本元素-变量,更能从底层抓住软件的本质,而且该方法运用于实际的软件复杂度估计十分准确有效.     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Basic scheduling problems with raw material constraints

One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and L_max and C_max objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

一类基于m序列的非线性序列生成器

构造了一类非线性序列生成器,其生成的序列周期长,线性复杂度高,且可控制。分析表明在满足一定条件下,它具有很高的安全性,适于做密钥流生成器。