同步电机卦限识别技术及轴角数字转换器设计

根据同步电机工作原理提出了一种新的同步电机卦限划分及轴角识别技术,并据此技术,完成了同步电机轴角-数字转换器设计.     

On labeling the vertices of products of complete graphs with distance constraints

Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λ_j,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λ_j,k‐number of ∏ K for pairwise relatively prime integers t₁ < t₂ < … < t_q, t₁ ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

India's Tortuous Road to Defence-Industrial Self-Reliance

…Rapid indigenisation is the cornerstone of our policy of self-reliance

India MoD Annual Report 1978–9

     

Advancing “Defence-in-depth”: intelligence and systems dynamics

This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain.     

Military Innovation and Tactical Adaptation in the Israel–Hizballah Conflict: The Institutionalization of Lesson-Learning in the IDF

This article highlights a pattern of military adaptation and tactical problem-solving utilized by the Israel Defense Forces (IDF) while engaged in protracted conflict with the Lebanese militant group Hizballah. It discusses the IDF’s recent attempts to institutionalize their historically intuitive process of ad-hoc learning by developing a formal tactical-level mechanism for ‘knowledge management’. The diffusion of this battlefield lesson-learning system that originated at lower-levels of the organization is examined, as well as its implementation and effectiveness during the 2006 Lebanon War. A nuanced analysis of IDF adaptation illustrates the dynamic interplay between both ‘top-down’ and ‘bottom-up’ processes of military innovation.     

Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Coalitions & the Legitimisation of UK Security Policy

Abstract

David Moore analyses the role of the Treasury in detemining and controlling defence policy and expenditure, and the place of the MoD within this function.     

Computerized scheduling of seagoing tankers

Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone.