Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

针对AES密码第1轮线性碰撞的代数攻击

将旁路攻击中线性碰撞思想与代数攻击方法相结合,使AES加密操作第1轮中的碰撞转换为线性方程组,构造了SAT求解器求解方程组,利用穷举攻击筛选真实的密钥。实验结果表明,该方法可降低密钥搜索空间,最终获得AES128位真实密钥,攻击效果优于碰撞攻击。     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

动初级高速六相直线感应电机工作特性分析

为了准确刻画对象模型,采用一阶等效电路瞬态涡流分析法对动态边端效应影响下动初级高速六相直线感应电机的参数时变规律进行了定量计算,并通过感应涡流损耗推导得到考虑动态边端效应时电机的等效电路。基于此,通过电磁推力计算及效率评估对动态边端效应影响下电机的工作特性进行了详细分析。利用不同运行速度条件下的有限元仿真及动态实验验证了理论分析和推导的正确性。     

利用混合编程改善SMP机群上并行矩阵乘法的性能

针对SMP机群,探讨了分别利用单机优化、OpenMP与MPI从指令级、共享存储级与分布主存级三个层次上改善矩阵并行乘Fox算法性能的方法。并通过调用数学函数库与混合编程的方式,在深腾6800上进行了实验,取得了相当满意的数值效果。     

面向对象的反舰导弹航路规划

针对反舰导弹航路规划的任务特点,提出了一种面向对象的反舰导弹航路规划方法.在全面分析了反舰导弹航路规划中可能用到的类的基础上,建立了对各种类的描述,使得不同算法和不同任务要求的航路规划可以通过对类的继承和对成员函数的重载实现.最后,在VC 平台下,对这种面向对象的反舰导弹航路规划方法进行了编程实验.     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

整环上不定方程组的通解公式及其应用

借助Z上矩阵A∈Mm×n(Z)的标准形式D=VAU=diag(d1,d2,…,dq,0,…,0),得到了整环上不定方程组AX=B的通解公式以及矩阵初等变换法.     

面向决策的一体化建模方法及其在兵力筹划中的应用

在对军事决策问题的主要特点进行分析的基础上,提出从军事概念模型到数学模型再到定性推理模型的一体化建模思想.以空军航空兵遂行直接航空火力支援任务为想定背景,根据EATI模板,利用基于UML的Rose工具依次对想定任务的实体、任务、交互等进行分析;对于兵力筹划中的结构化问题建立了机会约束多目标规划数学模型;对于非结构化问题则构造了推理机,推理机体现了定量与定性相结合的决策分析思想.最后,以一个实例验证文章思路的可行性.     

DEFENSE SPENDING AND ECONOMIC GROWTH IN TURKEY: A LINEAR AND NON‐LINEAR GRANGER CAUSALITY APPROACH

This paper uses linear and non‐linear Granger causality methods to determine the causal relationship between defense spending and economic growth in Turkey for the period 1949–2004. The innovative feature of this paper is that it provides evidence regarding the nonlinear causal dependence between military spending and economic growth in Turkey. The empirical results contribute to the empirical literature by indicating support for both linear and non‐linear causality between military expenditures and economic development and they may prove useful in theoretical and empirical research by regulators and policy makers.