全文获取类型
收费全文 | 430篇 |
免费 | 168篇 |
国内免费 | 25篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 10篇 |
2021年 | 6篇 |
2020年 | 21篇 |
2019年 | 17篇 |
2018年 | 14篇 |
2017年 | 37篇 |
2016年 | 34篇 |
2015年 | 29篇 |
2014年 | 31篇 |
2013年 | 33篇 |
2012年 | 37篇 |
2011年 | 27篇 |
2010年 | 25篇 |
2009年 | 36篇 |
2008年 | 24篇 |
2007年 | 26篇 |
2006年 | 39篇 |
2005年 | 32篇 |
2004年 | 26篇 |
2003年 | 16篇 |
2002年 | 15篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 10篇 |
1998年 | 7篇 |
1997年 | 11篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有623条查询结果,搜索用时 15 毫秒
401.
402.
针对航空平台在超低空和超视距飞行过程中,传统单一的TDMA网络难以满足无盲区通信需求,提出一种基于Dijkstra算法的AdHoc组网技术。通过建立实时邻居信息表、网络拓扑表和动态路由,在工程应用中实现了具有中继功能的地空-空空高速实时无线传输网络,满足了部队通信网络大范围覆盖和实时性需求。 相似文献
403.
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 相似文献
404.
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 相似文献
405.
针对磁悬浮刚性转子系统,提出了一种基于在线动平衡的磁轴承参数辨识方法。采用已知大小和相位的不平衡质量作为激振源,根据动平衡仪测得的转子不平衡响应,求得磁轴承位移刚度和电流刚度。利用某型磁悬浮控制力矩陀螺对该方法进行了试验验证,得到了一定转速范围内的磁轴承位移刚度和电流刚度,证明了该方法的正确性和实用性。试验结果表明外转子型磁轴承位移刚度和电流刚度随转速的增加而下降明显。 相似文献
406.
407.
本文采用非线性动态数据系统(NLDDS)建模方法和非线性递推最小二乘算法,对具有迟滞非线性特性的压电陶瓷微进给执行器的动态特征进行了建模、预报与控制,并且用人工神经网络对该类系统的建模与控制进行仿真。结果证明上述方法在一定程度上是可行的和有效的。 相似文献
408.
A mathematical formulation and efficient heuristics for the dynamic container relocation problem 下载免费PDF全文
The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014 相似文献
409.
赵健康 《国防科技大学学报》1999,21(4):114-117
本文针对高动态飞行器的姿态测量中,采用 G P S载波相位测量来确定姿态的原理,以及相关关键技术问题作了深入研究,提出了利用空间几何约束原理来实现高动态飞行器等载体的姿态快速测量,从而达到实时定姿的目的。同时本文针对动态仿真数据进行了大量的仿真计算及精度分析。 相似文献
410.
采用时间和空间二阶精度的TVD格式数值模拟了二维楔的水平相对非定常运动过程与定常组合体流场。在数值模拟时,我们采用了重叠网格技术。这种方法大大减轻了复杂外形的网格生成工作量,而且重叠网格间可以有相对运动,这使我们对相对运动物体流场的数值模拟简便易行。 相似文献