全文获取类型
收费全文 | 1742篇 |
免费 | 547篇 |
国内免费 | 238篇 |
出版年
2024年 | 5篇 |
2023年 | 22篇 |
2022年 | 26篇 |
2021年 | 39篇 |
2020年 | 44篇 |
2019年 | 38篇 |
2018年 | 27篇 |
2017年 | 79篇 |
2016年 | 126篇 |
2015年 | 84篇 |
2014年 | 136篇 |
2013年 | 135篇 |
2012年 | 158篇 |
2011年 | 134篇 |
2010年 | 104篇 |
2009年 | 164篇 |
2008年 | 119篇 |
2007年 | 129篇 |
2006年 | 164篇 |
2005年 | 135篇 |
2004年 | 118篇 |
2003年 | 96篇 |
2002年 | 74篇 |
2001年 | 60篇 |
2000年 | 41篇 |
1999年 | 55篇 |
1998年 | 42篇 |
1997年 | 35篇 |
1996年 | 26篇 |
1995年 | 24篇 |
1994年 | 15篇 |
1993年 | 16篇 |
1992年 | 15篇 |
1991年 | 16篇 |
1990年 | 19篇 |
1989年 | 6篇 |
1987年 | 1篇 |
排序方式: 共有2527条查询结果,搜索用时 31 毫秒
971.
基于虚拟模型控制方法,根据四足机器人单腿雅克比矩阵得到支撑相与摆动相的控制法则。为实现机器人躯体的完全控制,提出了一种控制目标分解的方法,将四足机器人躯体的控制目标分解到每条支撑腿的控制上。通过构建每条支撑腿的虚拟构件,并将虚拟构件产生的虚拟力转换为期望关节力矩,从而实现支撑腿的虚拟模型控制;实时规划摆动足的运动轨迹,利用虚拟构件连接摆动腿的足端与期望的摆动轨迹,实现摆动腿的虚拟模型控制。在设定四条腿的相位轮换规律的基础上,对一个四足机器人二维平面模型进行对角小跑步态下的速度控制及抗干扰仿真试验。仿真结果证明该控制方法能够有效控制机器人躯体的高度、速度及倾角,实现四足机器人对角小跑运动的动态控制并具有一定的抗冲击干扰能力。 相似文献
972.
提出了基于递推最小模型误差估计(RMMEE)的地空导弹飞行试验数据相容性检验的方法,该方法采用导弹位置和弹体角位移测量,不仅能在线重构六自由度弹道参数,而且能估计捷联惯导的动态误差,从根本上克服了Klein模型的局限性。该方法对导弹速度、位置估值的初值不敏感,即使存在较大的捷联惯导动态误差,仍具有良好的收敛性和稳健性。 相似文献
973.
磁性目标的高精度建模方法 总被引:17,自引:2,他引:15
以混合阵列模型为例 ,研究了磁性目标的高精度磁场建模方法 ,并设计测试实验 ,对用该方法建立的磁场模型的稳定可靠性进行了测试 .测试结果表明 ,用该方法建立的磁场模型不仅精度高而且稳定可靠 相似文献
974.
通过对随机相位信号检测模型的分析 ,介绍了一种基于该检测模型的对于经FSK调制的随机相位信号的检测方法 ,并阐述了该方法在一种蜂窝式移动通信保密系统中的应用 相似文献
975.
从描述颗粒流动的推广BGK模型方程出发建立颗粒流方程。其中推广BGK模型方程的处理采用了经典分子动力论中的Chapman Enskog方法。由于建立颗粒流方程的思路简单清晰 ,且方程中各量都有明确的物理意义 ,因此易于推广 相似文献
976.
This paper investigates the multivariate Polya distribution (MPD) for application in combat models for which enemy targets must be randomly assigned to fighting units. Six sets of actual combat data motivate the allocation model. Scenarios include air‐to‐air combat, tank, and submarine warfare. Goodness of fit tests are derived which verify the validity of the MPD, and reinforce the notion that multinomial allocation is too simplistic for such combat models. Simulations to determine optimal allocations for minimal combat cost are applied in order to illustrate the role of the MPD in combat modeling. © 2001 John Wiley & Sons,Inc. Naval Research Logistics 48: 1–17, 2001 相似文献
977.
978.
根据细铜丝通过大电流时发生爆炸而导致电阻率的急剧变化的实验数据,建立了其PSpcie电路模型。然后将这个模型应用于一个含电爆炸丝断路开关的电感储能脉冲功率电路,以探讨电爆炸丝的参数选择对脉冲功率调制系统的影响。研究表明电爆炸丝长度主要控制电流切断的效果,而电爆炸丝的根数或截面积主要控制电爆炸丝切断的时刻,并且初始电压愈大,切断愈迅速,在负载上获得更高的电压。这些结论可以较好地解释实验结果。 相似文献
979.
Andreas Schirmer 《海军后勤学研究》2000,47(3):201-222
Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000 相似文献
980.
James Flynn 《海军后勤学研究》2000,47(4):329-352
Consider a single‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one audits the current stock level and decides on deliveries for the next T periods, thus incurring a fixed audit cost and—when one schedules deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy that satisfy the average cost criterion. The current article extends an earlier treatment of this problem, which assumed that the fixed order cost is automatically incurred once every T periods. We characterize an optimal ordering policy when T is fixed, prove that an optimal review period T** exists, and develop a global search algorithm for its computation. We also study the behavior of four approximations to T** based on the assumption that the fixed order cost is incurred during every cycle. Analytic results from a companion article (where μ/σ is large) and extensive computational experiments with normal and gamma demand test problems suggest these approximations and associated heuristic policies perform well when μ/σ ≥ 2. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 329–352, 2000 相似文献