基于动网格的翼型设计优化

针对传统基于代理模型的翼型优化的缺陷,提出采用基于动网格的翼型优化;针对基本Hicks-Henne方法后缘不光滑情况进行了改进;采用自编程序实现动网格生成,通过集成商业软件Pointwise和CFD计算软件Fluent完成边界条件生成和流场解算,并实现上述程序和软件间的数据交互和自动化,整个优化流程在iSIGHT平台下执行,优化算例表明基于动网格的翼型优化方法能大幅提高翼型性能,节省大量的重复性操作,增加优化结果的鲁棒性和可信度,是翼型优化中的一种有效方法。     

动态液-液旋流分离器油滴运动轨迹模拟

针对动态液-液旋流分离器油、水两相过程,从流体力学基本方程出发,采用雷诺应力模型、QUICK差分格式和SIMPLE算法模拟分析动态液-液旋流分离器内的流场;并以此为基础,采用离散相模型和多相流模型,模拟油、水两相分离过程和油滴运动轨迹.模拟结果表明:油滴粒径决定其在旋流分离器中的运动轨迹、速度及分离特性,大粒径油滴更易于向中心聚集形成油芯,油芯的形状与油滴的大小直接相关;动态液-液旋流分离器的主要分离过程在转筒内完成,油相分离效率随着油滴粒径的增大而提高.     

舰艇近区安全防卫系统分析

针对我国舰艇近区安全存在的问题,参照国外舰艇近区自卫装备发展情况,提出了发展具有综合利用观瞄设备和声纳,并集合各种致命和非致命武器特点的舰艇近区安全防卫系统的构想。系统配备的观瞄设备用于探测地面、水上及低空近临目标,而声纳用于探测水下目标,如蛙人,无人水下航行器等。在打击方面,系统配备了可以歼灭目标的致命武器以及用于驱逐目标的非致命武器。并对系统的关键技术进行了初步探讨。 关键词：舰艇近区安全,近区安全防卫系统,非致命武器     

近炸引信预制破片弹射击效能仿真

提出了利用动态精度试验数据,预测近炸引信预制破片弹射击效能的思路,建立了动态精度预测射击效能的数学模型,在较接近实战条件下模拟计算了近炸引信预制破片弹的射击效能.计算结果与实弹射击结果接近,表明该方法能有效预测近炸引信预制破片弹的射击效能,能为射击试验提供高可信度的验前信息,有助于优化射击试验方案的制定,减少试验样本量,降低试验消耗.     

军事指挥控制中的贝叶斯决策支持

军事指挥控制是一个复杂的决策过程,该过程中信息是结合定性的专家知识和定量的融合数据而得到的.贝叶斯网为指挥控制系统提供了一个框架来处理这种专家知识和具体数据相结合的问题,并且影响图作为贝叶斯网的延伸可被用于分析指挥控制系统中某个决策的可行性.进一步地,为了减少所需指定的条件概率的数量并引入时变的概念,提出动态影响网作为一种新的决策支持方法.     

Ka波段过模慢波结构色散曲线的数值求解 （高功率微波技术研究所专题组稿）

本文运用场匹配法,结合Ka波段过模慢波结构的实际情况,进行轴对称周期慢波结构色散关系的理论推导,得到了一种快速、准确计算适应Ka波段过模慢波结构的色散特性计算方法。根据推导结果,采用Matlab程序编程计算了Ka波段过模盘荷波导的色散曲线。将计算得到的色散曲线与成熟的商业软件计算得到的结果进行了对比,两者误差在2%以内,验证了数值算法的可靠性。计算得到的色散曲线可以辅助选取Ka波段微波源的结构参数,对器件设计有一定参考价值。     

Dynamic regulation on innovation and adoption of green technology with information asymmetry

This study investigates a regulator's dynamic policy to motivate firms' research on and adoption of green technology. In the proposed model, a firm makes unobservable efforts and can hide the technology's arrival from the regulator to avoid adoption costs. We find that the optimal policy follows a simple structure and induces part-time efforts, rather than the maximal effort reported in previous studies. In particular, the regulator should offer no subsidy before the arrival of a technology report, provide a one-time subsidy contingent upon that report, and always set a termination deadline. At the deadline, the firm is forced to select an external option that is associated with social costs. The optimal report-based subsidy decreases with time. Under the optimal policy, the firm works until an effort deadline, makes no effort thereafter, and reports the technology as soon as it arrives. This study also characterizes the necessary and sufficient conditions under which the optimal policy reduces to one that leads, in terms of throughout time, to effort that is maximal or minimal. Our results indicate that policymakers should implement a policy that compensates firms more in the present and less in the future.     

A robust queueing network analyzer based on indices of dispersion

We develop a robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueing network of single-server queues with Markovian routing. The algorithm allows nonrenewal external arrival processes, general service-time distributions and customer feedback. The algorithm is based on a decomposition approximation, where each flow is partially characterized by its rate and a continuous function that measures the stochastic variability over time. This function is a scaled version of the variance-time curve, called the index of dispersion for counts (IDC). The required IDC functions for the external arrival processes can be calculated from the model primitives or estimated from data. Approximations for the IDC functions of the internal flows are calculated by solving a set of linear equations. The theoretical basis is provided by heavy-traffic limits for the flows established in our previous papers. A robust queueing technique is used to generate approximations of the mean steady-state performance at each queue from the IDC of the total arrival flow and the service specification at that queue. The algorithm's effectiveness is supported by extensive simulation studies.     

车载多接入边缘网络中联合资源分配和动态任务卸载方案

针对车联网中车辆移动速度过快产生的任务卸载失败问题,设计了一个有效的任务卸载风险评估模型,并提出了联合资源分配的动态任务卸载方案。将时间、能耗和风险共同建模为系统效用,通过联合优化卸载决策、资源分配来最大化系统效用。优化问题被公式化为混合整数非线性规划,在给定卸载决策的情况下,利用凸优化技术解决计算资源分配问题,功率分配通过分式规划技术来优化。仿真分析了车辆移动性对系统效用的影响,证明了所提方案的合理性。     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。