提高英语作业有效性的思考

本文针对初中生的特点,提出作业布置应具备科学针对性、层次分明性、综合性、新颖趣味性、实践性,提出通过作业评价方式的改变,促进学生学习成绩的提高和个人的发展。     

基于BPAF判决的决策层目标属性融合研究

在D-S证据理论框架下,研究了基于目标基本概率赋值(BPAF)判决的决策层目标属性融合问题。简要介绍了D-S证据组合理论框架,阐述了基于BPAF判决的决策层目标属性融合策略、步骤;分析了证据严重冲突时,Dempster证据组合规则不合理的本质原因;提出必须对D-S证据组合规则进行改善等需要继续深入探讨的几个问题。     

基于BP神经网络的D-S证据理论及其应用

命题基本概率分配(BPA)的确定是D-S证据理论得以广泛应用的关键之一.目前,大部分确定方法受专家知识偏好影响较大,难以反映客观情况.将BP网络运用到基本概率分配的确定过程中,使得BP网络和D-S证据理论两者有机地联合应用,这样既可利用D-S证据理论来表达和处理不确定信息,又可以充分发挥BP网络的自学习、自适应和容错能力.文中建立了基于BP网络的D-S证据理论的故障诊断模型,并给出了证据的融合算法.仿真实验表明,该模型可行.     

A branch‐and‐price algorithm for a targeting problem

In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

计算机“二一十”进制数据转换算法

“二一十”转换是计算机中经常用到的,将二进制浮点数0.B_1B_2…B_n*2~B转换成十进制数0.D_1D_2…D_n*10~D的关键是首先求出D。本文通过全面研制二进制浮点数的性质,推导出了一个关于精确求D的重要结论,并由此构造出一个实际应用时总误差最小的高效求D公式。     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

基于改进鸽群优化的直升机协同目标分配

针对多直升机协同目标分配问题,建立了基于敌我相对态势的对地打击多目标的分配模型。引入多Agent系统机制,加快了有益信息在系统中的流动;并借助雁群成员在飞行中借鉴雁群整体经验的操作,来修正鸽群算法中地标算子的寻优方向,进而提出了基于多Agent的改进鸽群优化的问题求解策略。最后,以典型的直升机对地作战目标分配问题为背景,仿真验证了模型及其求解算法的合理性和有效性。     

预警机指挥多机群空战的协同战术决策

分析了预警机指挥下的多机群协同空战的战术决策方法,建立起了它的战术编队、威胁评估以及目标分配模型,并进行了仿真计算,结果表明此战术决策方法对于提高多机群协同空战的作战效能有着显著的作用,对于未来无人作战飞机多编队协同作战也具有很好的参考价值.     

一种武器-目标分配模型及求解算法

武器-目标分配是拟制作战计划的一项重要内容,是合理运用现有武器系统,充分发挥其作战效能的关键.依据火力分配的基本要素,针对多种武器对多个目标的分配问题,运用一种基于模糊优选技术的多目标混合优化理论,建立了武器-目标最佳分配模型,然后用遗传算法来求解,并在计算机条件下对求解的效果进行了检验.