排序方式: 共有22条查询结果,搜索用时 484 毫秒
1.
研究了线性定常系统在循环指数大于1(即其约当标准形不同的约当块有重根)的情况下测试矩阵的优化方法.以循环子空间相关定理的证明为基础,根据根向量链的相关特性,得到了测试向量的线性和与系统观测性的直接关系,给出了在保证系统可观测性的同时,使得测试代价最小的测试矩阵优化方法.算例表明,提出的方法简单直观,对配置测试向量具有良好的工程价值. 相似文献
2.
在对窄带干扰的频谱特性分析的基础上,采用一种新的利用信号循环平稳特性的方法进行干扰抑制。利用LCL-FRESH滤波器对信号进行更精确的估计,从而有效地抑制了窄带干扰。仿真结果表明,同传统时域预测滤波器相比,这种干扰抑制方法,能够更好地估计和消除窄带干扰,具有更加优越的干扰抑制性能。 相似文献
3.
4.
5.
This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011 相似文献
6.
This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
7.
8.
随着病毒与反病毒竞争的加剧,变形已成为病毒技术中必不可少的一部分,深入剖析病毒变形机理是查杀变形病毒的关键.通过运用循环群的基本理论对两个具体问题进行抽象分析,揭示了这类变形机理的理论依据,并讨论了相应的检测方法. 相似文献
9.
10.
采用循环追踪算法解决编队航天器交会控制问题。建立并推导了线性循环追踪算法和非线性循环追踪算法数学模型,提出了绕飞平面采用循环追踪控制,绕飞平面法向采用比例微分进行振动抑制的编队交会控制律。基于脉冲推力方式,对绕飞平面分别采用线性和非线性循环追踪的三航天器编队交会控制问题进行了仿真分析。仿真结果表明,提出的基于循环追踪的控制方式可满足编队航天器交会控制要求,航天器按顺时针运行轨迹交会于初始位置决定的参考中心,三航天器间相对距离、相对运动速度变化趋势基本一致,速度增量消耗较小,为航天器编队构形控制研究提供有益参考。 相似文献