柔性长鳍扭波推进数学模型分析

以"尼罗河魔鬼"鱼的柔性长背鳍扭波推进模式为研究对象,通过观察活鱼的游动模式,提取影响扭波推进的运动学要素,建立了描述柔性长背鳍扭波推进时动态曲面的数学模型。研究了鳍条仰角与摆动规律对鳍面的影响。最后,用细长体理论分析并计算出推力分布。研究表明,鳍条仰角在φ=85°的情况下所形成的鳍面与垂直鳍条所形成的鳍面相比,其最大偏离值与鳍长之比为1.7%,可以用垂直于基线的鳍条制作模型;鳍条按正弦规律摆动时所形成的扭波波形鳍面与实鱼鳍面相似。     

面内阶跃载荷下薄板弹性动力屈曲差分解

根据薄板微元的动力平衡分析导出薄板动力屈曲控制方程,由屈曲瞬间能量转换率守恒条件得出一个压缩波前屈曲变形的附加约束方程,由此得到求解薄板动力屈曲问题的完备定解条件.以受载边夹支的薄板为倒,利用有限差分法得出了薄板前三阶动力屈曲模态和相应的两个特征参数值,并对比分析了薄板静、动力屈曲的差别.分析表明,薄板动力屈曲过程中产生屈曲动能,比静力屈曲要吸收更多的外部能量.     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

火箭弹防静电短路卡抗静电性能实验研究

通过实验研究了火箭弹系统在安装防静电短路卡前后静态电阻的变化 ,提出了利用脉冲电流发生器测定安装防静电短路卡后系统动态电阻的方法。研究表明 ,安装防静电短路卡后 ,系统动态电阻很小 (小于30mΩ) ,火箭弹抗静电性能明显提高     

行星变速箱换档过程动态仿真研究

从传动系行星排传递单元和构件出发,建立了N自由度行星变速箱运动学数学模型,并运用该模型对三自由度行星变速箱进行了换档过程的动态仿真。     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

基于在线动平衡的磁轴承参数辨识

针对磁悬浮刚性转子系统,提出了一种基于在线动平衡的磁轴承参数辨识方法。采用已知大小和相位的不平衡质量作为激振源,根据动平衡仪测得的转子不平衡响应,求得磁轴承位移刚度和电流刚度。利用某型磁悬浮控制力矩陀螺对该方法进行了试验验证,得到了一定转速范围内的磁轴承位移刚度和电流刚度,证明了该方法的正确性和实用性。试验结果表明外转子型磁轴承位移刚度和电流刚度随转速的增加而下降明显。     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

大深度无动力运载器弹道散布影响因素分析

潜射导弹无动力运载器弹道散布特性是导弹后续弹道和运载器分离体水下散布的重要影响因素,决定其散布的主要因素有初始弹道参数和海洋环境扰动等.建立了运载器空间运动数学模型,利用数理统计中的正交试验法安排实验,对不同工况下运载器上浮弹道进行仿真,通过极差分析确定影响因素的主次关系,利用方差分析法和F检验确定影响因素的显著性.仿真结果表明:横向海流对弹道散布半径影响显著,绕x和y轴的初始角速度及横向海流对位移影响不显著.研究结果可以为弹道规划和运载器加工制造提供一定参考.