全文获取类型
收费全文 | 232篇 |
免费 | 81篇 |
国内免费 | 23篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 7篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 9篇 |
2016年 | 20篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 13篇 |
2012年 | 14篇 |
2011年 | 33篇 |
2010年 | 15篇 |
2009年 | 24篇 |
2008年 | 17篇 |
2007年 | 21篇 |
2006年 | 16篇 |
2005年 | 11篇 |
2004年 | 15篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 13篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有336条查询结果,搜索用时 15 毫秒
191.
一种攻击机动目标的变结构导引律研究 总被引:3,自引:0,他引:3
无人机在快速接敌的过程中,传统比例导引法系数的最优解与目标和载机的距离有关,而且一旦目标机动或增加了干扰,跟踪效果都会变差.为了解决这一问题,提出了一种变结构的跟踪方法.仿真结果表明:该方法在未知目标距离的情况下能够快速接敌,且能减小无人机所需过载,提高制导精度和跟踪鲁棒性,限制了视线角速度. 相似文献
192.
193.
基于RBF网络的滑模变结构控制在无刷直流电机伺服系统中的应用 总被引:2,自引:0,他引:2
安树 《军械工程学院学报》2010,22(2):61-64
无刷直流电动机的参数强耦合、高度非线性特性增加了对其速度控制的难度,针对这一特点,设计了一种神经网络滑模变结构速度控制器。将无刷直流电机速度伺服系统分成名义模型和不确定模型,采用状态反馈方法对名义模型进行控制,以RBF神经网络为滑模动态补偿器对不确定系统进行控制。该方法不仪具有变结构控制的抗参数摄动、抗干扰以及速度快等优点,神经网络控制的加入还有效地减弱了单纯滑模变结构控制所带来的“抖振”现象。Matlab仿真结果表明,该控制器具有良好的控制性能和鲁棒性能。 相似文献
194.
195.
利用粒子群优化算法和最小二乘支持向量机,建立了地球静止轨道高能电子通量(1.8-3.5MeV)在线预测模型。针对粒子群优化算法,提出了一种新的粒子群多样性测度计算方法,有效改善了其早熟收敛现象;基于改进的粒子群优化算法优化最小二乘支持向量机的正则化参数和核参数;利用滑动时间窗口策略更新模型数据,设计变量选择触发机制以及模型的再学习机制实现模型的在线预测功能。[根据题目的调整,对摘要做了相应改动]通过对2000年电子通量监测数据和相关太阳风、地磁参数等实际数据进行提前1-3天的预测实验,表明了所建在线预测模型具有较高的预测性能,有一定的实用价值。 相似文献
196.
针对基于多传感器组网进行机动目标跟踪的传感器管理问题,提出了一种基于Rényi信息增量的机动目标协同跟踪算法。首先结合"当前"统计模型和交互式多模型不敏卡尔曼滤波算法设计了一种变结构多模型算法,来进行机动目标的状态估计;然后以Rényi信息增量为评价准则,选择使Rényi信息增量最大的单个传感器进行目标跟踪;最后利用得到的最优加速度估计进行网格划分,更新变结构多模型中的模型集合。在一般机动及强机动场景下进行了算法性能分析,仿真结果表明,该算法能够合理地选择传感器,提高了对机动目标的跟踪精度。 相似文献
197.
In a caching game introduced by Alpern et al. (Alpern et al., Lecture notes in computer science (2010) 220–233) a Hider who can dig to a total fixed depth normalized to 1 buries a fixed number of objects among n discrete locations. A Searcher who can dig to a total depth of h searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero‐sum game is complicated to analyze even for small values of its parameters, and for the case of 2 hidden objects has been completely solved only when the game is played in up to 3 locations. For some values of h the solution of the game with 2 objects hidden in 4 locations is known, but the solution in the remaining cases was an open question recently highlighted by Fokkink et al. (Fokkink et al., Search theory: A game theoretic perspective (2014) 85–104). Here we solve the remaining cases of the game with 2 objects hidden in 4 locations. We also give some more general results for the game, in particular using a geometrical argument to show that when there are 2 objects hidden in n locations and n→∞, the value of the game is asymptotically equal to h/n for h≥n/2. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 23–31, 2016 相似文献
198.
通过试验证实了变极性等离子弧焊换向过程中存在电弧电流谐振现象,且不同极性的电流谐振峰值不同,依据电弧理论分析发现换向期间等效电弧电阻是一个时变量。对换向电路建模分析和仿真结果表明,在换向期间系统阻尼比为时变量,调整系统阻尼比是降低电流谐振峰值的有效途径。又根据变结构控制思想提出了新的换向控制方法,并重新设计了换向电路,显著降低了电流谐振峰值,改善了大电流焊接时换向器件的工作状态,为大功率变极性等离子弧焊电源的研制和开发提供了依据。 相似文献
199.
To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
200.
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献