少数民族双语教师汉语言能力提高与学历层次提升的培训策略研究

研究和分析民族教师学习汉语的一些动力因素,正确引导他们学习汉语的动机,有利于激发这一群体学习的内部动力,进而提高民族教师的整体素质,为新疆少民族地区教育的发展奠定基础。     

坦克火控系统的装备现状及发展对策

在坦克的火力、机动性和防护力三大性能指标中,其首要的核心指标是火力,而火力控制技术又是制约坦克火力发展的关键性技术。在综述了国内外坦克火控系统的发展和装备现状的基础上,提出了发展我国坦克火控技术的对策,对于科研机关、生产厂家和部队指战员研制、生产和学习了解性能先进的新型坦克火控系统,具有一定的参考价值     

Military Maladaptation: Counterinsurgency and the Politics of Failure

Tactical learning is critical to battlefield success, especially in a counterinsurgency. This article tests the existing model of military adaption against a ‘most-likely’ case: the British Army’s counterinsurgency in the Southern Cameroons (1960–61). Despite meeting all preconditions thought to enable adaptation – decentralization, leadership turnover, supportive leadership, poor organizational memory, feedback loops, and a clear threat – the British still failed to adapt. Archival evidence suggests politicians subverted bottom-up adaptation, because winning came at too high a price in terms of Britain’s broader strategic imperatives. Our finding identifies an important gap in the extant adaptation literature: it ignores politics.     

军校大学生英语学习观念与策略分析

国内外学者提出了许多关于英语学习策略的理论,并进行了大量的实证研究,但有关军队院校大学生英语学习策略的研究尚未涉猎。了解军队院校非英语专业大学生英语学习的观念和所采用的主要策略,掌握学生各种英语学习观念和采用的学习策略之间的关系。可为军校英语教学提供研究方向。     

Equilibrium customer strategies and social–profit maximization in the single‐server constant retrial queue

We consider the single‐server constant retrial queue with a Poisson arrival process and exponential service and retrial times. This system has not waiting space, so the customers that find the server busy are forced to abandon the system, but they can leave their contact details. Hence, after a service completion, the server seeks for a customer among those that have unsuccessfully applied for service but left their contact details, at a constant retrial rate. We assume that the arriving customers that find the server busy decide whether to leave their contact details or to balk based on a natural reward‐cost structure, which incorporates their desire for service as well as their unwillingness to wait. We examine the customers' behavior, and we identify the Nash equilibrium joining strategies. We also study the corresponding social and profit maximization problems. We consider separately the observable case where the customers get informed about the number of customers waiting for service and the unobservable case where they do not receive this information. Several extensions of the model are also discussed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

互联网对未成年人思想观念的影响与对策

互联网对未成年人思想观念的影响是巨大的,它的影响是双重性的。本文分析了互联网对未成年人思想观念影响的有利因素和不利因素,提出相应的对策,在给予未成年人良好的网络环境的情况下,让互联网成为培养未成年人思想素质的有利工具。     

英语词汇教学原则与策略研究

词汇教学是英语教学的一个重要方面。教师应总结教学实践,针对词汇教学中存在的问题,积极探讨如何改进教学,突出在词汇教学中应贯彻的教学原则以及使用的各种教学方法,研究指导词汇教学的理论,帮助学生取得最佳学习效果。     

潜艇CGF规避反潜航空兵行为建模

对战场态势的不完全观测是潜艇作战的重要特点,充分利用不完全观测信息,提高潜艇对抗决策的合理性是设计潜艇CGF的核心问题。针对潜艇作战特点,提出了潜艇自防御行为模型框架,并利用多Agent不确定场景建模技术,建立了基于POMDP的规避反潜航空兵行为模型,最后进行了仿真验证。结果表明,该模型具有较强的可行性。     

Learning to Fight and Fighting to Learn: Practitioners and the Role of Unit Publications in VIII Fighter Command 1943–1944

A military cannot hope to improve in wartime if it cannot learn. Ideally, in wartime, formal learning ceases and the application of knowledge begins. But this is optimistic. In 1942, USAAF Eighth Air Force assumed it had the means necessary for victory. In reality, its technique and technology were only potentially – rather than actually – effective. What remained was to create the practice of daylight bombing – to learn. This article (1) recovers a wartime learning process that created new knowledge, (2) tests existing tacit hypotheses in military adaptation research, and (3) offers additional theoretical foundation to explain how knowledge is created in wartime     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017