排序方式: 共有85条查询结果,搜索用时 31 毫秒
1.
谢九如 《国防科技大学学报》1989,11(4):92-98
在线性电路分析中,直接求解线性时变电路的冲激响应一般是很困难的。但是,可带求解冲激响应的问题转化为在一组等效的初始条件下求解零输入响应的问题,关键在于得出这组等效的初始条件。文中介绍了一种求等效初始条件的方法。 相似文献
2.
应用典型相关分析,主成份分析和多因变量逐步回归分析方法,对陀螺仅随机速率漂移与温度的关系数推进行了分析。文中得出了一些有益的结论,并建立了陀螺仪随机速率漂移与温度相关的数学模型。 相似文献
3.
根据经典控制理论,引入姿态角加速度反馈,采用零、极点相消,变增益补偿等设计方法,所设计的再入机动弹头滚动回路姿态控制系统具有良好的快速性、稳定性和很强的鲁棒性。 相似文献
4.
5.
作为一种集成了光学、电学和机械力学的复杂系统,激光陀螺可以精确地测量物体的角速率输出。为了满足惯性导航系统长时、高精度的测量要求,研究了激光陀螺内部不同类型的传感器与激光陀螺零偏误差之间的特性,在传统的基于温度的零偏误差补偿方法的基础上,引入了二频机抖激光陀螺内部温度传感器、光电二极管和粘在抖动机构上压电陶瓷的输出信息进行复合建模,利用非线性拟合能力强的支持向量机算法,针对不同类型信息与二频机抖激光陀螺零偏误差的相关性对模型进行优化。实验结果表明,该二频机抖激光陀螺零偏误差补偿模型的补偿精度高于传统的补偿方法。 相似文献
6.
Ryusuke Hohzaki 《海军后勤学研究》2008,55(1):76-90
This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
7.
8.
全固态光子带隙光纤已开始用于产生超连续谱,其带隙效应可以控制超连续谱的范围,但是带内的色散特性对于超连续谱的产生有着重要的影响.采用平面波法计算了同一带隙光纤不同阶带隙内的色散曲线和不同带隙光纤同阶带隙内的色散曲线,零色散波长在带内相对位置与带隙位置密切相关,在长波长区域,零色散点位于带隙的短波边;在短波区域,零色散点... 相似文献
9.
Kensaku Kikuta 《海军后勤学研究》2004,51(7):977-993
There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
10.