分离模块航天器不确定性多学科设计优化

为了在分离模块航天器研制过程中充分考虑各类不确定性因素的影响,以此对全寿命周期成本、收益以及系统稳健性和灵活性进行综合评价和设计优化,本文对新概念航天器——分离模块航天器概念设计阶段的不确定性多学科设计优化(UMDO)进行了研究.首先,对UMDO方法进行了概述,对分离模块航天器UMDO的主要流程进行了介绍.其次,对分离...     

单层反射模式蓝宝石腔体的9.7GHz频率基准

分析了多层圆柱形蓝宝石腔体谐振器为实现Bragg谐振模式需满足的尺寸条件。仿真并设计了单层腔体,利用teflon支撑件将蓝宝石固定在内部镀银的金属腔体内。其在9.7GHz频点实现了Bragg包含模式,Q值高于200 000。利用该谐振器作为带通滤波器构建了室温下的X波段振荡器。该振荡器还包括低噪放、滤波器和手动移相器。通过合理选择谐振器的插入损耗和调节移相器,该振荡器成功实现了稳定输出。测试结果表明,该振荡器具有低的相位噪声但易受环境温度影响。由于采用了极高Q值的蓝宝石谐振器,该振荡器可能成为目前最低相噪的X波段室温频率基准。     

Understanding contemporary conflicts in Africa: a state of affairs and current knowledge

Understanding contemporary conflicts in Africa remains directly dependent on the approaches employed to decipher or interpret them. This article first examines the bias of conventional approaches (inherited from the Cold War) and then those of a series of supposedly “newer” approaches. Relying primarily on West African examples, it offers a brief overview of current knowledge, issues, and avenues for research, based on three apparent characteristics of a “new generation” of conflicts: the regionalization of wars, the privatization of violence and security, and the recourse to extreme forms of brutality. These three major trends bear witness to a rapid transformation of war and armed violence over the past 20 years, but they are not sufficient to establish a radical historical break between “old” and “new” conflicts in Africa. By concealing elements of continuity a priori, the most influential “new” approaches actually make it impossible to ponder their own limits. To that end, fashionability and struggles for influence within the Africanist field play a major role in perpetuating dominant, sensationalistic, or simplistic (and invariably incorrect) portrayals of African conflicts.     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009