面向空间应用的GaN功率器件及其辐射效应

研究氮化镓(GaN)功率器件及其辐射效应对于解决空间应用需求、促进新一代航天器建设具有重大意义。介绍了GaN功率器件的主要结构及工作原理,综述了近年来国内外在GaN功率器件的总剂量效应和单粒子效应两方面的研究进展,并对辐射效应在GaN功率器件中造成的退化和损伤机制进行分析与讨论。研究结果显示：GaN功率器件具有较强的抗总剂量能力,但是抗单粒子能力较弱,易发生漏电和单粒子烧毁,且烧毁点多发生在栅极边缘的漏侧。对GaN功率器件辐照损伤机理的研究缺乏权威理论,有待进一步探索,为其空间应用提供理论支撑。目前,平面结构的GaN功率器件是主流的技术方案,单片集成及高频小型化是GaN功率器件未来发展的方向。     

作战任务总量的迭代收敛性

为降低作战任务的复杂度,提高任务执行效率,研究了作战任务总量及其迭代收敛问题.首先,采用图形和设计结构矩阵,阐明反导作战子任务的复杂联系.再引入任务转移矩阵建立任务总量模型,总结迭代收敛条件.最后,综合考虑资源和时间约束,规划子任务优先级并优化作战资源配置.结合实例分析了任务总量迭代收敛规律的可行性和有效性,为反导作战任务规划提供了理论指导.     

运动与血脂

血脂代谢异常是造成心血管等许多疾病的重要原因。运动能够不同程度的改善机体血脂状况。运动对血脂的影响包括几个方面,本文主要在运动对总胆固醇(TC)、甘油三脂(TG)、低密度脂蛋白(LDL-c)、高密度脂蛋白(HDL-c)、ApoA、ApoB的影响方面给予综述。     

双高速摄像机交汇的高旋弹丸位姿估计算法及误差分析

为了测量高旋弹丸在炮口处的各种信息,基于双高速摄像机交汇的测量方法,提出了一种新的弹丸位姿估计方法.对总攻角函数进行了误差建模与分析,结果表明两台高速摄像机的光轴应相互垂直,且应选择光轴远离攻角平面的高速摄像机所对应的测量函数计算总攻角,此时测量误差最小.以靶场实验的方式对攻角函数的误差分析结论和位姿估计算法进行验证....     

带交易未定权益有偏好无套利定价

针对引入的有交易费正常化资产模型和有偏好套期保值投资策略,利用辅助鞅和资产折算函 数方法,讨论了未定权益的有偏好无套利机会定价问题,还给出了相应的有偏好无套利机会的定价区间。     

部队资产管理与预算管理相结合长效机制建设的思考

按照武警总部资产管理与预算管理相结合的办法要求,公安现役部队实行了资产管理与预算管理相结合改革,取得明显成效,促进了保障效益的提高。如何确保资产管理与预算管理相结合走上规范化、经常化的轨道？如何确保这些工作有章可循、顺畅运转,具有长久的生命力？笔者通过分析目前部队资产使用和管理现状,提出了加强资产管理与预算管理相结合长效机制建设。     

应用全站仪综合测量火炮偏离角及俯仰半径

提出一种应用全站仪进行火炮偏离角和俯仰半径的综合测量方法。应用最小二乘原理拟合出火炮俯仰半径,然后解算出火炮偏离角,并用Monte Carlo方法分析了测量结果的精度。结果表明:全站仪高低角和火炮仰角的测量精度均对火炮偏离角和俯仰半径的测量结果无明显影响;全站仪测距精度对火炮俯仰半径测量结果的影响较大;全站仪水平角测量精度对火炮偏离角测量结果的影响明显。该方法在现场操作时需要重点关注全站仪水平观测角和测距的检测精度。     

Contributors

ABSTRACT

Over the past two decades, the United States has increasingly turned to targeted sanctions and export restrictions, such as those imposed against Iran and North Korea, in order to curb the spread of weapons of mass destruction. One vexing problem, however, is how to contend with jurisdictional hurdles when the violations occur overseas, in countries that are unable or unwilling to assist US enforcement efforts. To solve this problem, US prosecutors are turning to strategies with significant extraterritorial implications— that is, exercising legal authority beyond national borders. One such tool is to use civil legal procedures to seize assets linked to sanctions or export-control violations in jurisdictions that lack cooperative arrangements with US enforcement agencies. While this may be an attractive strategy to bolster enforcement efforts against overseas illicit procurement, using such tools is not without consequence. This article explores the political, legal, and technical implications of enforcing extraterritorial controls against overseas non-state actors by exploring the recent uses of civil-asset forfeiture against Iranian and North Korean procurement networks.     

基于改进遗传算法的天基光学监视平台轨道优化

针对地球遮挡、地影、太阳光干扰、月光干扰、空间目标相对观测平台的角速度等约束对空间目标可见性的影响问题,基于已编目空间目标双行轨道根数,研究以太阳同步晨昏圆轨道作为观测平台轨道,采用改进多变异位自适应遗传算法对单星观测平台轨道进行优化设计。仿真结果表明,改进的多变异位自适应遗传算法有效地解决了多变异位自适应遗传算法不能保证收敛到所有种群中最优个体的问题,且随机抽取10%左右的目标样本可以达到与采用所有目标相当的性能,计算效率提高约一个量级。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004