作为历史观念的《尚书》“先王”观念

"先王"观念与"法先王"思想基本为同一范畴。"先王"观念与古代中国宗法社会紧密相连,还与中国古人对"政治制度和社会文化的延续性"的深刻认识有关。《尚书》中尚未出现"法先王"一词,但是"先王"观念非常浓厚,是中国"法先王"思想的文献源头。"先王"观念也是历史观念的重要体现,它与"殷鉴"思想、"忧患"意识一起构成了《尚书》历史功用思想的整体,并对后世产生了很大影响。     

BSC信道下线性分组码的差错概率下界分析

针对BSC信道,提出了一种线性分组码的最大似然译码差错概率下界的计算方法.根据最大似然译码算法原理,首先将译码差错概率转化为差错事件的联合概率,基于改进的Dawson-Sankoff界的优化准则,推导出BSC信道下线性分组码差错冗余事件的判决准则,最后得到差错概率下界的计算表达式.该下界只依赖于码字的Hamming重量...     

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.     

A higher order coupled frequency characteristics study of smartmagneto-electro-elastic composite plates with cut-outs using finite element methods

This article deals with investigating the effect of cut-outs on the natural frequencies of magneto-electro-elastic (MEE) plates incorporating finite element methods based on higher order shear deformation theory (HSDT). In order to consider the influence of cut-out, the energy of the cut-out domain is sub-tracted from the total energy of the entire plate. The governing equations of motions are derived through incorporating Hamilton's principle and the solution is obtained using condensation technique. The proposed numerical formulation is verified with the results of previously published literature as well as the numerical software. In addition, this research focuses on evaluating the effect of geometrical skewness and boundary conditions on the frequency response. The influence of cut-outs on the degree of coupling between magnetic, electric and elasticfields is also investigated.     

基于随机Petri网的维修质量管理组织结构建模与分析

简述了利用随机Petri网进行维修质量管理组织结构建模的方法。根据实际需求,建立了2种组织结构形式的仿真模型。以模型为基础,对维修质量管理组织结构的静态结构和动态行为进行了研究,解决了维修质量管理组织结构的优选问题,对组织结构设计具有一定的指导作用。     

武器系统效能评估数学模型描述

在武器系统效能评估中,武器系统的战技指标是评估武器系统效能的重要因素.对武器系统的可靠性和维修性进行了研究,并应用于可用性矩阵计算中.利用随机过程理论,建立了武器系统可信性矩阵和武器系统效能能力指数模型,最后建立了武器系统效能评估模型.     

基于随机Petri网的综合航电系统建模及分析

提出了一种利用随机Petri网对综合航电系统进行建模和性能分析的方法.首先,建立了综合航电系统数据总线传输系统的随机Petri网系统模型,通过系统模型进行综合航电系统的性能分析;其次,给出了航空电子综合系统数据总线传输基于固定主控端周期指令的总线性能分析结果;最后,通过两种分析结果的比较,得出了基于随机Petri网对航空电子综合系统数据总线传输建模分析是可行的结论.     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于时滞分割法的具有leakage项时滞的离散型神经网络状态估计

摘要：研究一类具有leakage时滞的离散型神经网络的状态估计问题．通过构造新的Lyapunov泛函得到保证估计误差全局渐近稳定的充分条件,并通过求解一个线性矩阵不等式（LMI）得到状态估计器的增益矩阵．采用一种新的时滞分割方法将变时滞区间分割为多个子区间,使该结果在获得更小的保守性同时也降低了计算的复杂度．     

单小批量武器装备保障的质量屋模型研究

摘要：针对单小批量武器装备保障的特殊需求,对传统的质量屋模型进行了改进,建立了基于装备保障需求与保障规则的质量屋模型,利用整数规划技术进行求解,使得单小批量武器的装备保障规则按照实际保障需求重新排列优先次序,并通过对某型火炮保障方案的筛选验证了模型的正确性．新的质量屋模型发展完善了质量屋的理论与方法,有助于提高单小批量武器的装备保障能力．