Stability of Motion for Generalized Birkhoffian Systems

The problem on the stability of motion for a generalized Birkhoffian system was studied. The disturbed equations of motion and their first approximation for the system were established. The criterion of stability of motion for the system was set up by using Liapunov's first approximation theory. Based on the theory of Noether symmetry,the Liapunov's function was constructed,and the criterion of stability of motion for the system was also set up by using Liapunov's direct method. Two examples were given to illustrate the application of the results.     

Computation of constrained optimum quantities and reorder points for time-weighted backorder penalties

The purpose of this paper and the accompanying tables is to facilitate the calculation of constrained optimum order quantities and reorder points for an inventory control system where the criterion of optimality is the minimization of expected inventory holding, ordering, and time-weighted backorder costs. The tables provided in the paper allow the identification of the optimal solution when order quantities and/or reorder points are restricted to a set of values which do not include the unconstrained optimal solution.     

Multiple-attribute decision making with partial information: The expected-value criterion

We consider the multiple-attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W . Comparisons are made with another criterion already presented, the comparative hyper-volume criterion, and two small examples are presented.     

基于Rough集理论的数据库推理通道动态消除

提出了一种基于Rough集理论的数据库推理泄漏通道消除方法。在由数据库中所有数据生成的不完备决策表上,该方法应用Rough集理论,分析提取出敏感和非敏感数据之间的确定性推理关系,以此产生推理控制规则。利用这些规则对数据库系统返回给普通用户的数据动态地做最小修改,防止推理通道的产生。实验结果表明,该方法可扩展性强,在保证较高的数据库安全性的同时提高了数据可用性。     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

公众聚集场所火灾危险性评估方法研究

针对公众聚集场所火灾危险性特点，从建筑特征、危险源、消防设施、人员疏散和安全管理等五个方面建立火灾危险性评价指标体系。在此基础上通过专家打分和层次分析法，计算得出各指标因子的权重值，根据有关标准和规范，对各评价指标因子进行等级划分，设计安全检查评分表，采用线性加权模型，计算该场所的系统安全分值，得出火灾危险性评价结果。最后给出一个评估实例，对评估方法进行验证。     

Computing the discounted return in markov and semi-markov chains

This paper addresses the problem of computing the expected discounted return in finite Markov and semi-Markov chains. The objective is to reveal insights into two questions. First, which iterative methods hold the most promise? Second, when are interative methods preferred to Gaussian elimination? A set of twenty-seven randomly generated problems is used to compare the performance of the methods considered. The observations that apply to the problems generated here are as follows: Gauss-Seidel is not preferred to Pre-Jacobi in general. However, if the matrix is reordered in a certain way and the author's row sum extrapolation is used, then Gauss-Seidel is preferred. Transforming a semi-Markov problem into a Markov one using a transformation that comes from Schweitzer does not yield improved performance. A method analogous to symmetric successive overrelaxation (SSOR) in numerical analysis yields improved performance, especially when the row-sum extrapolation is used only sparingly. This method is then compared to Gaussian elimination and is found to be superior for most of the problems generated.     

基于遗传算法与最大最小原理的故障模式特征选择

在诸如液体火箭发动机等复杂动力学系统的故障诊断中，监控参数组的优选问题一直受到工程技术人员的高度重视。本文提出了综合样本矢量方向离散度概念，以此作为故障特征参数的优选准则；然后利用经过改进的遗传算法，对某液体火箭发动机常见故障的诊断进行了特征参数组的优选。在改进的遗传算法中，采用了非常简洁而高效的染色体编码，针对特征优选的组合优化类问题专门设计了一种特殊的基因迁移算子，并引进了父本个体适应值的动态调整技术与共享函数。数值实验结果表明，该算法具有理想的效果。     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

双频去相关单历元动态解算整周模糊度研究

针对GPS实时动态精密相对定位应用背景,提出一种整周模糊度实时求解方法。采用宽巷组合载波相位双差、伪距双差观测信息建立观测模型;对浮点模糊度协方差阵进行一次Cholesky分解,构造了浮点转换矩阵,使浮点模糊度完全去相关;推导确定整周模糊度的搜索空间;利用最小残差平方和搜索准则,确定单历元整周模糊度,并用OVT检验方法,对不同历元得到的整周模糊度进行一致性检验。结果表明,观测量误差均方差取值对整周模糊度搜索空间和成功率有较大影响,附加OVT检验的双频去相关单历元动态解算整周模糊度方法正确可行。     

针对舰船目标高分辨距离像的特征选择方法

为了提高基于高分辨距离像(HRRP)的舰船目标识别率,首先通过目标区域提取来解决HRRP的幅度敏感性和平移敏感性的问题;然后根据传统的特征提取方法,提取出15个较好的特征进行多特征综合识别;最后在基于Fisher准则的特征选择方法上进行改进,提出了一种基于特征互补性的特征选择方法,选择一个最优特征子集。通过仿真实验验证了提出的特征选择方法,同时选择出一个最佳分类器。     

Confronting the “Perpetual Menace to Human Security”

Nuclear weapon states historically have attached great secrecy to their nuclear weapon and fissile material production programs and stockpiles, despite warnings that this would fuel fears, handicap informed debate and decision making, and drive arms races. As evidenced by the “Action Plan on Nuclear Disarmament” agreed upon at the 2010 Treaty on the Non-Proliferation of Nuclear Weapons (NPT) Review Conference, however, the international community now sees greater transparency about nuclear weapon and fissile material stocks as necessary for enabling and monitoring progress toward nuclear disarmament. To support this effort, the International Panel on Fissile Materials has proposed a step-by-step program for weapon states to declare their inventories, production histories, and disposition of nuclear warheads and fissile materials, and to set up joint projects to develop methods for verifying these declarations. This openness initiative is described here, and could be adopted at the 2015 NPT Review Conference, laying a basis for negotiating verifiable deep reductions in nuclear arsenals and their eventual elimination.     

Multiple-attribute decision making with partial information: The comparative hypervolume criterion

A new approach is presented for analyzing multiple-attribute decision problems in which the set of actions is finite and the utility function is additive. The problem can be resolved if the decision makers (or group of decision makers) specifies a set of nonnegative weights for the various attributes or criteria, but we here assume that the decision maker(s) cannot provide a numerical value for each such weight. Ordinal information about these weights is therefore obtained from the decision maker(s), and this information is translated into a set of linear constraints which restrict the values of the weights. These constraints are then used to construct a polytope W of feasible weight vectors, and the subsets H_i (polytopes) of W over which each action a_i has the greatest utility are determined. With the Comparative Hypervolume Criterion we calculate for each action the ratio of the hypervolume of H_i to the hypervolume of W and suggest the choice of an action with the largest such ratio. Justification of this choice criterion is given, and a computational method for accurately approximating the hypervolume ratios is described. A simple example is provided to evaluate the efficiency of a computer code developed to implement the method.     

基于模糊熵与方向相似度的液体火箭发动机故障检测

先定义系统的广义模糊熵及其计算公式，再给出滑动数据窗口中采样数据矢量方向分布中心的离散度定义及其与模糊熵之间的负指数解析关系，并基于离散度概念对自适应窗口滤波器进行了改进，提高了滤波器对噪声的敏感度以及故障检测算法对强干扰噪声环境的鲁棒性。同时，根据滑动数据窗口中二模糊聚类数据中心矢量方向相似度的变化来监示发动机系统故障的发展趋势。本文基于受强噪声环境干扰的实际试车数据并用自组织模糊聚类算法作为滑动数据窗口上的聚类算法进行了数字仿真试验。仿真结果表明：基于模糊熵的故障检测算法具有对强噪声环境的鲁棒性，是低信噪比环境下的一种客观的故障检测算法。     

新型教学模式下教学路径探讨——基于本科教育“四个回归”

实现本科教育的“四个回归”,是新时代背景下高等本科教育教学改革应该完成的目标。要围绕学生的主体地位来建构新型教学模式下教学路径中的学生角色。学生刻苦学习是学生主体学习地位的基础,实行一定比例的淘汰制是学生刻苦学习的重要保证,助力实现“回归常识”。在教师主导课程学习的过程中,要以学生究竟能学到什么和事实上学到什么作为衡量教学效果的标准,助力实现“回归本分”。课程全过程评价方式是动态全方面的评价方式,改变了目的性极强的单一期末考试评价机制,打破了期末考试一考定成绩的传统做法,助力实现“回归初心”和“回归梦想”。     

相空间有限元方法在解二维中子输运方程中的应用

本文采用相空间有限元方法求解了柱形临界多群中子输运问题。其中对于方程中的坐标变量用分片连续线性多项式作为试探函数,对于方程中的角度变量用分片连续双线性多项式作为试探函数。整个求解空间区域和角度区域分别采用三角形和矩形单元划分,然后利用迦辽金方法得到一个以网格点处角通量为未知数的线性联立代数方程组,方程组中的系数矩阵的存储采用了压缩存储技术。最后用高斯消元法解此有限元方程组,表明相空间有限元方法计算收敛性较好、计算精度高。     

Doing Away with “Legitimate Authority”

ABSTRACT

I argue in this article that traditional just war theory did allow private, indeed even individual war, and that arguments in support of a legitimate authority criterion, let alone in support of the “priority” of this criterion, fail. I further argue that what motivates the insistence on “legitimate authority” is the assumption that doing away with this criterion will lead to chaos and anarchy. I demonstrate that the reasoning, if any, underlying this assumption is philosophically confused. The fact of the matter is that wars need not necessarily be authorized by some higher authority (such as a king, president, or parliament) in order to be justified, and this moral fact does not need to lead to chaos and anarchy. Accordingly, the criterion of legitimate authority cannot be relied on to delegitimate individual war, private war, guerrilla war, or even terrorism. Finally, I consider some other defenses of authorization and demonstrate that the “authorization” these accounts defend is either not needed for justification or already provided by other just war criteria or, indeed, entirely fictitious.     

Technical note – operational statistics: Properties and the risk‐averse case

Consider a repeated newsvendor problem for managing the inventory of perishable products. When the parameter of the demand distribution is unknown, it has been shown that the traditional separated estimation and optimization (SEO) approach could lead to suboptimality. To address this issue, an integrated approach called operational statistics (OS) was developed by Chu et al., Oper Res Lett 36 (2008) 110–116. In this note, we first study the properties of this approach and compare its performance with that of the traditional SEO approach. It is shown that OS is consistent and superior to SEO. The benefit of using OS is larger when the demand variability is higher. We then generalize OS to the risk‐averse case under the conditional value‐at‐risk (CVaR) criterion. To model risk from both demand sampling and future demand uncertainty, we introduce a new criterion, called the total CVaR, and find the optimal OS under this new criterion. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 206–214, 2015     

Maximization of long-run average rate-of-return by stochastic approximation

Suppose that an individual has a surplus stock of wealth and a fixed set of risky investment opportunities over a sequence of time periods. Assuming the criterion of maximal long-run average rate-of-return, the individual may select portfolios sequentially via a modified stochastic approximation procedure. This approach yields optimal asymptotic investment results under minimal assumptions.     

空间飞网系统牵拉模式影响研究

针对空间飞网系统任务设计需求,研究飞网牵拉模式对系统展开性能的影响。建立空间飞网系统拉出展开过程动力学模型,并通过地面试验对比验证了模型的有效性。面向任务需求建立空间飞网系统评价指标,针对四、六点牵拉模式,采用有限绳段方法对飞网系统进行建模仿真。模型中保持绳网质量和初始发射能量一致,对评价指标的分析结果表明,在六点牵拉模式下,飞网系统飞行性能指标和力学性能指标有明显提高,但能量利用率和系统可靠性小幅下降。